BZOJ 4010 [HNOI2015] 菜肴制作

最新推荐文章于 2017-10-23 17:08:34 发布

物是人非因果循环

最新推荐文章于 2017-10-23 17:08:34 发布

阅读量262

点赞数

分类专栏：拓扑序

本文链接：https://blog.csdn.net/u010899544/article/details/70113490

版权

拓扑序专栏收录该内容

2 篇文章 0 订阅

订阅专栏

反向图+拓扑序
本题证法详见黄学长博客。

#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std ;
const int N=100010;

int D,n,m;
typedef struct EDGE{
    int to,next;
    EDGE (){
        to=next=0;
    }
    EDGE (int a,int b){
        to=a,next=b;
    }
}E;
E edge[N];
int head[N],cnt;
int ind[N];
priority_queue <int> q;
int ans[N],lens,vis[N];
inline void E_add (int u,int v){
    edge[++cnt]=EDGE (u,head[v]);
    head[v]=cnt;
    ind[u]++;
}
void init (){
    cin >>D;
}
void readin (){
    int i,j,k;
    scanf ("%d %d",&n,&m);
    for (i=1;i<=m;i++){
        scanf ("%d %d",&j,&k);
        E_add (j,k);
    }
}
void work (){
    int i,now,p;
    memset (ans,0,sizeof(ans));
    lens=0;
    for (i=1;i<=n;i++){
        if (ind[i]==0) q.push(i);
    }
    while (!q.empty ()) {
        now=q.top ();
        q.pop ();
        ans[++lens]=now;
        for (p=head[now];p;p=edge[p].next){
            ind[edge[p].to]--;
            if (ind[edge[p].to]==0) q.push (edge[p].to);
        }
    }
    if (lens!=n) {
        printf ("Impossible!\n");
        return ;
    }
    else {
        for (i=n;i>=1;i--) printf ("%d ",ans[i]);
        printf ("\n");
    }
}
int main (){
    init ();
    int i;
    for (i=1;i<=D;i++){
        memset (ind,0,sizeof (ind));
        memset (head,0,sizeof(head));
        cnt=0;
        readin ();
        work ();
    }
    return 0;
}