Cod sursa(job #2373538)
Utilizator | Avram Gheorghe SweetHuman | Data | 7 martie 2019 14:00:46 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f1("sortaret.in");
ofstream f2("sortaret.out");
int n,m;
vector<int> legaturi[50005];
bitset<50005> viz;
void dfs(int start){
f2<<start<<" ";
viz[start] = true;
for(auto nod : legaturi[start]){
if(viz[nod] == false)
dfs(nod);
}
}
int main() {
f1>>n>>m;
int x,y;
for(int i=0;i<m;i++){
f1>>x>>y;
legaturi[x].push_back(y);
}
dfs(1);
return 0;
}