제출 #680908

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
680908		AngusWong	디지털 회로 (IOI22_circuit)	C++17	7 / 100	3097 ms	8136 KiB

circuit

#include "circuit.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
using namespace std;

const ll mod=1000002022LL;
const ll N=2e5+9;
ll n, m, p[N], a[N];
pll dp[N];
vector<ll> v[N];

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

void dfs(ll x){
	if (x>=n){
		if (a[x]) dp[x]={1, 0};
		else dp[x]={0, 1};
		return;
	}
	for (ll i: v[x]) dfs(i);
	dp[x].f=(dp[v[x][0]].f*dp[v[x][1]].s%mod+dp[v[x][0]].s*dp[v[x][1]].f%mod+dp[v[x][0]].f*dp[v[x][1]].f*2%mod)%mod;
	dp[x].s=(dp[v[x][0]].f*dp[v[x][1]].s%mod+dp[v[x][0]].s*dp[v[x][1]].f%mod+dp[v[x][0]].s*dp[v[x][1]].s*2%mod)%mod;
}

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

• Subtask 1: 0 / 2
• Subtask 2: 7 / 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