#include <bits/stdc++.h>
#define mp make_pair
#define all(a) a.begin(),a.end()
using namespace std;
using pii = pair <long long, long long>;
constexpr int maxn = 2e5 + 10;
constexpr int mod = 1000002022;
constexpr long long inf = 1e17 + 10;
vector <int> graph [maxn];
long long sub_size [maxn], ans [maxn];
long long x [maxn], tree [maxn << 2], S [maxn << 2];
bool R [maxn << 2];
int n, m;
inline void build (int v, int t_l, int t_r) {
if (t_l == t_r) {
S[v] = ans[t_l];
return;
}
int t_m = t_l + t_r >> 1;
build (v << 1, t_l, t_m);
build (v << 1 | 1, t_m + 1, t_r);
S[v] = (S[v << 1] + S[v << 1 | 1]) % mod;
}
inline void push (int v, int t_l, int t_r) {
if (!R[v]) return;
tree[v] = (S[v] - tree[v] + mod) % mod;
if (t_l < t_r) {
R[v << 1] ^= 1;
R[v << 1 | 1] ^= 1;
}
R[v] = false;
}
inline void update (int l, int r, int v, int t_l, int t_r) {
push (v, t_l, t_r);
if (l > t_r || t_l > r) return;
if (l <= t_l && t_r <= r) {
R[v] = true;
push (v, t_l, t_r);
return;
}
int t_m = t_l + t_r >> 1;
update (l, r, v << 1, t_l, t_m);
update (l, r, v << 1 | 1, t_m + 1, t_r);
tree[v] = (tree[v << 1] + tree[v << 1 | 1]) % mod;
}
inline void dfs0 (int v) {
sub_size[v] = max (1LL, (long long) graph[v].size ());
for (int i : graph[v]) {
dfs0 (i);
sub_size[v] = (sub_size[v] * sub_size[i]) % mod;
}
}
long long w0 [maxn], w1 [maxn];
inline void dfs1 (int v, long long cur) {
if (graph[v].empty ()) return;
x[v] = cur;
for (int i : graph[v]) x[v] = (x[v] * sub_size[i]) % mod;
w0[0] = 1;
for (int i = 1; i < (int) graph[v].size (); ++i)
w0[i] = (w0[i - 1] * sub_size[graph[v][i - 1]]) % mod;
w1[(int) w1.size () - 1] = 1;
for (int i = (int) graph[v].size () - 2; i >= 0; --i)
w1[i] = (w1[i + 1] * sub_size[graph[v][i + 1]]) % mod;
int d = 0;
for (int i : graph[v]) {
long long cur0 = cur;
cur0 = (cur0 * w0[d]) % mod;
cur0 = (cur0 * w1[d]) % mod;
++d;
dfs1 (i, cur0);
}
}
void init (int N, int M, vector <int> P, vector <int> A) {
n = N, m = M;
for (int i = 1; i < n + m; ++i) graph[P[i]].push_back (i);
dfs0 (0);
dfs1 (0, 1);
for (int i = n; i < n + m; ++i) ans[i] = x[P[i]];
build (1, n, n + m - 1);
for (int i = 0; i < m; ++i) if (A[i]) update (i + n, i + n, 1, n, n + m - 1);
}
int count_ways (int L, int R) {
update (L, R, 1, n, n + m - 1);
return tree[1];
}
Compilation message
circuit.cpp: In function 'void build(int, int, int)':
circuit.cpp:21:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
21 | int t_m = t_l + t_r >> 1;
| ~~~~^~~~~
circuit.cpp: In function 'void update(int, int, int, int, int)':
circuit.cpp:45:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
45 | int t_m = t_l + t_r >> 1;
| ~~~~^~~~~
circuit.cpp: In function 'void dfs1(int, long long int)':
circuit.cpp:68:17: error: request for member 'size' in 'w1', which is of non-class type 'long long int [200010]'
68 | w1[(int) w1.size () - 1] = 1;
| ^~~~
