Cod sursa(job #2257710)
Utilizator | Petean Darius XDDDDarius | Data | 10 octombrie 2018 13:45:09 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#include <queue>
#define NMAX 50005
std::ifstream in("sortaret.in");
std::ofstream out("sortaret.out");
using namespace std;
vector<int> v[NMAX];
bool viz[NMAX];
int a,b;
void dfs(int x)
{
out<<x<<" ";
viz[x]=1;
for(int i=0;i<v[x].size();i++)
{
if(!viz[v[x][i]])
{
dfs(v[x][i]);
}
}
}
int main()
{
in>>a>>b;
for(int i=1;i<=b;i++)
{
int x,y;
in>>x>>y;
v[x].push_back(y);
}
for(int i=1;i<=a;i++)
{
if(viz[i]==0)
{
dfs(i);
}
}
return 0;
}