Cod sursa(job #1366311)

Utilizator margikiMargeloiu Andrei margiki Data 28 februarie 2015 22:29:22
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
# include <fstream>
# include <algorithm>
# include <vector>
# include <queue>
# include <cstring>
# define NR 50005
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> v[NR];
int i,j,n,m,x,y,VV;
int ap[NR], sol[NR];
void DFS (int k)
{
    ap[k]=1; sol[++VV]=k;
    for (int i=0; i<v[k].size(); ++i)
        if (! ap[v[k][i]]) DFS (v[k][i]);
}
int main ()
{
   f>>n>>m;
   for (i=1; i<=m; ++i)
   {
       f>>x>>y;
       v[x].push_back(y);
   }
   for (i=1; i<=n; ++i)
       if (! ap[i]) DFS (i);

   for (i=1; i<=VV; ++i)
       g<<sol[i]<<" ";


    return 0;
}