Cod sursa(job #2058268)
| Utilizator | Data | 5 noiembrie 2017 13:39:06 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N = 50010;
int n,m,x,y,gr[N],q[N],t,b;
vector<int> v[N];
int main()
{
f>>n>>m;
for(; m; m--)
{
f>>x>>y;
v[x].push_back(y);
gr[y]++;
}
for(x=1;x<=n;x++)
if(!gr[x])
q[++t]=x;
for(b=1;b<=n;b++)
{
g<<q[b]<<' ';
for(auto vec:v[q[b]])
{
gr[vec]--;
if(!gr[vec])
q[++t]=vec;
}
}
return 0;
}
