Submission #870655

#	Time	Username	Problem	Language	Result	Execution time	Memory
870655		Nonoze	Digital Circuit (IOI22_circuit)	C++17	18 / 100	3089 ms	4720 KiB

circuit

#include "circuit.h"
//#include "stub.cpp"

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


vector<int> a;
vector<int> adj[100005];
int n, m;

pair<long long, long long> dfs(int s) {
	if (s>=n) {
		return {a[s-n], a[s-n]^1};
	}
	vector<long long> dp(adj[s].size()+1, 0);
	dp[0]=1;
	for (auto u: adj[s]) {
		auto act=dfs(u);
		for (int i=dp.size()-1; i>=0; i--) {
			dp[i]=(dp[i]*act.second)%MOD;
			if (i>0) {
				dp[i]+=(dp[i-1]*act.first)%MOD;
			}
			dp[i]%=MOD;
		}
	}
	pair<long long, long long> ans={0, 0};
	for (int i=1; i<(int)dp.size()-1; i++) {
		ans.first+=(dp[i]*i)%MOD;
		ans.second+=(dp[i]*(dp.size()-i-1));
		ans.first%=MOD, ans.second%=MOD;
	}
	ans.first+=dp[dp.size()-1]*(dp.size()-1);
	ans.second+=dp[0]*(dp.size()-1);
	return {ans.first%MOD, ans.second%MOD};
}

void init(int N, int M, vector<int> p, vector<int> aa) {
	a=aa;
	n=N, m=M; 
	for (int i=1; i<n+m; i++) {
		adj[p[i]].push_back(i);
	}
}

int count_ways(int L, int R) {
	for (int i=L; i<=R; i++) {
		a[i-n]^=1;
	}
	return dfs(0).first;
}

• 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