Cod sursa(job #2922220)
| Utilizator | Data | 6 septembrie 2022 15:33:17 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<bits/stdc++.h>
#define int long long
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,ans[50005],viz[50005],k;
vector<int>w[50005];
void dfs(int x)
{
for(auto it:w[x])
{
if(viz[it]==0)
dfs(it),viz[it]=1;
}
k++;
ans[k]=x;
}
signed main()
{
int i,x,y;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
w[x].push_back(y);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
dfs(i);
}
for(i=k;i>=1;i--)
g<<ans[i]<<" ";
return 0;
}
