Submission #976278

#	Time	Username	Problem	Language	Result	Execution time	Memory
976278		happypotato	Digital Circuit (IOI22_circuit)	C++17	18 / 100	3069 ms	11216 KiB

circuit

#include "circuit.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
const ll MOD = 1e9 + 2022;
void chadd(ll &x, ll y) { x = (x + y) % MOD; }
void chmul(ll &x, ll y) { x = (x * y) % MOD; }
const int mxN = 2e5 + 10;
vector<int> adj[mxN];
int n, m;
bool state[mxN];
void init(int N, int M, vector<int> P, vector<int> A) {
	n = N; m = M;
	for (int i = 1; i < (int)(P.size()); i++) {
		adj[P[i]].pb(i);
	}
	for (int i = 0; i < (int)(A.size()); i++) {
		state[n + i] = A[i];
	}
}

ll dp[mxN][2];
ll poly[mxN];
void dfs(int u) {
	if (u >= n) {
		dp[u][0] = dp[u][1] = 0;
		dp[u][state[u]] = 1;
		return;
	}
	for (int v : adj[u]) dfs(v);
	int sz = adj[u].size();
	for (int i = 0; i <= sz; i++) poly[i] = (i == 0);
	for (int v : adj[u]) {
		// multiply by (c0 + c1*x)
		for (int i = sz; i >= 1; i--) {
			poly[i] = (poly[i] * dp[v][0] + poly[i - 1] * dp[v][1]) % MOD;
		}
		poly[0] = (poly[0] * dp[v][0]) % MOD;
	}
	dp[u][0] = dp[u][1] = 0;
	for (int i = 0; i <= sz; i++) {
		chadd(dp[u][0], (sz - i) * poly[i]);
		chadd(dp[u][1], i * poly[i]);
	}
};
int count_ways(int L, int R) {
	for (int i = L; i <= R; i++) state[i] ^= 1;
	dfs(0);
	return (int)(dp[0][1]);
}

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 0 / 4
• Subtask 5: 0 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11