Pagini recente » Cod sursa (job #2071431) | Istoria paginii runda/dedicatie_speciala | Diferente pentru runda/tema_vacanta_tiberiu_popoviciu intre reviziile 1 si 2 | Cod sursa (job #2890149) | Cod sursa (job #2682056)
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef double ld;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
vector<int> G[50010];
int deg[50010];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
fin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
fin >> x >> y;
G[x].pb(y);
deg[y]++;
}
vector<int> solution;
queue<int> q;
for (int i = 1; i <= n; i++) {
if (deg[i] == 0) {
q.push(i);
solution.pb(i);
}
}
while (!q.empty()) {
int nod = q.front();
q.pop();
for (auto &vecin : G[nod]) {
deg[vecin]--;
if (deg[vecin] == 0) {
q.push(vecin);
solution.pb(vecin);
}
}
}
for (auto sol : solution) {
fout << sol << " ";
}
return 0;
}