Cod sursa(job #2680313)
| Utilizator | Data | 3 decembrie 2020 11:25:41 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define lim 50000
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector<int> v[lim+5];
vector<int> sol;
bitset<lim+5> gr, viz;
int n, m;
void dfs(int nod)
{
viz[nod]=1;
sol.push_back(nod);
for(int i : v[nod]) if(viz[i]==0)
dfs(i);
}
int main()
{
in>>n>>m;
for(int i=1; i<=m; i++)
{
int x, y;
in>>x>>y;
v[x].push_back(y);
gr[y]=1;
}
for(int i=1; i<=n; i++) if(gr[i]==0) dfs(i);
for(int i : sol) out<<i<<' ';
return 0;
}
