Cod sursa(job #2428924)

Utilizator kywyPApescu tiGEriu kywy Data 6 iunie 2019 20:32:36
Problema Sortare topologica Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.73 kb
#include<cstdio>
#include<vector>
using namespace std;

FILE* in=fopen("sortaret.in", "r");
FILE* out=fopen("sortaret.out", "w");
vector<int> v[50007];
bool vizitat[50007];
int n, m;

void srt(int nod)
{
    if(!vizitat[nod])
    {
        fprintf(out, "%d", nod);
        vizitat[nod]=1;
    }
    else return;
    fprintf(out, " ");
    if(v[nod].empty()) return;
    for(int i=0; i<v[nod].size(); ++i)
    {
        srt(v[nod].at(i));
    }
}

int main()
{
    fscanf(in, "%d%d", &n, &m);

    int x, y;
    for(int i=1; i<=m; ++i)
    {
        fscanf(in, "%d%d", &x, &y);
        v[x].push_back(y);
    }
    int nod=1;
    while(nod<n)
    {
        if(!vizitat[nod]) srt(nod);
        ++nod;
    }
}