Submission #869715

#	Time	Username	Problem	Language	Result	Execution time	Memory
869715		Nonoze	Digital Circuit (IOI22_circuit)	C++17	0 / 100	3086 ms	4724 KiB

circuit

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

#include <bits/stdc++.h>
using namespace std;

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

bool dfs(int s) {
	if (s>n) return a[s-n];
	int comp=0;
	for (auto u: adj[s]) {
		comp+=dfs(u);
	}
	return comp>=2;
}

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);
}

• 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