Pagini recente » Cod sursa (job #3310611) | Cod sursa (job #3310442) | Monitorul de evaluare | Cod sursa (job #3310540) | Cod sursa (job #2175345)
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef pair< int , int > PII;
int n, m, x, y, root;
vector < vector < int > > V;
vector < int > Ans, in;
bitset < 50100 > viz;
inline void dfs(int x){
viz[x] = 1;
Ans.push_back(x);
for (auto it : V[x]){
if (!viz[it]) dfs(it);
}
}
int main(){
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
V.resize(n + 1);
in.resize(n + 1);
for (int i = 0; i < m; i++){
cin >> x >> y;
V[x].push_back(y);
in[y]++;
}
for (int i = 1; i <= n; i++){
if (in[i] == 0) root = i;
}
dfs(root);
for (auto it : Ans) cout << it << " ";
return 0;
}