Cod sursa(job #3206037)
| Utilizator | Data | 21 februarie 2024 15:16:35 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int NMAX=50001;
bool viz[NMAX];
vector <int> vec[NMAX],st;
int n,m,x,y;
void citire()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
vec[x].push_back(y);
}
}
void dfs(int nod)
{
viz[nod]=1;
for(auto i:vec[nod])
if(viz[i]==0)
dfs(i);
st.push_back(nod);
}
int main()
{
citire();
for(int i=1;i<=n;i++)
if(viz[i]==0)
dfs(i);
for(int i=n-1;i>=0;i--)
g<<st[i]<<' ';
return 0;
}
