bzoj5280 [Usaco2018 Open]Milking Order（二分答案+拓扑排序）

二分答案，有环就不合法。输出方案拓扑序，来个优先队列确保字典序最小。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define N 100010
#define ll long long
#define inf 0x3f3f3f3f
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,m,h[N],num=0,du[N];
bool vis[N],inq[N],flag;
vector<int>a[50010];
struct edge{
    int to,next;
}data[N<<1];
inline void add(int x,int y){
    data[++num].to=y;data[num].next=h[x];h[x]=num;
}
void dfs(int x){
    vis[x]=inq[x]=1;
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;if(inq[y]) flag=1;
        if(!vis[y]) dfs(y);if(flag){inq[x]=0;return;} 
    }inq[x]=0;
}
inline bool jud(int mid){
    memset(h,0,sizeof(h));num=0;memset(vis,0,sizeof(vis));flag=0;
    for(int i=1;i<=mid;++i){
        for(int j=1;j<a[i].size();++j){
            int x=a[i][j-1],y=a[i][j];add(x,y);
        }
    }for(int i=1;i<=n;++i) if(!vis[i]){dfs(i);if(flag) return 0;}
    return 1;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=1;i<=m;++i){
        int owo=read();
        while(owo--) a[i].push_back(read());
    }int l=1,r=m;
    while(l<=r){
        int mid=l+r>>1;
        if(jud(mid)) l=mid+1;
        else r=mid-1;
    }--l;memset(h,0,sizeof(h));num=0;
    priority_queue<int,vector<int>,greater<int> >q;
    for(int i=1;i<=l;++i){
        for(int j=1;j<a[i].size();++j){
            int x=a[i][j-1],y=a[i][j];add(x,y);du[y]++;
        }
    }for(int i=1;i<=n;++i) if(!du[i]) q.push(i);
    while(!q.empty()){
        int x=q.top();q.pop();printf("%d ",x);
        for(int i=h[x];i;i=data[i].next){
            int y=data[i].to;if(--du[y]==0) q.push(y);
        }
    }return 0;
}