Cod sursa(job #454369)

Utilizator alex_dincaDinca Alexandru-Nicolae - UPB alex_dinca Data 11 mai 2010 22:28:09
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <stdio.h>
#include <vector>

using namespace std;

#define MAXN 50100
#define pb push_back

int N, M, deg[MAXN], Q[MAXN];
vector<int> G[MAXN];

void solve(void)
{
    int i, x; vector<int>::iterator it;
    
    for(x = 1; x <= N; x++)
     if(deg[x] == 0) Q[++Q[0]] = x;

    for(i = 1; i <= N; i++)
    {
        x = Q[i];
        for(it = G[x].begin(); it != G[x].end(); ++it)
        {
            deg[*it]--;
            if(deg[*it] == 0) Q[++Q[0]] = *it;
        }
    }
}

void read_data(void)
{
    int i, a, b;
    
    FILE *f=fopen("sortare.in", "rt");
    fscanf(f, "%d %d\n", &N, &M);
    for(i = 1; i <= M; i++)
        fscanf(f, "%d %d\n", &a, &b), G[a].pb(b), deg[b]++;
    fclose(f);
}

void write_data(FILE *f)
{
    int i;

    for(i = 1; i <= N; i++)
        fprintf(f, "%d ", Q[i]);
}

int main(void)
{
    FILE *f=fopen("sortaret.out", "wt");

    read_data();
    solve();
    write_data(f);

    fclose(f);

    return 0;
}