Submission #676013

#	Time	Username	Problem	Language	Result	Execution time	Memory
676013		MilosMilutinovic	Digital Circuit (IOI22_circuit)	C++17	46 / 100	3018 ms	7628 KiB

circuit

#include "circuit.h"

#include <bits/stdc++.h>

using namespace std;

const int MOD = 1000002022;

int ckadd(int a, int b) {
	return a + b >= MOD ? a + b - MOD : a + b;
}
int ckmul(int a, int b) {
	return a * 1LL * b % MOD;
}
int ckpower(int a, int n) {
	int res = 1;
	while (n) {
		if (n & 1)
			res = ckmul(res, a);
		a = ckmul(a, a);
		n >>= 1;
	}
	return res;
}
int ckdiv(int a, int b) {
	return ckmul(a, ckpower(b, MOD - 2));
}

const int N = (int)2e5 + 6;
int n, m;
int a[N];
int par[N];
int deg[N];
int ANS[N];
bool vis[N];
int prod[N];
vector<int> g[N];

void dfsProd(int v) {
	prod[v] = deg[v];
	for (int u : g[v]) {
		if (u < n) {
			dfsProd(u);
			prod[v] = ckmul(prod[v], prod[u]);
		} else prod[u] = 1;
	}
}

void dfsSolve(int v, int x) {
	if (v >= n) {
		ANS[v] = x;
		return;
	}
	vector<int> L;
	vector<int> R;
	L.push_back(1);
	for (int i = 0; i < (int) g[v].size(); i++) {
		L.push_back(ckmul(L.back(), prod[g[v][i]]));
	}
	R.push_back(1);
	for (int i = (int) g[v].size() - 1; i >= 0; i--) {
		R.push_back(ckmul(R.back(), prod[g[v][i]]));
	}
	reverse(R.begin(), R.end());
	for (int i = 0; i < (int) g[v].size(); i++) {
		dfsSolve(g[v][i], ckmul(x, ckmul(L[i], R[i + 1])));
	}
}

void init(int N, int M, std::vector<int> P, std::vector<int> A) {
	n = N; m = M;
	for (int i = n; i < n + m; i++) a[i] = A[i - n];
	for (int i = 0; i < n + m; i++) par[i] = P[i];
	for (int i = 1; i < n + m; i++) {
		g[par[i]].push_back(i);
		deg[par[i]]++;
	}
	dfsProd(0);
//	printf("prod = "); for (int i = 0; i < n; i++) printf("%d ", prod[i]); printf("\n");
	dfsSolve(0, 1);
}

int count_ways(int L, int R) {
	for (int i = L; i <= R; i++) a[i] = 1 - a[i];
	int ans = 0;
	for (int i = n; i < n + m; i++) if (a[i] == 1) {
		ans = ckadd(ans, ANS[i]);
	}
	return ans;
}

/*
3 4 3
-1 0 1 2 1 1 0
1 0 1 0
3 4
4 5
3 6

*/

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