#include<bits/stdc++.h>
using namespace std;
const int MX = 200005;
struct FenwickTree {
vector<int> bit; // binary indexed tree
int n = MX;
int sum(int r) {
if(bit.empty()) bit.resize(n);
int ret = 0;
for (; r >= 0; r = (r & (r + 1)) - 1)
ret += bit[r];
return ret;
}
int sum(int l, int r) {
return sum(r) - sum(l - 1);
}
void add(int idx, int delta) {
if(bit.empty()) bit.resize(n);
for (; idx < n; idx = idx | (idx + 1))
bit[idx] += delta;
}
};
const int B = 400;
int N, R, Q;
vector <int> g[MX], regionAll[MX], regionEl[MX];
int H[MX], st[MX], en[MX], timer=1;
int found[MX];
map <int, vector <int>> prep;
void Flat(int v, int p) {
st[v] = timer++;
if(!found[H[v]]) {
found[H[v]] = st[v];
regionEl[H[v]].push_back(v);
}
regionAll[H[v]].push_back(v);
for(auto to : g[v]) if(to!=p) {
Flat(to, v);
}
en[v] = timer-1;
if(found[H[v]]==st[v]) {
found[H[v]] = 0;
}
}
int main() {
cin >> N >> R >> Q;
cin >> H[1];
for(int i=2; i<=N; ++i) {
int p; cin >> p >> H[i];
g[p].push_back(i);
}
Flat(1, 1);
vector <int> bigs;
for(int i=1; i<=R; ++i) if(regionAll[i].size()>B) {
bigs.push_back(i);
}
int sz_big = bigs.size();
FenwickTree A;
for(int all=1; all<=R; ++all) {
for(auto it : regionAll[all]) {
A.add(st[it], 1);
}
for(auto b : bigs) {
if(prep[b].empty()) prep[b].resize(25001);
for(auto it : regionEl[b]) {
prep[b][all] += A.sum(st[it], en[it]);
}
}
for(auto it : regionAll[all]) {
A.add(st[it], -1);
}
}
map <int, FenwickTree> sb;
for(auto b : bigs) {
for(auto it : regionAll[b]) {
sb[b].add(st[it], 1);
}
}
while(Q--) {
int r1, r2;
cin >> r1 >> r2;
int ans = 0;
if(regionAll[r1].size()>B) {
ans = prep[r1][r2];
} else {
if(regionAll[r2].size()>B) {
for(auto it : regionEl[r1]) {
ans += sb[r2].sum(st[it], en[it]);
}
} else {
int p1 = 0, p2 = 0;
while(p1<regionEl[r1].size() && p2<regionAll[r2].size()) {
auto ok = [&] (int p1, int p2) {
return st[regionEl[r1][p1]]<=st[regionAll[r2][p2]] &&
en[regionEl[r1][p1]]>=en[regionAll[r2][p2]];
};
while(p2<regionAll[r2].size() && ok(p1, p2)) ++p2, ++ans;
while(p2<regionAll[r2].size() && st[regionAll[r2][p2]]<st[regionEl[r1][p1]]) ++p2;
if(p2==regionAll[r2].size()) continue;
while(p1<regionEl[r1].size() && en[regionEl[r1][p1]]<st[regionAll[r2][p2]]) ++p1;
}
}
}
cout << ans << endl;
}
return 0;
}
Compilation message
regions.cpp: In function 'int main()':
regions.cpp:94:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
94 | while(p1<regionEl[r1].size() && p2<regionAll[r2].size()) {
| ~~^~~~~~~~~~~~~~~~~~~~
regions.cpp:94:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
94 | while(p1<regionEl[r1].size() && p2<regionAll[r2].size()) {
| ~~^~~~~~~~~~~~~~~~~~~~~
regions.cpp:99:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
99 | while(p2<regionAll[r2].size() && ok(p1, p2)) ++p2, ++ans;
| ~~^~~~~~~~~~~~~~~~~~~~~
regions.cpp:100:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
100 | while(p2<regionAll[r2].size() && st[regionAll[r2][p2]]<st[regionEl[r1][p1]]) ++p2;
| ~~^~~~~~~~~~~~~~~~~~~~~
regions.cpp:101:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | if(p2==regionAll[r2].size()) continue;
| ~~^~~~~~~~~~~~~~~~~~~~~~
regions.cpp:102:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
102 | while(p1<regionEl[r1].size() && en[regionEl[r1][p1]]<st[regionAll[r2][p2]]) ++p1;
| ~~^~~~~~~~~~~~~~~~~~~~
regions.cpp:59:6: warning: unused variable 'sz_big' [-Wunused-variable]
59 | int sz_big = bigs.size();
| ^~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
8 ms |
15176 KB |
Output isn't correct |
| 2 |
Incorrect |
8 ms |
15176 KB |
Output isn't correct |
| 3 |
Incorrect |
11 ms |
15176 KB |
Output isn't correct |
| 4 |
Incorrect |
13 ms |
15176 KB |
Output isn't correct |
| 5 |
Incorrect |
14 ms |
15176 KB |
Output isn't correct |
| 6 |
Incorrect |
25 ms |
15304 KB |
Output isn't correct |
| 7 |
Incorrect |
23 ms |
15176 KB |
Output isn't correct |
| 8 |
Incorrect |
27 ms |
15304 KB |
Output isn't correct |
| 9 |
Incorrect |
58 ms |
15816 KB |
Output isn't correct |
| 10 |
Incorrect |
83 ms |
15656 KB |
Output isn't correct |
| 11 |
Incorrect |
115 ms |
15944 KB |
Output isn't correct |
| 12 |
Incorrect |
123 ms |
16524 KB |
Output isn't correct |
| 13 |
Incorrect |
161 ms |
16116 KB |
Output isn't correct |
| 14 |
Incorrect |
173 ms |
16712 KB |
Output isn't correct |
| 15 |
Incorrect |
208 ms |
20320 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
835 ms |
36692 KB |
Output isn't correct |
| 2 |
Incorrect |
1000 ms |
29844 KB |
Output isn't correct |
| 3 |
Incorrect |
1322 ms |
31136 KB |
Output isn't correct |
| 4 |
Incorrect |
266 ms |
16820 KB |
Output isn't correct |
| 5 |
Incorrect |
298 ms |
19008 KB |
Output isn't correct |
| 6 |
Incorrect |
757 ms |
71180 KB |
Output isn't correct |
| 7 |
Incorrect |
1012 ms |
43156 KB |
Output isn't correct |
| 8 |
Incorrect |
942 ms |
114248 KB |
Output isn't correct |
| 9 |
Incorrect |
1471 ms |
24476 KB |
Output isn't correct |
| 10 |
Incorrect |
2061 ms |
120084 KB |
Output isn't correct |
| 11 |
Incorrect |
2045 ms |
23868 KB |
Output isn't correct |
| 12 |
Incorrect |
1000 ms |
27124 KB |
Output isn't correct |
| 13 |
Incorrect |
1198 ms |
27736 KB |
Output isn't correct |
| 14 |
Incorrect |
1758 ms |
44816 KB |
Output isn't correct |
| 15 |
Incorrect |
1990 ms |
33416 KB |
Output isn't correct |
| 16 |
Incorrect |
1955 ms |
42724 KB |
Output isn't correct |
| 17 |
Incorrect |
2075 ms |
59056 KB |
Output isn't correct |
