Cod sursa(job #3121901)
Utilizator | Data | 16 aprilie 2023 07:57:01 | |
---|---|---|---|
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");
vector<int> v[50001];
int n,i,j;
bool a[50001];
void A(int i)
{
a[i]=1;
for(int j:v[i])
if(!a[j])
A(j);
G<<i<<' ';
}
int main()
{
for(F>>n>>i;F>>i>>j;v[j].push_back(i));
for(i=1;i<=n;++i)
if(!a[i])
A(i);
return 0;
}