Timus/1242.cpp at main · Free-Denis/Timus · GitHub

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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <string>

using namespace std;
class graph {
    int n;
    vector<int> children[1001];
    vector<int> parent[1001];
    int* used;
public:

    graph() {
        cin >> n;
        string a1;
        int b,a;
        cin >> a1;
        while (a1 != "BLOOD") {
            a = stoi(a1);
            cin >> b;
            children[a].push_back(b);
            parent[b].push_back(a);
            cin >> a1;
        }
        used = new int[n + 1];
        for (int i = 0; i <= n; i++)
            used[i] = 0;
    }
    void dfs(int sus) {
        stack<int> st;
        int t;
        st.push(sus);
        used[sus] = 1;
        while (!st.empty()) {
            t = st.top();
            bool flag = true;
            for (auto set : children[t]) {
                if (!used[set]) {
                    st.push(set);
                    used[set] = 1;
                    flag = false;
                }
            }
            if (flag)
                st.pop();
        }
    }
    void dfs1(int sus) {
        stack<int> st;
        int t;
        st.push(sus);
        used[sus] = 1;
        while (!st.empty()) {
            t = st.top();
            bool flag = true;
            for (auto set : parent[t]) {
                if (!used[set]) {
                    st.push(set);
                    used[set] = 1;
                    flag = false;
                }
            }
            if (flag)
                st.pop();
        }
    }
    void print() {
        /*for (int i = 0; i <= n; i++) {
            cout << used[i] << " ";
        }
        cout << endl;*/
        bool flag = true;
        for (int i = 1; i <= n; i++) {
            if (used[i] == 0) {
                cout << i << " ";
                flag = false;
            }
        }
        if (flag)
            cout << 0;
    }
};

int main() {
    graph gr;

    int s;
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    cin >> s;
    gr.dfs(s);
    gr.dfs1(s);
    gr.print();
    return 0;
}