Cod sursa(job #982157)

Utilizator Adrian1997Radulescu Adrian Adrian1997 Data 8 august 2013 18:05:21
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,sol[50011];
bool v[50011],viz[50011];

vector<int> L[50011];

void dfs(int nod){
    viz[nod]=true;
    for(int i=0; i<L[nod].size(); i++)
        if(v[ L[nod][i] ]==0)
            dfs(L[nod][i]);
    a[++k]=x;
}

int main(){
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        L[x].push_back(y);
    }
    f.close();
    for(i=1; i<=n; i++)
        if(v[i]==0)
            dfs(i);
    for(i=1; i<=k; i++)
        g<<a[i]<<' ';
    g.close();
    return 0;
}