Cod sursa(job #1710852)

Utilizator AlexSoareSoare-Nita Alex Constantin Andrei AlexSoare Data 29 mai 2016 21:10:38
Problema Sortare topologica Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.23 kb
#include<iostream>
#include<fstream>
using namespace std;
struct muchie
{
    int a;
    int b;
};
int main()
{
    muchie M[100000];
    int n,m;
    int i,j,man,I;
    int a,b;
    int v[100000];
    fstream f("sortaret.in",ios::in);
    f>>n>>m;
    for(i=1;i<=n;i++)
        v[i]=i;
    for(I=0;I<m;I++)
    {
        f>>a>>b;
        for(i=1;i<=n;i++)
            if(v[i]==a)
                break;
        for(j=1;j<=n;j++)
            if(v[j]==b)
                break;
        if(i>j)
        {
            man = v[i];
            v[i]=v[j];
            v[j]=man;
        }
        M[I].a = a;
        M[I].b = b;
    }
    bool inv=true;
    while(inv)
    {
        inv = false;
        for(I=0;I<m;I++)
        {
            for(i=1;i<=n;i++)
                if(v[i]==M[I].a)
                    break;
            for(j=1;j<=n;j++)
                if(v[j]==M[I].b)
                    break;
            if(i>j)
            {
                man = v[i];
                v[i]=v[j];
                v[j]=man;
                inv = true;
            }
        }
    }
    f.close();
    fstream g("sortaret.out",ios::out);
    for(i=1;i<=n;i++)
        g<<v[i]<<" ";
    g.close();
}