This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 200005;
const int MOD = 1e9 + 2022;
using ll = long long;
int N, M;
vector<int> g[MaxN];
ll dp[MaxN][2];
vector<int> A;
void dfs(int v){
if (v >= N){
int st = A[v - N];
dp[v][st] = 1;
dp[v][!st] = 0;
return;
}
int c = (int) g[v].size();
for (int u : g[v]){
dfs(u);
}
vector<ll> knapsack(c + 1, 0);
knapsack[0] = 1;
dp[v][0] = 0;
dp[v][1] = 0;
long long tot = c;
for (int u : g[v]){
tot = tot * (dp[u][0] + dp[u][1]) % MOD;
for (int i = c; i >= 0; i--){
long long x = knapsack[i] * dp[u][0];
if (i > 0) x += knapsack[i - 1] * dp[u][1];
knapsack[i] = x % MOD;
}
}
for (int i = 1; i <= c; i++){
dp[v][1] += knapsack[i] * i;
dp[v][1] %= MOD;
}
dp[v][0] = tot - dp[v][1];
}
void init(int _N, int _M, vector<int> P, vector<int> _A) {
N = _N, M = _M, A = _A;
for (int i = 1; i < N + M; i++){
g[P[i]].push_back(i);
}
}
int count_ways(int L, int R) {
for (int i = L; i <= R; i++){
A[i - N] ^= 1;
}
dfs(0);
return dp[0][1];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |