제출 #870081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
870081		Nonoze	디지털 회로 (IOI22_circuit)	C++17	0 / 100	3041 ms	4724 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];
vector<pair<int, int>> memo;
int n, m;
 
pair<long long, long long> dfs(int s) {
	if (s>=n) {
		return {a[s-n], a[s-n]^1};
	}
	if (memo[s].first!=-1) return memo[s];
	long long erase1=1, erase2=1, comp=1;
	for (auto u: adj[s]) {
		auto act=dfs(u);
		comp=(comp*(act.first+act.second))%MOD;
		erase1*=act.first, erase2*=act.second;
		erase1%=MOD, erase2%=MOD;
	}
	comp-=erase1+erase2;
	comp=(comp+10*MOD)%MOD;
	return memo[s]={
		(comp+(erase1)%MOD)%MOD,
		(comp+(erase2)%MOD)%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;
	}
	memo.clear();
	memo.resize(n, {-1, -1});
	return dfs(0).first;
}

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