Cod sursa(job #2951763)
Utilizator | Data | 7 decembrie 2022 11:10:06 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,k,vz[50001],sol[50001];
vector <int>a[50001];
void dfs(int x)
{
vz[x]=1;
for(auto u:a[x])
if(!vz[u])dfs(u);
sol[++k]=x;
}
int main()
{
int x,y,i;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
}
for(i=1;i<=n;i++)
if(!vz[i])dfs(i);
for(i=k;i>=1;i--)g<<sol[i]<<' ';
}