oj.uz

답안 #767525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767525 2023-06-26T20:02:04 Z t6twotwo 디지털 회로 (IOI22_circuit) C++17
100 / 100
 850 ms 13380 KB 
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int mod = 1000002022;
int add(int x, int y) {
    int z = x + y;
    if (z >= mod) {
        z -= mod;
    }
    return z;
}
int sub(int x, int y) {
    int z = x - y;
    if (z < 0) {
        z += mod;
    }
    return z;
}
int mul(int x, int y) {
    return (ll)x * y % mod;
}
int N, M, K;
vector<int> lazy, S, T;
void apply(int p, int v) {
    if (v) {
        S[p] = sub(T[p], S[p]);
        lazy[p] ^= 1;
    }
}
void push(int p) {
    apply(p * 2 + 1, lazy[p]);
    apply(p * 2 + 2, lazy[p]);
    lazy[p] = 0;
}
void pull(int p) {
    S[p] = add(S[p * 2 + 1], S[p * 2 + 2]);
}
void update(int p, int l, int r, int L, int R) {
    if (R <= l || r <= L) {
        return;
    }
    if (L <= l && r <= R) {
        apply(p, 1);
        return;
    }
    int m = (l + r + 1) / 2;
    push(p);
    update(p * 2 + 1, l, m, L, R);
    update(p * 2 + 2, m, r, L, R);
    pull(p);
}
void init(int n, int m, vector<int> P, vector<int> A) {
    N = n, M = m;
    vector<vector<int>> ch(N);
    for (int i = 1; i < N + M; i++) {
        ch[P[i]].push_back(i);
    }
    vector<int> tot(N + M);
    for (int i = N; i < N + M; i++) {
        tot[i] = 1;
    }
    for (int i = N - 1; i >= 0; i--) {
        tot[i] = ch[i].size();
        for (int j : ch[i]) {
            tot[i] = mul(tot[i], tot[j]);
        }
    }
    vector<int> f(N + M);
    f[0] = 1;
    for (int i = 0; i < N; i++) {
        int q = ch[i].size(), s = f[i];
        for (int j = 0; j < q; j++) {
            f[ch[i][j]] = s;
            s = mul(s, tot[ch[i][j]]);
        }
        s = 1;
        for (int j = q - 1; j >= 0; j--) {
            f[ch[i][j]] = mul(f[ch[i][j]], s);
            s = mul(s, tot[ch[i][j]]);
        }
    }
    K = 2 << __lg(M - 1);
    S.resize(2 * K - 1);
    T.resize(2 * K - 1);
    lazy.resize(2 * K - 1);
    for (int i = 0; i < M; i++) {
        if (A[i] == 1) {
            S[i + K - 1] = f[i + N];
        }
        T[i + K - 1] = f[i + N];
    }
    for (int i = K - 2; i >= 0; i--) {
        S[i] = add(S[i * 2 + 1], S[i * 2 + 2]);
        T[i] = add(T[i * 2 + 1], T[i * 2 + 2]);
    }
}
int count_ways(int L, int R) {
    update(0, 0, K, L - N, R - N + 1);
    return S[0];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 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
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 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 1 ms 384 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 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 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 392 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 4152 KB Output is correct
2 Correct 700 ms 8016 KB Output is correct
3 Correct 745 ms 7988 KB Output is correct
4 Correct 809 ms 7964 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 4152 KB Output is correct
2 Correct 700 ms 8016 KB Output is correct
3 Correct 745 ms 7988 KB Output is correct
4 Correct 809 ms 7964 KB Output is correct
5 Correct 602 ms 4176 KB Output is correct
6 Correct 800 ms 7960 KB Output is correct
7 Correct 844 ms 7976 KB Output is correct
8 Correct 827 ms 7976 KB Output is correct
9 Correct 394 ms 516 KB Output is correct
10 Correct 778 ms 756 KB Output is correct
11 Correct 715 ms 756 KB Output is correct
12 Correct 703 ms 760 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 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 1 ms 384 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 471 ms 4152 KB Output is correct
14 Correct 700 ms 8016 KB Output is correct
15 Correct 745 ms 7988 KB Output is correct
16 Correct 809 ms 7964 KB Output is correct
17 Correct 602 ms 4176 KB Output is correct
18 Correct 800 ms 7960 KB Output is correct
19 Correct 844 ms 7976 KB Output is correct
20 Correct 827 ms 7976 KB Output is correct
21 Correct 394 ms 516 KB Output is correct
22 Correct 778 ms 756 KB Output is correct
23 Correct 715 ms 756 KB Output is correct
24 Correct 703 ms 760 KB Output is correct
25 Correct 798 ms 12568 KB Output is correct
26 Correct 766 ms 12740 KB Output is correct
27 Correct 768 ms 12732 KB Output is correct
28 Correct 677 ms 12704 KB Output is correct
29 Correct 667 ms 12724 KB Output is correct
30 Correct 675 ms 12732 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 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 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 392 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 486 ms 648 KB Output is correct
44 Correct 625 ms 720 KB Output is correct
45 Correct 668 ms 680 KB Output is correct
46 Correct 680 ms 944 KB Output is correct
47 Correct 772 ms 944 KB Output is correct
48 Correct 815 ms 944 KB Output is correct
49 Correct 793 ms 952 KB Output is correct
50 Correct 809 ms 896 KB Output is correct
51 Correct 634 ms 616 KB Output is correct
52 Correct 750 ms 616 KB Output is correct
53 Correct 753 ms 592 KB Output is correct
54 Correct 661 ms 944 KB Output is correct
55 Correct 627 ms 760 KB Output is correct
56 Correct 735 ms 720 KB Output is correct
57 Correct 777 ms 608 KB Output is correct
58 Correct 847 ms 952 KB Output is correct
59 Correct 746 ms 992 KB Output is correct
60 Correct 755 ms 1012 KB Output is correct
61 Correct 744 ms 732 KB Output is correct
62 Correct 584 ms 604 KB Output is correct
63 Correct 636 ms 588 KB Output is correct
64 Correct 698 ms 624 KB Output is correct
65 Correct 416 ms 516 KB Output is correct
66 Correct 599 ms 760 KB Output is correct
67 Correct 850 ms 756 KB Output is correct
68 Correct 779 ms 756 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 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 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 392 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 471 ms 4152 KB Output is correct
44 Correct 700 ms 8016 KB Output is correct
45 Correct 745 ms 7988 KB Output is correct
46 Correct 809 ms 7964 KB Output is correct
47 Correct 602 ms 4176 KB Output is correct
48 Correct 800 ms 7960 KB Output is correct
49 Correct 844 ms 7976 KB Output is correct
50 Correct 827 ms 7976 KB Output is correct
51 Correct 394 ms 516 KB Output is correct
52 Correct 778 ms 756 KB Output is correct
53 Correct 715 ms 756 KB Output is correct
54 Correct 703 ms 760 KB Output is correct
55 Correct 798 ms 12568 KB Output is correct
56 Correct 766 ms 12740 KB Output is correct
57 Correct 768 ms 12732 KB Output is correct
58 Correct 677 ms 12704 KB Output is correct
59 Correct 667 ms 12724 KB Output is correct
60 Correct 675 ms 12732 KB Output is correct
61 Correct 486 ms 648 KB Output is correct
62 Correct 625 ms 720 KB Output is correct
63 Correct 668 ms 680 KB Output is correct
64 Correct 680 ms 944 KB Output is correct
65 Correct 772 ms 944 KB Output is correct
66 Correct 815 ms 944 KB Output is correct
67 Correct 793 ms 952 KB Output is correct
68 Correct 809 ms 896 KB Output is correct
69 Correct 634 ms 616 KB Output is correct
70 Correct 750 ms 616 KB Output is correct
71 Correct 753 ms 592 KB Output is correct
72 Correct 661 ms 944 KB Output is correct
73 Correct 627 ms 760 KB Output is correct
74 Correct 735 ms 720 KB Output is correct
75 Correct 777 ms 608 KB Output is correct
76 Correct 847 ms 952 KB Output is correct
77 Correct 746 ms 992 KB Output is correct
78 Correct 755 ms 1012 KB Output is correct
79 Correct 744 ms 732 KB Output is correct
80 Correct 584 ms 604 KB Output is correct
81 Correct 636 ms 588 KB Output is correct
82 Correct 698 ms 624 KB Output is correct
83 Correct 416 ms 516 KB Output is correct
84 Correct 599 ms 760 KB Output is correct
85 Correct 850 ms 756 KB Output is correct
86 Correct 779 ms 756 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 387 ms 11952 KB Output is correct
89 Correct 740 ms 8476 KB Output is correct
90 Correct 801 ms 7924 KB Output is correct
91 Correct 718 ms 12872 KB Output is correct
92 Correct 693 ms 12828 KB Output is correct
93 Correct 749 ms 12796 KB Output is correct
94 Correct 759 ms 12848 KB Output is correct
95 Correct 715 ms 12872 KB Output is correct
96 Correct 609 ms 6160 KB Output is correct
97 Correct 648 ms 6208 KB Output is correct
98 Correct 593 ms 7328 KB Output is correct
99 Correct 838 ms 12744 KB Output is correct
100 Correct 764 ms 9160 KB Output is correct
101 Correct 797 ms 7964 KB Output is correct
102 Correct 791 ms 6224 KB Output is correct
103 Correct 725 ms 12744 KB Output is correct
104 Correct 829 ms 13380 KB Output is correct
105 Correct 722 ms 13212 KB Output is correct
106 Correct 684 ms 8272 KB Output is correct
107 Correct 848 ms 7764 KB Output is correct
108 Correct 815 ms 7452 KB Output is correct
109 Correct 829 ms 6312 KB Output is correct