Mai intai trebuie sa te autentifici.
Cod sursa(job #2302712)
| Utilizator | Data | 15 decembrie 2018 07:56:10 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<cstdio>
#define N 50001
int n,m,v[N],*g[N],w[N],a[2*N],b[2*N],i,u[N],k;
void D(int i)
{
int j;
for(v[i]=1,j=0;j<w[i];j++)
if(!v[g[i][j]])
D(g[i][j]);
u[++k]=i;
}
int main()
{
freopen("sortaret.in","r",stdin),freopen("sortaret.out","w",stdout),scanf("%d%d",&n,&m);
for(i=0;i<m;i++)
scanf("%d%d",&a[i],&b[i]),w[a[i]]++;
for(i=1;i<=n;w[i++]=0)
g[i]=new int[w[i]];
for(i=0;i<m;i++)
g[a[i]][w[a[i]]++]=b[i];
for(i=1;i<=n;i++)
if(!v[i])
D(i);
for(i=n;i;i--)
printf("%d ",u[i]);
}
