Cod sursa(job #881163)
| Utilizator | Data | 17 februarie 2013 19:14:44 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<stdio.h>
#include<vector>
using namespace std;
vector <int> p[50005];
int a[50005];
void check(int x)
{
printf("%d ",x);
int i,n;
n=p[x].size();
for(i=0;i<n;i++)
{
a[p[x][i]]--;
if(a[p[x][i]]==0)
check(p[x][i]);
}
a[x]=-1;
}
int main()
{
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
int n,m,i,x,y;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{scanf("%d%d",&x,&y);
p[x].push_back(y);
a[y]++;
}
for(i=1;i<=n;i++)
if(a[i]==0)
check(i);
return 0;
}
