Cod sursa(job #1438488)

Utilizator GeorgianaMMirlogeanu Georgiana GeorgianaM Data 20 mai 2015 00:12:42
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include<iostream>
#include<fstream>
#include<vector>
#include<bitset>
#define NMAX 100001

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


vector <int> G[NMAX];
bitset<NMAX>viz;
int sortareT[NMAX],k=0;

void dfs(int nod)
{
    viz[nod]=1;
    for(unsigned int i=0; i<G[nod].size(); i++)
    {

        if(viz[G[nod][i]]==0)
            dfs(G[nod][i]);
    }

    sortareT[k++]=nod;
}

int main()
{
    int n,m,x,y;

    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        G[x].push_back(y);
    }

    for(int i=1; i<=n; i++)
        if(viz[i]!=1)
            dfs(i);

    for(int i=k; i>=1; i--)    //Solutia a fost generata invers.
        g<<sortareT[i]<<" ";
    return 0;
}