Cod sursa(job #2787347)
| Utilizator | Data | 23 octombrie 2021 09:01:34 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <vector>
#include <queue>
#define pb push_back
using namespace std;
using vi=vector<int>;
using qi=queue<int>;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int N=5e4+2;
int n,m,x,y,r[N],i;
vi v[N];
qi q;
int main()
{
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
v[x].pb(y);
r[y]++;
}
for(i=1; i<=n; i++)
if(!r[i])
q.push(i);
while(!q.empty())
{
x=q.front(); q.pop();
fout<<x<<' ';
for(auto i:v[x])
if(!(--r[i]))
q.push(i);
}
return 0;
}
