Cod sursa(job #1293295)

Utilizator BogdanisarBurcea Bogdan Madalin Bogdanisar Data 15 decembrie 2014 18:40:32
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int N,M,i,x,y,dimsol,dimstart;
int a[50001][3001];
int sol[50001],start[50001];
bool viz[50001],nust[50001];

void depth(int);

int main()
{
    dimsol=dimstart=-1;
    f>>N>>M;
    for (i=0;i<M;++i)
    {
        f>>x>>y;
        a[x][++a[x][0]]=y;
        nust[y]=true;
    }
    for (i=1;i<=N;++i)
        if (!nust[i])
            start[++dimstart]=i;
    for (i=0;i<=dimstart;++i)
    {
        sol[++dimsol]=start[i];
        viz[start[i]]=true;
    }
    for (i=0;i<=dimstart;++i)
    {
        depth(start[i]);
        ++i;
    }
    for (int j=0;j<=dimsol;++j)
        g<<sol[j]<<' ';
    f.close();g.close();
    return 0;
}

void depth(int p)
{
    if (viz[p])
        viz[p]=true;
    else
        sol[++dimsol]=p;
    viz[p]=true;
    for (int j=1;j<=a[p][0];++j)
        if (!viz[a[p][j]])
            depth(a[p][j]);
}