Cod sursa(job #2781176)
Utilizator | Data | 8 octombrie 2021 18:20:35 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
#include<vector>
using namespace std;
int i,n,m,x,y;
bool o[50001];
vector<int> v[50001];
ifstream f("sortaret.in");
ofstream t("sortaret.out");
void d(int p)
{
o[p]=1;
for(auto j:v[p])
if(!o[j])
d(j);
t<<p<<" ";
}
int main()
{
f>>n>>m;
while(m--)
f>>x>>y,v[y].push_back(x);
for(i=1;i<=n;++i)
if(!o[i])
d(i);
return 0;
}