Cod sursa(job #1667122)
Utilizator | Data | 28 martie 2016 17:47:46 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
deque <int> v[50001];
int w[50001];
int r[50001];
int i,j,n,m,a,b,x;
int main()
{
f>>n>>m;
for(i=1; i<=m; i++)
{
f>>a>>b;
v[a].push_back(b);
w[b]++;
}
for(i=1; i<=n; i++)
if(!w[i])
r[x++]=i;
for(i=0; i<x; ++i)
{
while(!v[r[i]].empty())
{
w[v[r[i]].front()]--;
if(!w[v[r[i]].front()])
r[x++]=v[r[i]].front();
v[r[i]].pop_front();
}
}
for(i=0; i<x; ++i)
g<<r[i]<<' ';
}