#include "circuit.h"
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
const ll MOD=1e9+2022;
const int N=2e5+5;
struct tree
{
ll one, zero, lazy;
}t[4*N];
int nw[N], cnt, old[N], n, m;
ll suff[N], prv=1, a[N];
vector<int>g[N];
void dfs(int v)
{
if(!g[v].size()) return;
nw[v]=++cnt;
old[cnt]=v;
for(int u : g[v])
dfs(u);
}
void calc(int v, int p)
{
if(!g[v].size())
{
a[v-n]=prv*suff[nw[p+1]];
a[v-n]%=MOD;
return;
}
for(int u : g[v])
calc(u, v);
prv*=g[v].size();
prv%=MOD;
}
void build(int v, int l, int r, vector<int>&state)
{
if(l==r)
{
if(state[l]) t[v]={a[l], 0, 0};
else t[v]={0, a[l], 0};
return;
}
int mid=(l+r)>>1;
build(v<<1, l, mid, state);
build(v<<1|1, mid+1, r, state);
t[v]={(t[v<<1].one+t[v<<1|1].one)%MOD, (t[v<<1].zero+t[v<<1|1].zero)%MOD, 0};
}
void push(int v, int l, int r)
{
swap(t[v].zero, t[v].one);
t[v].lazy=0;
t[v<<1].lazy^=1;
t[v<<1|1].lazy^=1;
}
void update(int v, int l, int r, int tl, int tr)
{
if(t[v].lazy) push(v, l, r);
if(r<tl or tr<l) return;
if(tl<=l and r<=tr)
{
t[v].lazy=1;
push(v, l, r);
return;
}
int mid=(l+r)>>1;
update(v<<1, l, mid, tl, tr);
update(v<<1|1, mid+1, r, tl, tr);
t[v]={(t[v<<1].one+t[v<<1|1].one)%MOD, (t[v<<1].zero+t[v<<1|1].zero)%MOD, 0};
}
void init(int N, int M, vector<int> p, vector<int> state)
{
n=N; m=M;
for(int i=1; i<n+m; i++)
g[p[i]].push_back(i);
dfs(0);
suff[n]=1;
for(int i=n-1; i>=0; i--)
{
suff[i]=suff[i+1]*g[old[i]].size();
suff[i]%=MOD;
}
calc(0, -1);
build(1, 0, m-1, state);
}
int count_ways(int l, int r)
{
update(1, 0, m-1, l-n, r-n);
return t[1].one;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
4944 KB |
1st lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
4944 KB |
1st lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
4944 KB |
1st lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
541 ms |
10292 KB |
1st lines differ - on the 1st token, expected: '431985922', found: '39753160' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
541 ms |
10292 KB |
1st lines differ - on the 1st token, expected: '431985922', found: '39753160' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
4944 KB |
1st lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
4944 KB |
1st lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
4944 KB |
1st lines differ - on the 1st token, expected: '1', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |