Cod sursa(job #2950737)
Utilizator | Margarit Andrei AndreiMargarit | Data | 4 decembrie 2022 16:43:08 |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.83 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> a[50001];
int q[50002],grad[50001];
int main()
{int n,m,i,nod,nod2,st,dr;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>nod>>nod2;
a[nod].push_back(nod2);
grad[nod2]++;
}
st=1; dr=0;
for(i=1;i<=n;i++)
{
if(grad[i]==0)
{
dr++;
q[dr]=i;
}
}
while(st<=dr)
{
nod=q[st];
st++;
for(i=0;i<a[nod].size();i++)
{
nod2=a[nod][i];
grad[nod2]--;
if(grad[nod2]==0)
{
dr++;
q[dr]=nod2;
}
}
}
for(i=1;i<=n;i++)
{
g<<q[i]<<" ";
}
return 0;
}