P3243 [HNOI2015]菜肴制作 （拓扑排序）

[HNOI2015]菜肴制作 - 洛谷

建反图跑字典序最大top_sort即可。

/*keep on going and never give up*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define db(x) cerr<<(#x)<<" "<<(x)<<" "<<endl;
#define endl "\n"
#define fast std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const double E = exp(1);
const double PI = acos(-1.0);
const int mod=1e9+7; 
const int maxn=2e5+10;
struct node{
	 int to,nxt;
}e[maxn]; int tot,head[maxn],in[maxn];
int n,m;
void add(int x,int y){ e[++tot]={y,head[x]};head[x]=tot;in[y]++;}
priority_queue<int>q;
vector<int>ans;
void top_sort(){
	for(int i=1;i<=n;i++){
		if(!in[i]) q.push(i);
	}
	while(!q.empty()){
		int now=q.top();q.pop();
		ans.push_back(now);
		for(int i=head[now];i;i=e[i].nxt){
			int v=e[i].to;
			if(!--in[v]) q.push(v);
		}	
	}
}

signed main() {
	fast
	int t=1;
	cin>>t;
	while(t--){
		bool f=0;
		cin>>n>>m;
		tot=0;ans.clear();
		for(int i=1;i<=n;i++){
			head[i]=0;e[i]={0,0};in[i]=0;
		}
		for(int i=1;i<=m;i++){
			int x,y;cin>>x>>y;
			add(y,x);
			if(x==y) f=1;
		}
		top_sort();
		if(ans.size()<n) f=1;
		if(f) cout<<"Impossible!";
		else for(int i=ans.size()-1;i>=0;i--) cout<<ans[i]<<" ";
		cout<<endl;
	}
}