oj.uz

답안 #800710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800710 2023-08-01T18:44:00 Z dxz05 디지털 회로 (IOI22_circuit) C++17
100 / 100
 947 ms 31176 KB 
#include "circuit.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int MaxN = 200005;
const int MOD = 1e9 + 2022;

int binpow(int n, int k){
	int res = 1;
    while (k > 0){
        if (k & 1) res = 1LL * res * n % MOD;
        n = 1LL * n * n % MOD;
        k >>= 1;
    }
    return res;
}

int N, M;
vector<int> A;
 
int contribution[MaxN];
 
struct node{
	int sum;
	int sum2;
	bool flag;
	
	node(){
		sum = sum2 = 0;
		flag = false;
	};
};
 
node tree[2 * MaxN];
 
void flip(int v){
	swap(tree[v].sum, tree[v].sum2);
	tree[v].flag ^= 1;
}
 
void push(int v, int tl, int tr){
	if (tl == tr || !tree[v].flag) return;
	flip(v << 1);
	flip(v << 1 | 1);
	tree[v].flag = false;
}
 
void build(int v, int tl, int tr){
	if (tl == tr){
		tree[v].sum = A[tl - N] * contribution[tl];
		tree[v].sum2 = (!A[tl - N]) * contribution[tl];
		return;
	}
	int tm = (tl + tr) >> 1;
	build(v << 1, tl, tm);
	build(v << 1 | 1, tm + 1, tr);
	
	tree[v].sum = (tree[v << 1].sum + tree[v << 1 | 1].sum) % MOD;
	tree[v].sum2 = (tree[v << 1].sum2 + tree[v << 1 | 1].sum2) % MOD;
}
 
void update(int v, int tl, int tr, int l, int r){
	push(v, tl, tr);
	if (l <= tl && tr <= r){
		flip(v);
		return;
	}
	if (tl > r || tr < l) return;
	int tm = (tl + tr) >> 1;
	update(v << 1, tl, tm, l, r);
	update(v << 1 | 1, tm + 1, tr, l, r);
	
	tree[v].sum = (tree[v << 1].sum + tree[v << 1 | 1].sum) % MOD;
	tree[v].sum2 = (tree[v << 1].sum2 + tree[v << 1 | 1].sum2) % MOD;
}
 
void update(int l, int r){
	update(1, N, N + M - 1, l, r);
}
 
int get(){
	return tree[1].sum;
}
 
vector<int> g[MaxN];
 
long long sub[MaxN];

void dfs0(int v){
	sub[v] = 1;
	if (!g[v].empty()){
		sub[v] = sub[v] * (int) g[v].size() % MOD;
	}
	
	for (int u : g[v]){
		dfs0(u);
		sub[v] = sub[v] * sub[u] % MOD;		
	}
}

void dfs1(int v, long long up){
	int sz = (int) g[v].size();
	
	if (sz == 0){
		contribution[v] = up % MOD;
		return;
	}
	
	vector<long long> suff(sz, 1);
	for (int i = sz - 1; i >= 0; i--){
		int u = g[v][i];
		
		suff[i] = sub[u];
		if (i + 1 < sz) {
			suff[i] = suff[i] * suff[i + 1] % MOD;
		}
	}
	
	long long pref = 1;
	for (int i = 0; i < sz; i++){
		int u = g[v][i];
		
		long long ways = up * pref % MOD;
		if (i + 1 < sz) ways = ways * suff[i + 1] % MOD;
		
		dfs1(u, ways);
		
		pref = pref * sub[u] % MOD;		
	}
}

void init(int _N, int _M, vector<int> P, vector<int> _A) {
    N = _N, M = _M, A = _A;
    for (int i = 1; i < N + M; i++){
        g[P[i]].push_back(i);
    }
	
    dfs0(0);
    dfs1(0, 1);
        
    build(1, N, N + M - 1);
}
 
int count_ways(int L, int R) {
    update(L, R);
    return get();
}

Subtask #1
2.0 / 2.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9680 KB Output is correct
2 Correct 5 ms 9680 KB Output is correct
3 Correct 4 ms 9680 KB Output is correct
4 Correct 4 ms 9680 KB Output is correct
5 Correct 4 ms 9680 KB Output is correct
6 Correct 4 ms 9680 KB Output is correct
7 Correct 4 ms 9680 KB Output is correct
8 Correct 5 ms 9680 KB Output is correct
9 Correct 5 ms 9680 KB Output is correct
10 Correct 4 ms 9808 KB Output is correct
11 Correct 7 ms 9808 KB Output is correct
12 Correct 4 ms 9680 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9680 KB Output is correct
2 Correct 4 ms 9680 KB Output is correct
3 Correct 4 ms 9680 KB Output is correct
4 Correct 5 ms 9680 KB Output is correct
5 Correct 5 ms 9680 KB Output is correct
6 Correct 5 ms 9680 KB Output is correct
7 Correct 4 ms 9680 KB Output is correct
8 Correct 4 ms 9680 KB Output is correct
9 Correct 4 ms 9680 KB Output is correct
10 Correct 5 ms 9680 KB Output is correct
11 Correct 4 ms 9680 KB Output is correct
12 Correct 4 ms 9680 KB Output is correct
13 Correct 4 ms 9680 KB Output is correct
14 Correct 4 ms 9680 KB Output is correct
15 Correct 4 ms 9680 KB Output is correct
16 Correct 5 ms 9680 KB Output is correct
17 Correct 5 ms 9680 KB Output is correct
18 Correct 4 ms 9808 KB Output is correct
19 Correct 7 ms 9808 KB Output is correct
20 Correct 4 ms 9680 KB Output is correct
21 Correct 5 ms 9664 KB Output is correct
22 Correct 4 ms 9680 KB Output is correct
23 Correct 4 ms 9680 KB Output is correct
24 Correct 4 ms 9680 KB Output is correct
25 Correct 5 ms 9680 KB Output is correct
26 Correct 4 ms 9680 KB Output is correct
27 Correct 4 ms 9680 KB Output is correct
28 Correct 4 ms 9680 KB Output is correct
29 Correct 4 ms 9680 KB Output is correct
30 Correct 4 ms 9680 KB Output is correct
31 Correct 4 ms 9748 KB Output is correct
32 Correct 4 ms 9680 KB Output is correct
33 Correct 4 ms 9680 KB Output is correct
34 Correct 4 ms 9680 KB Output is correct
35 Correct 4 ms 9680 KB Output is correct
36 Correct 4 ms 9808 KB Output is correct
37 Correct 5 ms 9808 KB Output is correct
38 Correct 4 ms 9872 KB Output is correct
39 Correct 5 ms 9680 KB Output is correct
40 Correct 4 ms 9680 KB Output is correct
41 Correct 5 ms 9680 KB Output is correct
42 Correct 4 ms 9680 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 12276 KB Output is correct
2 Correct 509 ms 14800 KB Output is correct
3 Correct 661 ms 14828 KB Output is correct
4 Correct 808 ms 14828 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 12276 KB Output is correct
2 Correct 509 ms 14800 KB Output is correct
3 Correct 661 ms 14828 KB Output is correct
4 Correct 808 ms 14828 KB Output is correct
5 Correct 673 ms 12244 KB Output is correct
6 Correct 872 ms 14796 KB Output is correct
7 Correct 887 ms 14824 KB Output is correct
8 Correct 818 ms 14804 KB Output is correct
9 Correct 427 ms 9808 KB Output is correct
10 Correct 790 ms 9936 KB Output is correct
11 Correct 787 ms 9936 KB Output is correct
12 Correct 707 ms 9936 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9680 KB Output is correct
2 Correct 5 ms 9680 KB Output is correct
3 Correct 4 ms 9680 KB Output is correct
4 Correct 4 ms 9680 KB Output is correct
5 Correct 4 ms 9680 KB Output is correct
6 Correct 4 ms 9680 KB Output is correct
7 Correct 4 ms 9680 KB Output is correct
8 Correct 5 ms 9680 KB Output is correct
9 Correct 5 ms 9680 KB Output is correct
10 Correct 4 ms 9808 KB Output is correct
11 Correct 7 ms 9808 KB Output is correct
12 Correct 4 ms 9680 KB Output is correct
13 Correct 572 ms 12276 KB Output is correct
14 Correct 509 ms 14800 KB Output is correct
15 Correct 661 ms 14828 KB Output is correct
16 Correct 808 ms 14828 KB Output is correct
17 Correct 673 ms 12244 KB Output is correct
18 Correct 872 ms 14796 KB Output is correct
19 Correct 887 ms 14824 KB Output is correct
20 Correct 818 ms 14804 KB Output is correct
21 Correct 427 ms 9808 KB Output is correct
22 Correct 790 ms 9936 KB Output is correct
23 Correct 787 ms 9936 KB Output is correct
24 Correct 707 ms 9936 KB Output is correct
25 Correct 662 ms 17376 KB Output is correct
26 Correct 776 ms 17492 KB Output is correct
27 Correct 877 ms 17468 KB Output is correct
28 Correct 472 ms 17492 KB Output is correct
29 Correct 697 ms 29964 KB Output is correct
30 Correct 638 ms 30036 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9680 KB Output is correct
2 Correct 4 ms 9680 KB Output is correct
3 Correct 4 ms 9680 KB Output is correct
4 Correct 5 ms 9680 KB Output is correct
5 Correct 5 ms 9680 KB Output is correct
6 Correct 5 ms 9680 KB Output is correct
7 Correct 4 ms 9680 KB Output is correct
8 Correct 4 ms 9680 KB Output is correct
9 Correct 4 ms 9680 KB Output is correct
10 Correct 5 ms 9680 KB Output is correct
11 Correct 4 ms 9680 KB Output is correct
12 Correct 4 ms 9680 KB Output is correct
13 Correct 4 ms 9680 KB Output is correct
14 Correct 4 ms 9680 KB Output is correct
15 Correct 4 ms 9680 KB Output is correct
16 Correct 5 ms 9680 KB Output is correct
17 Correct 5 ms 9680 KB Output is correct
18 Correct 4 ms 9808 KB Output is correct
19 Correct 7 ms 9808 KB Output is correct
20 Correct 4 ms 9680 KB Output is correct
21 Correct 5 ms 9664 KB Output is correct
22 Correct 4 ms 9680 KB Output is correct
23 Correct 4 ms 9680 KB Output is correct
24 Correct 4 ms 9680 KB Output is correct
25 Correct 5 ms 9680 KB Output is correct
26 Correct 4 ms 9680 KB Output is correct
27 Correct 4 ms 9680 KB Output is correct
28 Correct 4 ms 9680 KB Output is correct
29 Correct 4 ms 9680 KB Output is correct
30 Correct 4 ms 9680 KB Output is correct
31 Correct 4 ms 9748 KB Output is correct
32 Correct 4 ms 9680 KB Output is correct
33 Correct 4 ms 9680 KB Output is correct
34 Correct 4 ms 9680 KB Output is correct
35 Correct 4 ms 9680 KB Output is correct
36 Correct 4 ms 9808 KB Output is correct
37 Correct 5 ms 9808 KB Output is correct
38 Correct 4 ms 9872 KB Output is correct
39 Correct 5 ms 9680 KB Output is correct
40 Correct 4 ms 9680 KB Output is correct
41 Correct 5 ms 9680 KB Output is correct
42 Correct 4 ms 9680 KB Output is correct
43 Correct 596 ms 9808 KB Output is correct
44 Correct 812 ms 9936 KB Output is correct
45 Correct 868 ms 9936 KB Output is correct
46 Correct 623 ms 10016 KB Output is correct
47 Correct 639 ms 10028 KB Output is correct
48 Correct 767 ms 10064 KB Output is correct
49 Correct 819 ms 10064 KB Output is correct
50 Correct 800 ms 10064 KB Output is correct
51 Correct 799 ms 9936 KB Output is correct
52 Correct 654 ms 9936 KB Output is correct
53 Correct 559 ms 10448 KB Output is correct
54 Correct 731 ms 10064 KB Output is correct
55 Correct 651 ms 9936 KB Output is correct
56 Correct 702 ms 9936 KB Output is correct
57 Correct 677 ms 9808 KB Output is correct
58 Correct 790 ms 10704 KB Output is correct
59 Correct 735 ms 10704 KB Output is correct
60 Correct 825 ms 10704 KB Output is correct
61 Correct 678 ms 10064 KB Output is correct
62 Correct 561 ms 9808 KB Output is correct
63 Correct 699 ms 9808 KB Output is correct
64 Correct 742 ms 9808 KB Output is correct
65 Correct 265 ms 9808 KB Output is correct
66 Correct 691 ms 9936 KB Output is correct
67 Correct 641 ms 9936 KB Output is correct
68 Correct 832 ms 9936 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9680 KB Output is correct
2 Correct 4 ms 9680 KB Output is correct
3 Correct 4 ms 9680 KB Output is correct
4 Correct 5 ms 9680 KB Output is correct
5 Correct 5 ms 9680 KB Output is correct
6 Correct 5 ms 9680 KB Output is correct
7 Correct 4 ms 9680 KB Output is correct
8 Correct 4 ms 9680 KB Output is correct
9 Correct 4 ms 9680 KB Output is correct
10 Correct 5 ms 9680 KB Output is correct
11 Correct 4 ms 9680 KB Output is correct
12 Correct 4 ms 9680 KB Output is correct
13 Correct 4 ms 9680 KB Output is correct
14 Correct 4 ms 9680 KB Output is correct
15 Correct 4 ms 9680 KB Output is correct
16 Correct 5 ms 9680 KB Output is correct
17 Correct 5 ms 9680 KB Output is correct
18 Correct 4 ms 9808 KB Output is correct
19 Correct 7 ms 9808 KB Output is correct
20 Correct 4 ms 9680 KB Output is correct
21 Correct 5 ms 9664 KB Output is correct
22 Correct 4 ms 9680 KB Output is correct
23 Correct 4 ms 9680 KB Output is correct
24 Correct 4 ms 9680 KB Output is correct
25 Correct 5 ms 9680 KB Output is correct
26 Correct 4 ms 9680 KB Output is correct
27 Correct 4 ms 9680 KB Output is correct
28 Correct 4 ms 9680 KB Output is correct
29 Correct 4 ms 9680 KB Output is correct
30 Correct 4 ms 9680 KB Output is correct
31 Correct 4 ms 9748 KB Output is correct
32 Correct 4 ms 9680 KB Output is correct
33 Correct 4 ms 9680 KB Output is correct
34 Correct 4 ms 9680 KB Output is correct
35 Correct 4 ms 9680 KB Output is correct
36 Correct 4 ms 9808 KB Output is correct
37 Correct 5 ms 9808 KB Output is correct
38 Correct 4 ms 9872 KB Output is correct
39 Correct 5 ms 9680 KB Output is correct
40 Correct 4 ms 9680 KB Output is correct
41 Correct 5 ms 9680 KB Output is correct
42 Correct 4 ms 9680 KB Output is correct
43 Correct 572 ms 12276 KB Output is correct
44 Correct 509 ms 14800 KB Output is correct
45 Correct 661 ms 14828 KB Output is correct
46 Correct 808 ms 14828 KB Output is correct
47 Correct 673 ms 12244 KB Output is correct
48 Correct 872 ms 14796 KB Output is correct
49 Correct 887 ms 14824 KB Output is correct
50 Correct 818 ms 14804 KB Output is correct
51 Correct 427 ms 9808 KB Output is correct
52 Correct 790 ms 9936 KB Output is correct
53 Correct 787 ms 9936 KB Output is correct
54 Correct 707 ms 9936 KB Output is correct
55 Correct 662 ms 17376 KB Output is correct
56 Correct 776 ms 17492 KB Output is correct
57 Correct 877 ms 17468 KB Output is correct
58 Correct 472 ms 17492 KB Output is correct
59 Correct 697 ms 29964 KB Output is correct
60 Correct 638 ms 30036 KB Output is correct
61 Correct 596 ms 9808 KB Output is correct
62 Correct 812 ms 9936 KB Output is correct
63 Correct 868 ms 9936 KB Output is correct
64 Correct 623 ms 10016 KB Output is correct
65 Correct 639 ms 10028 KB Output is correct
66 Correct 767 ms 10064 KB Output is correct
67 Correct 819 ms 10064 KB Output is correct
68 Correct 800 ms 10064 KB Output is correct
69 Correct 799 ms 9936 KB Output is correct
70 Correct 654 ms 9936 KB Output is correct
71 Correct 559 ms 10448 KB Output is correct
72 Correct 731 ms 10064 KB Output is correct
73 Correct 651 ms 9936 KB Output is correct
74 Correct 702 ms 9936 KB Output is correct
75 Correct 677 ms 9808 KB Output is correct
76 Correct 790 ms 10704 KB Output is correct
77 Correct 735 ms 10704 KB Output is correct
78 Correct 825 ms 10704 KB Output is correct
79 Correct 678 ms 10064 KB Output is correct
80 Correct 561 ms 9808 KB Output is correct
81 Correct 699 ms 9808 KB Output is correct
82 Correct 742 ms 9808 KB Output is correct
83 Correct 265 ms 9808 KB Output is correct
84 Correct 691 ms 9936 KB Output is correct
85 Correct 641 ms 9936 KB Output is correct
86 Correct 832 ms 9936 KB Output is correct
87 Correct 4 ms 9680 KB Output is correct
88 Correct 377 ms 16732 KB Output is correct
89 Correct 699 ms 14920 KB Output is correct
90 Correct 689 ms 14632 KB Output is correct
91 Correct 737 ms 17616 KB Output is correct
92 Correct 792 ms 17520 KB Output is correct
93 Correct 721 ms 17624 KB Output is correct
94 Correct 719 ms 17608 KB Output is correct
95 Correct 723 ms 17576 KB Output is correct
96 Correct 733 ms 14016 KB Output is correct
97 Correct 812 ms 14064 KB Output is correct
98 Correct 468 ms 26852 KB Output is correct
99 Correct 917 ms 17516 KB Output is correct
100 Correct 844 ms 15160 KB Output is correct
101 Correct 799 ms 14480 KB Output is correct
102 Correct 802 ms 13308 KB Output is correct
103 Correct 735 ms 30040 KB Output is correct
104 Correct 947 ms 31176 KB Output is correct
105 Correct 703 ms 31096 KB Output is correct
106 Correct 727 ms 17360 KB Output is correct
107 Correct 930 ms 13640 KB Output is correct
108 Correct 773 ms 13636 KB Output is correct
109 Correct 787 ms 13384 KB Output is correct