Cod sursa(job #3259827)
| Utilizator | Data | 27 noiembrie 2024 22:56:06 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int NMAX=50001;
vector <int> a[NMAX], st;
bitset <NMAX> viz;
int n, m, x, y, i;
void dfs(int v){
viz[v]=1;
for(int i:a[v]){
if(!viz[i])
dfs(i);
}
st.push_back(v);
//cout<<v<<endl;
}
int main(){
fin>>n>>m;
for(i=1;i<=m;i++){
fin>>x>>y;
a[x].push_back(y);
}
for(i=1;i<=n;i++){
if(!viz[i])
dfs(i);
}
for(i=st.size()-1;i>=0;i--)
fout<<st[i]<<' ';
return 0;
}
