Mai intai trebuie sa te autentifici.
Cod sursa(job #2451501)
Utilizator | Data | 27 august 2019 00:39:49 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <vector>
#define NMAX 50005
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector<int> g[NMAX];
int n,m,x,y;
bool vizitat[NMAX];
void DFS(int x)
{
vizitat[x]=1;
cout<<x<<" ";
for(size_t i=0; i<g[x].size(); ++i)
if(!vizitat[g[x][i]]) DFS(g[x][i]);
}
void solve()
{
cin>>n>>m;
for(int i=1; i<=m; ++i)
{
cin>>x>>y;
g[x].push_back(y);
}
for(int i=1; i<=n; ++i)
if(!vizitat[i]) DFS(i);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
}