Cod sursa(job #2949325)
Utilizator | Data | 30 noiembrie 2022 14:03:05 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
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> a[50001];
int i,n,m;
bool v[50001];
void D(int i)
{
v[i]=1;
for(auto j:v[i])
if(!v[j])
D(j);
G<<i<<' ';
}
int main()
{
for(F>>n>>m;F>>i>>m;a[m].push_back(i));
for(i=1;i<=n;++i)
if(!v[i])
D(i);
return 0;
}