-
Notifications
You must be signed in to change notification settings - Fork 0
/
Бюрократия.cpp
55 lines (44 loc) · 987 Bytes
/
Бюрократия.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <vector>
using namespace std;
vector<int> ans;
vector<vector<int>> graph;
vector<int> status;
bool circle;
//white: 0
//gray: 1
//black: 2
void dfs(int num){
if (circle || (status[num] == 2)) return;
if (status[num] == 1){
circle = true;
return;
}
status[num] = 1;
for (int i = 0; i < graph[num].size(); i++)
dfs(graph[num][i]);
status[num] = 2;
ans.push_back(num + 1);
}
int main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int n, m, a, b;
circle = false;
cin >> n >> m;
status.resize(n);
for (int i = 0; i < n; i++)
status[i] = 0;
graph.resize(n);
for (int i = 0; i < m; i++){
cin >> a >> b;
graph[b - 1].push_back(a - 1);
}
for (int i = 0; i < n; i++)
dfs(i);
if (circle)
cout << -1;
else
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << ' ';
}