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