Mai intai trebuie sa te autentifici.
Cod sursa(job #2473492)
Utilizator | Data | 13 octombrie 2019 18:22:35 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.81 kb |
#include <fstream>
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<stack>
#include<string>
#include<ctype.h>
#include<algorithm>
#define NMAX 100005
using namespace std;
vector<int> V[NMAX];
int postordine[NMAX];
int viz[NMAX];
int n,m,nr;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
void citire()
{
fin>>n>>m;
for(int i = 1; i <= m ; i++)
{
int x,y;
fin>>x>>y;
V[x].push_back(y);
}
}
void DFS(int x)
{
viz[x] = 1;
for(int i = 0 ;i<V[x].size();i++)
if(!viz[V[x][i]] )
DFS(V[x][i]);
postordine[++nr] = x ;
}
int main()
{
citire();
for(int i = 1;i<=n;i++)
{
if(!viz[i])
DFS(i);
}
for(int i = n;i>=1;i--)
fout<<postordine[i]<<" ";
}