Cod sursa(job #2041521)

Utilizator Lazar_LaurentiuLazar Laurentiu Lazar_Laurentiu Data 17 octombrie 2017 15:07:25
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <iostream>
#include <fstream>
#include <vector>
#define MAX 50001

using namespace std;

int n,m,x,y;
vector<int>nd[MAX],ans;
bool acc[MAX];
void prc(int nod){
  acc[nod]=true;
  for(auto i:nd[nod])
    if(not acc[i]) prc(i);
  ans.push_back(nod);
}

int main()
{
    ifstream f ("sortaret.in");
    ofstream g ("sortaret.out");
    f>>n>>m;
    for(int i=1;i<=m;i++){
      f>>x>>y;
      nd[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
      if(not acc[i]){
        acc[i]=true;
        prc(i);
      }
    for(int i=ans.size()-1;i>=0;i--)g<<ans[i]<<" ";
    f.close ();
    g.close ();
    return 0;
}