#include <bits/stdc++.h>
#pragma GCC Optimize("unroll-loops")
#pragma GCC Optimize("O3")
#pragma GCC target("sse4,avx2,fma,avx")
#define FOR(i, x, y) for (int i = x; i < y; i++)
using namespace std;
const int c = 450;
struct Node {
int id, region, low, high;
vector<int> children;
};
struct Region {
vector<int> ids;
vector<pair<int, int>> ranges;
int depth;
};
Node nodes[200001];
Region regions[25001];
int ans1[450][25001], ans2[25001][450], maps_to[25001];
map<int, int> cache;
void dfs(int node, int& id_pool) {
int id = id_pool++;
int r = nodes[node].region;
regions[r].ids.push_back(id);
regions[r].depth++;
regions[r].ranges.push_back({id_pool, regions[r].depth});
for (int i : nodes[node].children) dfs(i, id_pool);
regions[r].depth--;
regions[r].ranges.push_back({id_pool, regions[r].depth});
}
inline int query(Region a, Region b) {
if (a.ranges.empty()) return 0;
int ans = 0, id = 0;
while (id != b.ids.size() && b.ids[id] < a.ranges[0].first) id++;
for (int i = 0; i < a.ranges.size() - 1 && id != b.ids.size(); i++) {
int pos2 = a.ranges[i + 1].first, depth = a.ranges[i].second;
int old = id;
while (id != b.ids.size() && b.ids[id] < pos2) id++;
ans += depth * (id - old);
}
return ans;
}
int main() {
int n, r, q;
scanf("%d %d %d", &n, &r, &q);
scanf("%d", &nodes[1].region);
FOR(i, 2, n + 1) {
int p;
scanf("%d %d", &p, &nodes[i].region);
nodes[p].children.push_back(i);
}
int id_pool = 1;
dfs(1, id_pool);
int cnt = 1;
FOR(i, 1, r + 1) {
if (regions[i].ids.size() > c) {
FOR(j, 1, r + 1) {
ans1[cnt][j] = query(regions[i], regions[j]);
ans2[j][cnt] = query(regions[j], regions[i]);
}
maps_to[i] = cnt++;
}
}
while (q--) {
int a, b;
scanf("%d %d", &a, &b);
if (regions[a].ids.size() > c)
printf("%d\n", ans1[maps_to[a]][b]);
else if (regions[b].ids.size() > c)
printf("%d\n", ans2[a][maps_to[b]]);
else if (cache.find(25000 * a + b) != cache.end())
printf("%d\n", cache[25000 * a + b]);
else {
int q = query(regions[a], regions[b]);
printf("%d\n", q);
cache[25000 * a + b] = q;
}
fflush(stdout);
}
return 0;
}
Compilation message
regions.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
#pragma GCC Optimize("unroll-loops")
regions.cpp:3:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
#pragma GCC Optimize("O3")
regions.cpp: In function 'int query(Region, Region)':
regions.cpp:42:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (id != b.ids.size() && b.ids[id] < a.ranges[0].first) id++;
~~~^~~~~~~~~~~~~~~
regions.cpp:44:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.ranges.size() - 1 && id != b.ids.size(); i++) {
~~^~~~~~~~~~~~~~~~~~~~~
regions.cpp:44:51: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.ranges.size() - 1 && id != b.ids.size(); i++) {
~~~^~~~~~~~~~~~~~~
regions.cpp:48:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (id != b.ids.size() && b.ids[id] < pos2) id++;
~~~^~~~~~~~~~~~~~~
regions.cpp: In function 'int main()':
regions.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &n, &r, &q);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
regions.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &nodes[1].region);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
regions.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &p, &nodes[i].region);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
regions.cpp:81:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &a, &b);
~~~~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
9592 KB |
Output is correct |
| 2 |
Correct |
10 ms |
9464 KB |
Output is correct |
| 3 |
Correct |
13 ms |
9520 KB |
Output is correct |
| 4 |
Correct |
16 ms |
9592 KB |
Output is correct |
| 5 |
Correct |
16 ms |
9592 KB |
Output is correct |
| 6 |
Correct |
34 ms |
9676 KB |
Output is correct |
| 7 |
Correct |
48 ms |
9640 KB |
Output is correct |
| 8 |
Correct |
54 ms |
9908 KB |
Output is correct |
| 9 |
Correct |
69 ms |
10360 KB |
Output is correct |
| 10 |
Correct |
81 ms |
10460 KB |
Output is correct |
| 11 |
Correct |
136 ms |
10760 KB |
Output is correct |
| 12 |
Correct |
158 ms |
11528 KB |
Output is correct |
| 13 |
Correct |
195 ms |
11232 KB |
Output is correct |
| 14 |
Correct |
232 ms |
11864 KB |
Output is correct |
| 15 |
Correct |
245 ms |
15732 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1153 ms |
16404 KB |
Output is correct |
| 2 |
Correct |
1175 ms |
14828 KB |
Output is correct |
| 3 |
Correct |
1894 ms |
20820 KB |
Output is correct |
| 4 |
Correct |
340 ms |
12796 KB |
Output is correct |
| 5 |
Correct |
481 ms |
15448 KB |
Output is correct |
| 6 |
Correct |
2250 ms |
28296 KB |
Output is correct |
| 7 |
Correct |
1565 ms |
33052 KB |
Output is correct |
| 8 |
Correct |
4592 ms |
43948 KB |
Output is correct |
| 9 |
Correct |
2204 ms |
27176 KB |
Output is correct |
| 10 |
Correct |
6936 ms |
81168 KB |
Output is correct |
| 11 |
Correct |
3454 ms |
28368 KB |
Output is correct |
| 12 |
Correct |
4337 ms |
50856 KB |
Output is correct |
| 13 |
Correct |
4933 ms |
52760 KB |
Output is correct |
| 14 |
Execution timed out |
8007 ms |
58996 KB |
Time limit exceeded |
| 15 |
Execution timed out |
8051 ms |
76140 KB |
Time limit exceeded |
| 16 |
Correct |
7408 ms |
85200 KB |
Output is correct |
| 17 |
Execution timed out |
8042 ms |
73496 KB |
Time limit exceeded |
