Cod sursa(job #1430398)

Utilizator supremusChihalau Andrei supremus Data 8 mai 2015 13:00:15
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");

vector <int> v[50001];
int k,n,m,a[50001],viz[50001];
void sortt(int c)
{
     viz[c]=1;
    for(int i=0;i<v[c].size();i++)
        if(viz[v[c][i]]==0)
            sortt(v[c][i]);

    a[k++]=c;
}
int main()
{
    int x,y;
    f>>n>>m;
    for(int i=0;i<m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    for(int i=0;i<n;i++)
    {
        if(viz[i]==0)
            sortt(i);
    }
    for(int i=n;i>0;i--)
        g<<a[i]<<" ";
    return 0;
}