Pagini recente » Cod sursa (job #2026881) | Cod sursa (job #1211057) | Cod sursa (job #2948009) | Cod sursa (job #585311) | Cod sursa (job #2400370)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int N = 50001;
int lst[N], vf[2*N], urm[2*N], q[N], nr=0, nrp[N];
void Add(int x, int y);
int main()
{
int n, m;
in >> n >> m;
for(int i=1; i<=m; i++)
{
int x, y;
in >> x >> y;
Add(x, y);
}
int st=0, dr=-1;
for(int i=1; i<=n; i++)
{
if(nrp[i]==0)
{
q[++dr]=i;
out << i << ' ';
}
}
while(st<=dr)
{
int x=q[st++];
for(int p=lst[x];p;p=urm[p])
{
int y=vf[p];
nrp[y]--;
if(nrp[y]==0)
{
q[++dr]=y;
out << y << ' ';
}
}
}
return 0;
}
void Add(int x, int y)
{
nr++;
vf[nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
nrp[y]++;
}