#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace __gnu_pbds;
#pragma GCC optimize(2)
#define l int
int read(){
char x = getchar();
int val = 0;
while(x<'0'||x>'9')x=getchar();
while('0'<=x&&x<='9')
val = val*10+x-'0', x=getchar();
return val;
}
void print(int num){
if(num<0){
putchar('-');
num*=-1;
}
if(num>9) {
print(num/10);
}
putchar((num%10)^48);
}
using namespace std;
vector<l> adj[200001];
vector<pair<l,l>> arr[25001];
l region[200001], t, in[200001], out[200001], li[200001], sz[25001], lg[401];
unordered_map<int,int> ans1[401];
unordered_map<int,array<int,401>> ans2;
void merge(unordered_map<l, l> &a, unordered_map<l, l> b){
if(a.size()<b.size())
swap(a, b);
for(auto i: b)
a[i.first]+=i.second;
}
unordered_map<l,l> dfs(l n){
unordered_map<l,l> cur;
cur[region[n]]=1;
in[n]=t++;
arr[region[n]].push_back({in[n],1});
for(auto i: adj[n]){
merge(cur, dfs(i));
}
out[n]=t++;
arr[region[n]].push_back({out[n],0});
if(li[region[n]])
for(auto i: cur)
ans1[li[region[n]]][i.first]+=i.second;
else
for(auto i: lg)
ans2[region[n]][li[i]]+=cur[i];
return cur;
}
l query_s(int r1, int r2){
l sum=0, o=0, a=0, b=0;
vector<int> v;
while(a<arr[r1].size()||b<arr[r2].size()){
if(a<arr[r1].size()&&b<arr[r2].size()){
if(arr[r1][a]<arr[r2][b])
v.push_back(arr[r1][a].second*2-1), a++;
else
v.push_back(0), b++;
} else if(a<arr[r1].size())
v.push_back(arr[r1][a].second*2-1), a++;
else
v.push_back(0), b++;
}
for(auto i: v)
if(i)
o+=i;
else
sum+=o;
return sum/2;
}
int main(){
l n=read(), r=read(), q=read(), lr=0;
region[1]=read();
for(l i = 2; i <= n; i++){
adj[read()].push_back(i);
region[i] = read();
sz[region[i]]++;
}
for(int i = 1; i <= r; i++)
if(sz[i]>500)
lg[lr]=i, li[i]=++lr;
dfs(1);
while(q--){
int r1=read(), r2=read();
if(li[r1])
print(ans1[li[r1]][r2]),cout<<endl;
else if(li[r2])
print(ans2[r1][li[r2]]),cout<<endl;
else
print(query_s(r1, r2)),cout<<endl;
}
return 0;
}
Compilation message
regions.cpp: In function 'int query_s(int, int)':
regions.cpp:57:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
57 | while(a<arr[r1].size()||b<arr[r2].size()){
| ~^~~~~~~~~~~~~~~
regions.cpp:57:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
57 | while(a<arr[r1].size()||b<arr[r2].size()){
| ~^~~~~~~~~~~~~~~
regions.cpp:58:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
58 | if(a<arr[r1].size()&&b<arr[r2].size()){
| ~^~~~~~~~~~~~~~~
regions.cpp:58:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
58 | if(a<arr[r1].size()&&b<arr[r2].size()){
| ~^~~~~~~~~~~~~~~
regions.cpp:63:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | } else if(a<arr[r1].size())
| ~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
8792 KB |
Output is correct |
| 2 |
Correct |
2 ms |
8792 KB |
Output is correct |
| 3 |
Correct |
2 ms |
8792 KB |
Output is correct |
| 4 |
Correct |
4 ms |
8792 KB |
Output is correct |
| 5 |
Correct |
7 ms |
8792 KB |
Output is correct |
| 6 |
Correct |
14 ms |
9472 KB |
Output is correct |
| 7 |
Correct |
21 ms |
9048 KB |
Output is correct |
| 8 |
Correct |
31 ms |
9324 KB |
Output is correct |
| 9 |
Correct |
50 ms |
10912 KB |
Output is correct |
| 10 |
Correct |
90 ms |
9988 KB |
Output is correct |
| 11 |
Correct |
140 ms |
10104 KB |
Output is correct |
| 12 |
Correct |
161 ms |
11500 KB |
Output is correct |
| 13 |
Correct |
216 ms |
10548 KB |
Output is correct |
| 14 |
Correct |
272 ms |
11224 KB |
Output is correct |
| 15 |
Correct |
370 ms |
22312 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
933 ms |
17236 KB |
Output is correct |
| 2 |
Correct |
907 ms |
13432 KB |
Output is correct |
| 3 |
Correct |
1753 ms |
22720 KB |
Output is correct |
| 4 |
Correct |
309 ms |
16808 KB |
Output is correct |
| 5 |
Correct |
373 ms |
20788 KB |
Output is correct |
| 6 |
Correct |
877 ms |
22960 KB |
Output is correct |
| 7 |
Correct |
1281 ms |
29992 KB |
Output is correct |
| 8 |
Correct |
1238 ms |
46192 KB |
Output is correct |
| 9 |
Correct |
2064 ms |
44752 KB |
Output is correct |
| 10 |
Correct |
3276 ms |
79468 KB |
Output is correct |
| 11 |
Correct |
3247 ms |
54824 KB |
Output is correct |
| 12 |
Correct |
1667 ms |
45036 KB |
Output is correct |
| 13 |
Correct |
2557 ms |
47888 KB |
Output is correct |
| 14 |
Correct |
3182 ms |
64272 KB |
Output is correct |
| 15 |
Execution timed out |
8005 ms |
80528 KB |
Time limit exceeded |
| 16 |
Execution timed out |
8082 ms |
109080 KB |
Time limit exceeded |
| 17 |
Execution timed out |
8026 ms |
94692 KB |
Time limit exceeded |
