제출 #1170667

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

circuit

#include "circuit.h"
#include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pb push_back
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define f0r(i,n) for(int i = 0;  i< n; i++)
#define mp make_pair
using namespace std;
vector<signed> par;
vector<signed> v;
vector<vi> adj;
int n,m;
const int mod = 1e9 + 2022;
void init(signed N, signed M, std::vector<signed> P, std::vector<signed> A) {
	n = N; m = M; par = P; v = A;
	adj.resize(n + m);
	FOR(i, 1, n+m){
		adj[P[i]].pb(i);
	}
}

signed count_ways(signed l, signed r) {
	l -= n; r -= n;
	FOR(i, l, r+1){
		v[i] = 1 - v[i];
	}
	vector<vi>dp(n + m, vi(2));
	FOR(i, n, n + m){
		if(v[i-n] == 1){
			dp[i][1] = 1;
		}
		else dp[i][0] = 1;
	}
	for(int i = n - 1; i>=0; i--){
		int a = adj[i][0];
		int b = adj[i][1];
		dp[i][1] = dp[a][1] * dp[b][1] % mod * 2 % mod + dp[a][1] * dp[b][0] % mod + dp[b][1] * dp[a][0] % mod;
		dp[i][1] %= mod;
		dp[i][0] = dp[a][1] * dp[b][0] % mod + dp[b][1] * dp[a][0] % mod + dp[a][0] * dp[b][0] % mod * 2 % mod;
		dp[i][0] %= mod;
	}
	return dp[0][1];
}

• 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