Pagini recente » Cod sursa (job #83641) | Cod sursa (job #1877915) | Cod sursa (job #1888857) | Cod sursa (job #2634219) | Cod sursa (job #2528588)
#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, nex[NMAX], q[NMAX], k;
vector<int> gr[NMAX];
vector<int> :: iterator it;
void citire() {
fin >> n >> m;
for (int i = 1; i <= m; ++i) {
int x, y;
fin >> x >> y;
gr[x].push_back(y);
nex[y]++;
}
}
void rezolvare() {
for (int i = 1; i <= n; ++i)
if (nex[i] == 0)
q[++k] = i;
for (int i = 1; i <= n; ++i) {
int x = q[i];
for (auto i = gr[x].begin(); i != gr[x].end(); ++i) {
nex[*i]--;
if (nex[*i] == 0)
q[++k] = *i;
}
}
}
int main(int argc, const char * argv[]) {
citire();
rezolvare();
for (int i = 1; i <= n; ++i)
fout << q[i] << " ";
}