Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int n;
- vector <int> g[100010];
- int in[100010];
- int out[100010];
- int t = 1 ;
- int color[100010];
- int q = 0;
- void dfs (int v)
- {
- cout << v << " ";
- in[v] = t;
- t++;
- color[v] = 1;
- cout << g[0].size() << " ";
- for (int i = 0; i < g[v].size(); i++)
- {
- int u = g[v][i];
- cout << u << " " << color[u];
- if (color[u] == 0)
- {
- dfs(u);
- }
- }
- out[v] = t;
- t++;
- color[v] = 2;
- }
- int main()
- {
- cin >> n;
- for (int i = 0; i < n; i++)
- {
- int x;
- cin >> x;
- if (x != 0)
- {
- g[i].push_back(x - 1);
- g[x - 1].push_back(i);
- }
- else
- {
- q = i;
- }
- }
- for (int i = 0; i < g[0].size(); i++)
- {
- cout << g[0][i] << " " ;
- }
- cout << endl;
- for (int i = 0 ; i < sizeof(color) ; i++)
- color[i] = 0;
- dfs(q);
- int m;
- cin >> m;
- cout << endl;
- for (int i = 0; i < n ; i++)
- {
- cout << in[i] << " " << out[i] << endl;
- }
- for (int i = 0; i < m; i++)
- {
- int a, b;
- cin >> a >> b;
- if (in[a - 1] < in[b - 1] && out[b - 1] < out [a - 1])
- {
- cout << "1" << endl;
- }
- else
- {
- cout << "0" << endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement