反向寻求答案的思想
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define md
#define ll long long
#define inf (int) 1e9
#define eps 1e-8
#define N 100010
using namespace std;
struct EE {int x,t,ne;} e[N*2];
int vis[N],du[N],v[N],ans[N];
priority_queue<int> q;
int num=0;
void put(int x,int y)
{
num++; e[num].x=x; e[num].t=y;
e[num].ne=v[x]; v[x]=num;
du[y]++;
}
int main()
{
int tt,n,m,x,y;
scanf("%d",&tt);
while (tt--)
{
memset(vis,0,sizeof(vis));
memset(v,0,sizeof(v)); num=0;
memset(du,0,sizeof(du));
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
put(y,x);
}
for (int i=1;i<=n;i++)
if (du[i]==0)
{
vis[i]=1;
q.push(i);
}
int tot=0;
while (!q.empty())
{
x=q.top(); q.pop(); ans[++tot]=x;
for (int i=v[x];i;i=e[i].ne)
{
y=e[i].t; du[y]--;
if (du[y]==0) q.push(y);
}
}
if (tot!=n) printf("Impossible!\n");
else
{
for (int i=n;i;i--) printf("%d ",ans[i]);
printf("\n");
}
}
return 0;
}