Cod sursa(job #3264675)
| Utilizator | Data | 23 decembrie 2024 11:58:47 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,x,y,tata[50001];
bool viz[50001];
vector<int>v[50001];
void dfs(int k){
for(auto i:v[k]){
if(viz[i]==0){
fout<<i<<" ";
viz[i]=1;
dfs(i);
}
}
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++){
fin>>x>>y;
v[x].push_back(y);
tata[y]=x;
}
for(int i=1;i<=n;i++)
if(tata[i]==0){
fout<<i<<" ";
dfs(i);
return 0;
}
return 0;
}
