Cod sursa(job #3312105)
| Utilizator | Data | 26 septembrie 2025 10:06:31 | |
|---|---|---|---|
| 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");
int n,m,i,dg[50010],q[50010],x;
vector <int> sol;
vector <int> v[50010];
int main()
{
fin>>n>>m;
for(i=1; i<=m; i++)
{
int x,y;
fin>>x>>y;
v[x].push_back(y);
dg[y]++;
}
for(i=1;i<=n;i++)
if(!dg[i])q[++q[0]]=i;
for(i=1;i<=q[0];i++)
{
x=q[i];
for(auto t:v[x])
{
--dg[t];
if(!dg[t])q[++q[0]]=t;
}
}
for(i=1;i<=n;i++)
fout<<q[i]<<" ";
return 0;
}
