Cod sursa(job #1211127)
| Utilizator | Data | 21 iulie 2014 23:39:54 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int viz[50001],n,m,a,b;
vector <int> v[50001];
void dfs(int x)
{
if(viz[x]==0)
g<<x<<" ";
viz[x]=1;
for(int i=0;i<v[x].size();i++)
if(viz[v[x][i]]==0)
dfs(v[x][i]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
f>>a>>b;
v[a].push_back(b);
}
for(int i=1;i<=n;i++)
dfs(i);
return 0;
}
