oj.uz

답안 #808726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
808726 2023-08-05T10:06:54 Z alex_2008 디지털 회로 (IOI22_circuit) C++17
2 / 100
 590 ms 5052 KB 
#include "circuit.h"
#include <cmath>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
typedef long long ll;
int NN, MM;
const ll N = 2e5 + 10, mod = 1000002022;
int p[N], d[N];
int lazy[4 * N];
int a[N], cnt[N];
ll pref[N];
ll c[N];
ll tree2[4 * N];
void build_tree2(int v, int tl, int tr) {
	if (tl == tr) {
		if (a[tl]) {
			tree2[v] = pref[tl];
			if (tl) tree2[v] -= pref[tl - 1];
			tree2[v] = (tree2[v] + mod) % mod;
		}
		else tree2[v] = 0;
	}
	else {
		int tm = (tl + tr) / 2;
		build_tree2(2 * v, tl, tm);
		build_tree2(2 * v + 1, tm + 1, tr);
		tree2[v] = tree2[2 * v] + tree2[2 * v + 1];
		tree2[v] %= mod;
	}
}
void pushh2(int v, int tl, int tr) {
	if (lazy[v]) {
		lazy[v] = 0;
		if (tl != tr) {
			lazy[2 * v] = (lazy[2 * v] + 1) % 2;
			lazy[2 * v + 1] = (lazy[2 * v + 1] + 1) % 2;
			int tm = (tl + tr) / 2;
			ll u = pref[tm];
			if (tl) u -= pref[tl - 1];
			u += mod;
			u %= mod;
			tree2[2 * v] = (u + mod - tree2[2 * v]) % mod;
			u = pref[tr] - pref[tm] + mod;
			u %= mod;
			tree2[2 * v + 1] = (u + mod - tree2[2 * v + 1]) % mod;
		}
	}
}
void update2(int v, int tl, int tr, int l, int r) {
	if (tl > r || tr < l) return;
	if (tl >= l && tr <= r) {
		lazy[v] = (lazy[v] + 1) % 2;
		ll u = pref[tr];
		if (tl) u -= pref[tl - 1];
		u += mod;
		u %= mod;
		tree2[v] = (u - tree2[v] + mod) % mod;
		return;
	}
	pushh2(v, tl, tr);
	int tm = (tl + tr) / 2;
	update2(2 * v, tl, tm, l, r);
	update2(2 * v + 1, tm + 1, tr, l, r);
	tree2[v] = tree2[2 * v] + tree2[2 * v + 1];
	tree2[v] %= mod;
}
ll dp[N];
vector <vector<int>> G;
void dfs(int v, int p) {
	ll u = 1;
	bool ch = false;
	for (auto it : G[v]) {
		if (it == p) continue;
		dfs(it, v);
		u *= dp[it];		
		u %= mod;
		ch = true;
	}
	if (!ch) {
		dp[v] = 1;
		return;
	}
	u *= (ll)G[v].size();
	u %= mod;
	dp[v] = u;
}
void dfss(int v, ll way) {
	if (v >= NN) {
		pref[v - NN] = way;
		return;
	}
	vector <int> children;
	for (auto it : G[v]) {
		children.push_back(it);
	}
	vector <ll> pref((int)children.size()), suff((int)children.size());
	for (int i = 0; i < (int)children.size(); i++) {
		pref[i] = dp[children[i]];
		if (i) pref[i] = (pref[i - 1] * pref[i]) % mod;
	}
	for (int i = (int)children.size() - 1; i >= 0; i--) {
		suff[i] = dp[children[i]];
		if (i != (int)children.size() - 1) {
			suff[i] = (suff[i] * suff[i + 1]) % mod;
		}
	}
	for (int i = 0; i < (int)children.size(); i++) {
		ll u = 1;
		if (i) u *= pref[i - 1];
		u %= mod;
		if (i != (int)children.size() - 1) u *= suff[i + 1];
		u %= mod;
		dfss(children[i], u);
	}
}
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
	NN = N, MM = M;
	G.resize(N + M);
	for (int i = 0; i < N + M; i++) {
		if (i) {
			G[P[i]].push_back(i);
		}
	}
	for (int i = 0; i < M; i++) {
		a[i] = A[i];
	}
	dfs(0, -1);
	dfss(0, 1);
	for (int i = 0; i < M; i++) {
		if (i) pref[i] += pref[i - 1];
		pref[i] %= mod;
	}
	build_tree2(1, 0, MM - 1);
}
int count_ways(int L, int R) {
	update2(1, 0, MM - 1, L - NN, R - NN);
	return tree2[1];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
11 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 590 ms 5052 KB 1st lines differ - on the 1st token, expected: '431985922', found: '16402'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 590 ms 5052 KB 1st lines differ - on the 1st token, expected: '431985922', found: '16402'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '52130940', found: '128'
11 Halted 0 ms 0 KB -