Cod sursa(job #2543074)
| Utilizator | Data | 10 februarie 2020 20:20:56 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
ofstream o("sortaret.out");
vector <int> v[50010];
int n; bool viz[50010];
void citire(){
ifstream f("sortaret.in");
int i,m,x,y; f>>n>>m;
for(i=1;i<=m;i++){
f>>x>>y;
v[y].push_back(x);
}
f.close();
}
void dfs(int k){
viz[k]=1;
int i,nv;
for(i=0;i<v[k].size();i++){
nv=v[k][i];
if(!viz[nv]) dfs(nv);
}
o<<k<<" ";
}
int main(){
int i; citire();
for(i=1;i<=n;i++)
if(!viz[i]) dfs(i);
return 0;
}
