Cod sursa(job #2433185)
| Utilizator | Data | 26 iunie 2019 11:15:34 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream inf("sortaret.in");
ofstream outf("sortaret.out");
int n, m;
vector<int> l[50010];
vector<int> sor;
bool usd[50010];
void DFS(int );
int main()
{
inf>>n>>m;
for(int i=1; i<=m; i++)
{
int x, y;
inf>>x>>y;
l[x].push_back(y);
}
for(int i=1; i<=n; i++)
if(!usd[i])
DFS(i);
reverse(begin(sor), end(sor));
for(auto it:sor)
outf<<it<<' ';
return 0;
}
void DFS(int p)
{
usd[p]=true;
for(auto it:l[p])
if(!usd[it])
DFS(it);
sor.push_back(p);
}
