Cod sursa(job #1832719)

Utilizator KronSabau Valeriu Kron Data 20 decembrie 2016 19:50:24
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <iostream>
#include <vector>
#include <iterator>
#include <fstream>
#define NMAX 50010
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m;
vector <int> adj[NMAX];
int vf,q[NMAX],grad[NMAX];

void Sort()
{
    for(int i=1;i<=n;i++)
        if(grad[i]==0)
        {
            q[vf]=i;
            vf++;
        }
    int x;
    for(int i=0;i<n;i++)
    {
        x=q[i];
        for(vector<int>::iterator it=adj[x].begin();it!=adj[x].end();it++)
        {
            grad[*it]--;
            if(grad[*it]==0)
            {
                q[vf]=*it;
                vf++;
            }
        }
    }
}

int main()
{

    f >> n >> m;
    int x,y;
    for(int i=0;i<m;i++)
    {
        f>> x >> y;
        adj[x].push_back(y);
        grad[y]++;
    }
    Sort();
    for(int i=0;i<n;i++)
        g << q[i] << " ";
    return 0;
}