Submission #736331

#	Time	Username	Problem	Language	Result	Execution time	Memory
736331		jk410	Digital Circuit (IOI22_circuit)	C++17	18 / 100	12 ms	8400 KiB

circuit

#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000002022;

int n, m;
vector<int> p, a;
vector<int> child[2023];
ll dp[1023], dp2[2023][2023];
ll dpAll[1023];

ll getDPAll(int v) {
	ll& ret = dpAll[v] = (int)child[v].size();
	for (int i : child[v]) {
		if (i < n)
			ret = ret * getDPAll(i) % MOD;
	}
	return ret;
}

void init(int _n, int _m, vector<int> _p, vector<int> _a) {
	n = _n;
	m = _m;
	p = _p;
	a = _a;
	for (int i = 1; i < n + m; i++)
		child[p[i]].push_back(i);
	getDPAll(0);
}

void getDP(int v) {
	int sz = (int)child[v].size();
	for (int i : child[v]) {
		if (i < n)
			getDP(i);
	}
	dp2[0][0] = 1;
	for (int i = 1; i <= sz; i++) {
		int cur = child[v][i - 1];
		for (int j = 0; j <= i; j++) {
			dp2[i][j] = 0;
			if (cur < n)
				dp2[i][j] = dp2[i - 1][j] * ((dpAll[cur] - dp[cur] + MOD) % MOD) % MOD;
			else if (!a[cur - n])
				dp2[i][j] = dp2[i - 1][j];
		}
		for (int j = 1; j <= i; j++) {
			if (cur < n)
				dp2[i][j] = (dp2[i][j] + dp2[i - 1][j - 1] * dp[cur] % MOD) % MOD;
			else if (a[cur - n])
				dp2[i][j] = dp2[i - 1][j - 1];
		}
		dp2[i][i + 1] = 0;
	}
	dp[v] = 0;
	for (int i = 1; i <= sz; i++)
		dp[v] = (dp[v] + dp2[sz][i] * i % MOD) % MOD;
}

int count_ways(int l, int r) {
	for (int i = l - n; i <= r - n; i++)
		a[i] ^= 1;
	getDP(0);
	return dp[0];
}

• 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