Cod sursa(job #1335044)

Utilizator t_@lexAlexandru Toma t_@lex Data 4 februarie 2015 21:28:59
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
# include <fstream>
# include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,k,v[50001];
vector<int> a[50001];
bool b[50001];
void read()
{
    int x,y;
    f>>n>>m;
    for(i=1;i<=n;i++)
         {
          f>>x>>y;
          a[x].push_back(y);
         }
}
void DFS(int x)
{
    int i,n=a[x].size();
    b[x]=1;
    for(i=0;i<n;i++)
         if(!b[a[x][i]])
              DFS(a[x][i]);
    v[++k]=x;
}
void write()
{
    for(i=n;i;i--)
         g<<v[i]<<" ";
}
int main()
{
    read();
    for(i=1;i<=n;i++)
        if(!b[i])
            DFS(i);
    write();
    f.close();
    g.close();
    return 0;
}