Cod sursa(job #3274314)
| Utilizator | Data | 6 februarie 2025 10:26:37 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n, m, t[2][200020], start[200020], ans[50010], nr;
void citire()
{
int x;
in>>n>>m;
for(int i=1; i<=m; i++)
{
in>>x>>t[0][i];
t[1][i]=start[x];
start[x]=i;
}
}
void dfs(int x)
{
ans[++nr]=x;
int man=start[x];
while(man)
{
dfs(t[0][man]);
man=t[1][man];
}
}
void afisare()
{
for(int i=1; i<=nr; i++)
out<<ans[i]<<" ";
}
int main()
{
citire();
dfs(1);
afisare();
return 0;
}
