Cod sursa(job #3312104)
| Utilizator | Data | 26 septembrie 2025 10:04:21 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,i,x,y,deg[50005],q[50005];
vector<int> v[50005];
int main()
{
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>x>>y;
v[x].push_back(y);
deg[y]++;
}
for(i=1;i<=n;i++)
{
if(deg[0]==0)
{
q[++q[0]]=i;
}
}
for(i=1;i<=n;i++)
{
x=q[i];
for(auto it=v[x].begin();it!=v[x].end();it++)
{
deg[*it]--;
if(deg[*it]==0) q[++q[0]]=*it;
}
}
for(i=1;i<=n;i++) cout<<q[i]<<' ';
return 0;
}
