Cod sursa(job #3313963)
| Utilizator | Data | 7 octombrie 2025 15:31:30 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#include<vector>
#include<bitset>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector<unsigned short> a[50001],c;
bitset<50001> b;
void A(int i)
{
b[i]=1;
for(int j:a[i])
if(!b[j])
A(j);
c.push_back(i);
}
int main()
{
unsigned short n;
int m;
for(cin>>n>>m;m--;) {
unsigned short i,j;
cin>>i>>j,a[i].push_back(j);
}
for(unsigned short i=1;i<=n;++i)
if(!b[i])
A(i);
for(;n;cout<<c[--n]<<' ');
return 0;
}
