Cod sursa(job #3275736)
| Utilizator | Data | 11 februarie 2025 17:54:21 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <int> v[50005];
int n,m,cnt;
int sl[50005];
bool f[50005];
void dfs(int s)
{
f[s]=1;
for(int it : v[s])
{
if(!f[it])
{
f[it]=1;
dfs(it);
sl[++cnt]=it;
}
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
in>>y>>x;
v[x].push_back(y);
}
for(int i=1;i<=n;i++)
{
if(!f[i])
{
dfs(i);
sl[++cnt]=i;
}
}
for(int i=1;i<=n;i++)
out<<sl[i]<<" ";
return 0;
}
