Cod sursa(job #1736517)

Utilizator alex.craciunCraciun Alexandru alex.craciun Data 1 august 2016 21:38:52
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <stack>
#include <vector>
#include <cstdio>
using namespace std;
vector <int> lv[50020];
stack <int> s;
int n,m;
int used[50020];
FILE *f=fopen("sortaret.in","r");
void citire( )
{
    int x,y;
    fscanf(f,"%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        fscanf(f,"%d%d",&x,&y);
        lv[x].push_back(y);
    }
}
void dfs(int nc)
{
    used[nc]=1;
    vector <int> ::iterator ii;
    for(ii=lv[nc].begin();ii!=lv[nc].end();ii++)
        if(!used[*ii])
          dfs(*ii);
    s.push(nc);

}
void afisare( )
{
    for(int i=1;i<=n;i++)
        if(!used[i])
          dfs(i);
    FILE *f1=fopen("sortaret.out","w");
    while(!s.empty())
    {
        fprintf(f1,"%d ",s.top());
        s.pop();
    }
}
int main()
{
    citire();
    afisare();
    return 0;
}