Cod sursa(job #2369778)
Utilizator | Guta Razvan Alexandru RazvanGuta | Data | 6 martie 2019 09:13:28 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,sol[50001],v[50001],nr,i,x,y;
vector <int> G[50001];
void dfs(int nod)
{
v[nod]=1;
sol[++nr]=nod;
for(int i=0;i<G[nod].size();i++)
{
if(!v[G[nod][i]])
dfs(G[nod][i]);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
}
for(i=1;i<=n;i++)
if(!v[i])
dfs(i);
for(i=1;i<=nr;i++)
g<<sol[i]<<" ";
return 0;
}