Cod sursa(job #2720986)
Utilizator | Data | 11 martie 2021 14:33:15 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N=5e4+10;
vector <int> a[N];
int n,m,nrp[N];
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
a[x].push_back(y);
nrp[y]++;
}
queue <int> q;
for(int i=1;i<=n;i++)
{
if(nrp[i]==0)
{
q.push(i);
}
}
while(!q.empty())
{
int x=q.front();
g<<x<<" ";
q.pop();
for(auto i:a[x])
{
nrp[i]--;
if(nrp[i]==0)
{
q.push(i);
}
}
}
return 0;
}