Cod sursa(job #2455041)
Utilizator | Data | 10 septembrie 2019 17:55:47 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N = 50010;
int n,m,gradInterior[N];
vector<int> v[N];
queue<int> q;
int main()
{
f>>n>>m;
for(;m;m--)
{
int x,y;
f>>x>>y;
v[x].push_back(y);
gradInterior[y]++;
}
for(int i=1;i<=n;i++)
if(gradInterior[i]==0)
q.push(i);
while(q.size())
{
int nod=q.front();
g<<nod<<' ';
q.pop();
for(auto vec:v[nod])
{
gradInterior[vec]--;
if(gradInterior[vec]==0)
q.push(vec);
}
}
return 0;
}