#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"
const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;
const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};
// -------------------------------------------------- Main Code --------------------------------------------------
const int N = 2e5+5;
vi g[N], members[N];
int region[N], tin[N], tout[N], tarr[8*N], timer = 1;
struct segTree {
int n;
vector<unordered_map<int, int>> tree;
segTree (int N) {n = 1; while (n < N) n *= 2; tree = vector<unordered_map<int, int>>(2*n+2);}
void build(int node, int left, int right, int arr[]) {
if (left == right) {if (arr[left] != -1) tree[node][arr[left]]++; return;}
build(node*2, left, (left+right)/2, arr);
build(node*2+1, (left+right)/2+1, right, arr);
for (auto i : tree[node*2]) tree[node][i.f] += i.s;
for (auto i : tree[node*2+1]) tree[node][i.f] += i.s;
}
void build(int arr[]) {build(1, 1, n, arr);}
int query(int node, int left, int right, int l, int r, int val) {
if (left > r || right < l) return 0;
else if (left >= l && right <= r) return tree[node][val];
else return query(node*2, left, (left+right)/2, l, r, val) + query(node*2+1, (left+right)/2+1, right, l, r, val);
}
int query(int left, int right, int val) {return query(1, 1, n, left, right, val);}
};
void dfs(int src, int par) {
tarr[timer] = region[src];
tin[src] = timer++;
for (auto ch : g[src]) if (ch != par) dfs(ch, src);
tout[src] = timer-1;
}
vi largeregions;
vii preProcessing;
void dfs2(int src, int par, int i, int ct = 0) {
for (auto ch : g[src]) {
if (ch == par) continue;
preProcessing[i][region[ch]] += ct;
dfs2(ch, src, i, ct+(largeregions[i]==region[ch]));
}
}
void sol() {
int n, r, q; cin >> n >> r >> q;
int sqn = sqrt(n)+1;
for (int i = 1; i <= n; i++) {
if (i == 1) cin >> region[i];
else {
int x; cin >> x >> region[i];
g[i].pb(x);
g[x].pb(i);
}
members[region[i]].pb(i);
}
// dfs(1, -1);
// segTree tree(n); tree.build(tarr);
// for (int i = 1; i <= r; i++) if (members[i].size() >= sqn) largeregions.pb(i);
// preProcessing = vii(largeregions.size(), vi(r+1, 0));
// for (int i = 0; i < largeregions.size(); i++) dfs2(1, -1, i, (largeregions[i]==region[1]));
// while (q--) {
// int a, b; cin >> a >> b;
// int idx = lower_bound(all(largeregions), a) - largeregions.begin();
// if (idx < largeregions.size() && largeregions[idx] == a) {
// cout << preProcessing[idx][b] << endl;
// continue;
// }
// int ans = 0;
// for (auto ch : members[a]) ans += tree.query(tin[ch], tout[ch], b);
// cout << ans << endl;
// }
}
int main () {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
sol();
}
return 0;
}
Compilation message
regions.cpp: In function 'void sol()':
regions.cpp:79:9: warning: unused variable 'sqn' [-Wunused-variable]
79 | int sqn = sqrt(n)+1;
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
9680 KB |
Unexpected end of file - int32 expected |
| 2 |
Incorrect |
5 ms |
9692 KB |
Unexpected end of file - int32 expected |
| 3 |
Incorrect |
5 ms |
9680 KB |
Unexpected end of file - int32 expected |
| 4 |
Incorrect |
5 ms |
9704 KB |
Unexpected end of file - int32 expected |
| 5 |
Incorrect |
6 ms |
9680 KB |
Unexpected end of file - int32 expected |
| 6 |
Incorrect |
5 ms |
9680 KB |
Unexpected end of file - int32 expected |
| 7 |
Incorrect |
5 ms |
9680 KB |
Unexpected end of file - int32 expected |
| 8 |
Incorrect |
6 ms |
9692 KB |
Unexpected end of file - int32 expected |
| 9 |
Incorrect |
7 ms |
9808 KB |
Unexpected end of file - int32 expected |
| 10 |
Incorrect |
10 ms |
10008 KB |
Unexpected end of file - int32 expected |
| 11 |
Incorrect |
12 ms |
10320 KB |
Unexpected end of file - int32 expected |
| 12 |
Incorrect |
16 ms |
10436 KB |
Unexpected end of file - int32 expected |
| 13 |
Incorrect |
21 ms |
10716 KB |
Unexpected end of file - int32 expected |
| 14 |
Incorrect |
20 ms |
10856 KB |
Unexpected end of file - int32 expected |
| 15 |
Incorrect |
28 ms |
11260 KB |
Unexpected end of file - int32 expected |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
50 ms |
12648 KB |
Unexpected end of file - int32 expected |
| 2 |
Incorrect |
60 ms |
12928 KB |
Unexpected end of file - int32 expected |
| 3 |
Incorrect |
61 ms |
13252 KB |
Unexpected end of file - int32 expected |
| 4 |
Incorrect |
34 ms |
10932 KB |
Unexpected end of file - int32 expected |
| 5 |
Incorrect |
27 ms |
11176 KB |
Unexpected end of file - int32 expected |
| 6 |
Incorrect |
37 ms |
11816 KB |
Unexpected end of file - int32 expected |
| 7 |
Incorrect |
48 ms |
12608 KB |
Unexpected end of file - int32 expected |
| 8 |
Incorrect |
69 ms |
13832 KB |
Unexpected end of file - int32 expected |
| 9 |
Incorrect |
107 ms |
16140 KB |
Unexpected end of file - int32 expected |
| 10 |
Incorrect |
115 ms |
17076 KB |
Unexpected end of file - int32 expected |
| 11 |
Incorrect |
150 ms |
18556 KB |
Unexpected end of file - int32 expected |
| 12 |
Incorrect |
138 ms |
17504 KB |
Unexpected end of file - int32 expected |
| 13 |
Incorrect |
126 ms |
17520 KB |
Unexpected end of file - int32 expected |
| 14 |
Incorrect |
169 ms |
18144 KB |
Unexpected end of file - int32 expected |
| 15 |
Incorrect |
149 ms |
18256 KB |
Unexpected end of file - int32 expected |
| 16 |
Incorrect |
180 ms |
18056 KB |
Unexpected end of file - int32 expected |
| 17 |
Incorrect |
154 ms |
18048 KB |
Unexpected end of file - int32 expected |
