Mai intai trebuie sa te autentifici.
Cod sursa(job #1497175)
Utilizator | Data | 6 octombrie 2015 12:34:26 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <bits/stdc++.h>
using namespace std;
int n,m,t[50005],k;
vector<int> a[50005];
bool viz[50005];
inline void Citire()
{
int i,x,y;
ifstream fin("sortaret.in");
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
a[x].push_back(y);
}
fin.close();
}
inline void DFS(int x)
{
int y;
unsigned int i;
viz[x]=true;
for(i=0;i<a[x].size();i++)
{
y=a[x][i];
if(!viz[y])
DFS(y);
}
t[++k]=x;
}
int main()
{
int i;
Citire();
for(i=1;i<=n;i++)
if(!viz[i])
DFS(i);
ofstream fout("sortaret.out");
for(i=k;i>=1;i--)
fout<<t[i]<<" ";
fout<<"\n";
fout.close();
return 0;
}