#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
typedef pair<ll,ll> pll;
#define ALL(x) x.begin(),x.end()
#define SIZE(x) (int)x.size()
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define forn(i,n) for(int i=0;i<int(n);i++)
#define fst first
#define snd second
#define pb push_back
const int MAXN = 2e5;
const int MOD = 1e9+2022;
vi s, adj[MAXN], p;
int n, m;
int dp[MAXN][2];
int mul(int x, int y) {
return int(1LL*x*y%MOD);
}
void add(int &x, int y) {
x+=y;
if(x>=MOD) x-=MOD;
}
void compute_dp(int u) {
int l=2*u+1, r=2*u+2;
int aux = mul(dp[l][0], dp[r][1]);
add(aux, mul(dp[l][1], dp[r][0]));
dp[u][1] = dp[u][0] = aux;
aux = mul(mul(2, dp[l][0]), dp[r][0]);
add(dp[u][0], aux);
aux = mul(mul(2, dp[l][1]), dp[r][1]);
add(dp[u][1], aux);
}
void dfs(int u) {
if(SIZE(adj[u])==0) {
dp[u][s[u-n]] = 1;
dp[u][!s[u-n]] = 0;
return;
}
dfs(2*u+1), dfs(2*u+2);
compute_dp(u);
}
void init(int N, int M, vi P, vi A) {
s=A, n=N, m=M, p=P;
//forsn(i,1,n+m) adj[P[i]].pb(i);
dfs(0);
}
bool lazy[MAXN];
void pass(int u) {
if(2*u+2<MAXN) {
lazy[2*u+1] ^= lazy[u];
lazy[2*u+2] ^= lazy[u];
}
if(lazy[u]) swap(dp[u][0], dp[u][1]);
lazy[u] = false;
}
void update(int ql, int qr, int nl, int nr, int u) {
pass(u);
if(qr <= nl || nr <= ql) {
return;
}
if(ql <= nl && nr <= qr) {
lazy[u] ^= 1;
pass(u);
return;
}
int nm=(nl+nr)/2;
update(ql,qr,nl,nm,2*u+1);
update(ql,qr,nm,nr,2*u+2);
compute_dp(u);
}
/*void update(int u) {
dp[u][0]^=1, dp[u][1]^=1;
u=p[u];
while(u!=-1) {
compute_dp(u);
u=p[u];
}
}*/
int count_ways(int L, int R) {
update(L-n, R-n+1, 0, m, 0);
return dp[0][1];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
6488 KB |
1st lines differ - on the 1st token, expected: '1', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
6488 KB |
1st lines differ - on the 1st token, expected: '1', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
6488 KB |
1st lines differ - on the 1st token, expected: '1', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
382 ms |
7888 KB |
1st lines differ - on the 1st token, expected: '431985922', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
382 ms |
7888 KB |
1st lines differ - on the 1st token, expected: '431985922', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
6488 KB |
1st lines differ - on the 1st token, expected: '1', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
6488 KB |
1st lines differ - on the 1st token, expected: '1', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
6488 KB |
1st lines differ - on the 1st token, expected: '1', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |