Cod sursa(job #3310245)
| Utilizator | Data | 12 septembrie 2025 11:48:09 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
const int NMAX=5e4+5;
int n, m, viz[NMAX];
vector<int> adj[NMAX], srt;
void DFS(int u)
{
viz[u]=1;
for(auto v:adj[u])
if(!viz[v])
DFS(v);
srt.push_back(u);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int a, b; cin>>a>>b;
adj[a].push_back(b);
}
for(int i=1;i<=n;i++)
if(!viz[i])
DFS(i);
for(int i=srt.size()-1;i>=0;i--)
cout<<srt[i]<<" ";
return 0;
}