Cod sursa(job #2869421)
| Utilizator | Data | 11 martie 2022 15:24:16 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int n,m,i,k,g[50004],a,b;
vector<int>G[50004];
queue<int>Q;
int main()
{
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>a>>b;
G[a].push_back(b);
g[b]++;
}
for(i=1;i<=n;i++)
{
if(g[i]==0)
Q.push(i);
}
while(!Q.empty())
{
k=Q.front();
cout<<k<<" ";
Q.pop();
for(auto i:G[k])
{
g[i]--;
if(g[i]==0)
{
Q.push(i);
}
}
}
return 0;
}
