Cod sursa(job #2925619)
Utilizator | Data | 15 octombrie 2022 20:03:36 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("sortaret.in");
ofstream G("sortaret.out");
int i,n,m;
bool o[50001];
vector<int> v[50001];
void A(int p)
{
o[p]=1;
for(auto j:v[p])
if(!o[j])
A(j);
G<<p<<' ';
}
int main()
{
for(F>>n>>m;F>>i>>m;v[m].push_back(i));
for(i=1;i<=n;++i)
if(!o[i])
A(i);
return 0;
}