# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763740 | raysh07 | Digital Circuit (IOI22_circuit) | C++17 | 0 ms | 0 KiB |
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;
#define int long long
const int N = 2e5 + 69;
const int mod = 1e9 + 2022;
vector <int> adj[N];
int n, m;
int w1[N], sub[N];
int power(int x, int y){
if (y==0) return 1;
int v = power(y/2);
v *= v; v %= mod;
if (y & 1) return v * x % mod;
else return v;
}
void dfs(int u){
if (u >= n) sub[u] = 1;
for (int v : adj[u]){
dfs(v);
sub[u] += sub[v];
}
if (u >= n) return;
for (int v : adj[u]){
w1[u] += w1[v] * power(2, sub[u] - sub[v]);
w1[u] %= mod;
}
}
void init(int32_t N, int32_t M, vector<int32_t> p, vector<int32_t> a) {
n = N;
m = M;
for (int i = 1; i < n + m; i++){
adj[p[i]].push_back(i);
}
for (int i = 0; i < m; i++){
if (a[i] == 1)
w1[i + n] = 1;
}
}
int32_t count_ways(int32_t l, int32_t r) {
for (int i = l + n; i <= r + n; i++){
w1[i] ^= 1;
}
dfs(0);
return (int32_t) w1[0];
}