Cod sursa(job #2032512)
| Utilizator | Data | 5 octombrie 2017 09:56:54 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N = 50010;
vector<int> v[N];
int n,m,x,y,i,j,gi[N],q[N];
int main()
{
f>>n>>m;
for(; m; m--)
{
f>>x>>y;
v[x].push_back(y);
gi[y]++;
}
for(i=1;i<=n;i++)
if(!gi[i])
q[++j]=i;
for(i=1;j<n;i++)
for(auto it:v[q[i]])
{
gi[it]--;
if(!gi[it])
q[++j]=it;
}
for(x=1;x<=n;x++)
g<<q[x]<<' ';
return 0;
}
