제출 #1187563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1187563		ByeWorld	디지털 회로 (IOI22_circuit)	C++20	0 / 100	1127 ms	1572 KiB

circuit

#include "circuit.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
const int MAXN = 3e5+10;
const ll MOD = 1e9+2022;
ll sum(ll a, ll b){ return (a+b)%MOD;}
void chsum(ll &a, ll b){ a = (a+b)%MOD;}
ll mul(ll a, ll b){ return (a*b)%MOD; }
void chmul(ll &a, ll b){ a = (a*b)%MOD;}
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }

int n, m, par[MAXN], a[MAXN];
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
	n = N; m = M;
	for(int i=1; i<=n+m; i++){
		par[i] = P[i-1]+1;
	}
	for(int i=1; i<=m; i++){
		a[i] = A[i-1];
	}
}

int count_ways(int L, int R) {
	int l = L+1, r = R+1;
	for(int i=l; i<=r; i++) a[i] = 1-a[i];
	int tot = 0;
	for(int i=1; i<=m; i++) tot += a[i];
	return tot;
}

• 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