Cod sursa(job #2467551)
Utilizator | Avram Rares Stefan avramrares | Data | 4 octombrie 2019 16:51:45 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
vector <int> G[103];
vector <int> :: iterator it;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,st,x,y,k1;
bool sel[103];
int sol[104];
void df(int x)
{
sol[++k1]=x;
sel[x]=true;
for(auto it:G[x])
if(!sel[it])
df(it);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
}
for(int i=1;i<=n;i++)
sort(G[i].begin(),G[i].end());
df(1);
for(int i=k1;i>=1;i--)
g<<sol[k1-i+1]<<" ";
return 0;
}