Cod sursa(job #1902231)

Utilizator DragosCDragos Corleanca DragosC Data 4 martie 2017 14:27:13
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m;
vector<int> muchii[50005];
void Read()
{
    ifstream f("sortaret.in");
    f>>n>>m;
    int x,y;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        muchii[x].push_back(y);
    }
}

int culoare[50002],p[100],tdesc[100],tfin[100],timp,st[50002],k;

void DFS(int u)
{
    culoare[u]=1;
    //tdesc[u]=++timp;
    for (int v = 0; v < muchii[u].size(); v++)
    {
        int y = muchii[u][v];
        if (!culoare[y])
            DFS(y);
    }
    culoare[u]=2;
    //tfin[u]=++timp;
    st[++k]=u;
}

void Write()
{
    ofstream g("sortaret.out");
    for(int i=n; i>0; i--)
        g<<st[i]<<" ";
}

int main()
{
    Read();
    for(int u=1; u<=n; u++)
        if(culoare[u]==0)
            DFS(u);
    Write();
    return 0;
}