oj.uz

답안 #767511

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767511 2023-06-26T19:49:46 Z t6twotwo 디지털 회로 (IOI22_circuit) C++17
89 / 100
 3000 ms 14064 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> P, A, tot, 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;
    P = p, A = a;
    vector<vector<int>> ch(N);
    for (int i = 1; i < N + M; i++) {
        ch[P[i]].push_back(i);
    }
    tot.resize(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 = 1; i < N + M; i++) {
        f[i] = f[P[i]];
        for (int j : ch[P[i]]) {
            if (i != j) {
                f[i] = mul(f[i], tot[j]);
            }
        }
    }
    K = 2 << __lg(M);
    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 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 336 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 7 ms 336 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 7 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 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 1 ms 336 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 336 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 336 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 7 ms 336 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 7 ms 336 KB Output is correct
9 Correct 1 ms 208 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 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 336 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 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 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 7 ms 328 KB Output is correct
30 Correct 7 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 2 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 7 ms 336 KB Output is correct
38 Correct 7 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 348 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 597 ms 5304 KB Output is correct
2 Correct 786 ms 10300 KB Output is correct
3 Correct 728 ms 10264 KB Output is correct
4 Correct 896 ms 10272 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 597 ms 5304 KB Output is correct
2 Correct 786 ms 10300 KB Output is correct
3 Correct 728 ms 10264 KB Output is correct
4 Correct 896 ms 10272 KB Output is correct
5 Correct 617 ms 5308 KB Output is correct
6 Correct 874 ms 10320 KB Output is correct
7 Correct 755 ms 10320 KB Output is correct
8 Correct 713 ms 10240 KB Output is correct
9 Correct 304 ms 592 KB Output is correct
10 Correct 673 ms 916 KB Output is correct
11 Correct 571 ms 904 KB Output is correct
12 Correct 784 ms 900 KB Output is correct

Subtask #6
27.0 / 27.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 1 ms 336 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 336 KB Output is correct
13 Correct 597 ms 5304 KB Output is correct
14 Correct 786 ms 10300 KB Output is correct
15 Correct 728 ms 10264 KB Output is correct
16 Correct 896 ms 10272 KB Output is correct
17 Correct 617 ms 5308 KB Output is correct
18 Correct 874 ms 10320 KB Output is correct
19 Correct 755 ms 10320 KB Output is correct
20 Correct 713 ms 10240 KB Output is correct
21 Correct 304 ms 592 KB Output is correct
22 Correct 673 ms 916 KB Output is correct
23 Correct 571 ms 904 KB Output is correct
24 Correct 784 ms 900 KB Output is correct
25 Correct 813 ms 13724 KB Output is correct
26 Correct 732 ms 13852 KB Output is correct
27 Correct 795 ms 13892 KB Output is correct
28 Correct 630 ms 13848 KB Output is correct
29 Correct 826 ms 13896 KB Output is correct
30 Correct 852 ms 13900 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 336 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 7 ms 336 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 7 ms 336 KB Output is correct
9 Correct 1 ms 208 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 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 336 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 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 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 7 ms 328 KB Output is correct
30 Correct 7 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 2 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 7 ms 336 KB Output is correct
38 Correct 7 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 508 ms 676 KB Output is correct
44 Correct 710 ms 720 KB Output is correct
45 Correct 708 ms 720 KB Output is correct
46 Correct 644 ms 1004 KB Output is correct
47 Correct 680 ms 1004 KB Output is correct
48 Correct 749 ms 1000 KB Output is correct
49 Correct 771 ms 1000 KB Output is correct
50 Correct 620 ms 1004 KB Output is correct
51 Correct 926 ms 656 KB Output is correct
52 Correct 868 ms 660 KB Output is correct
53 Correct 609 ms 592 KB Output is correct
54 Correct 709 ms 1000 KB Output is correct
55 Correct 738 ms 808 KB Output is correct
56 Correct 717 ms 756 KB Output is correct
57 Correct 685 ms 656 KB Output is correct
58 Correct 767 ms 992 KB Output is correct
59 Correct 874 ms 1052 KB Output is correct
60 Correct 812 ms 1056 KB Output is correct
61 Correct 717 ms 752 KB Output is correct
62 Correct 706 ms 640 KB Output is correct
63 Correct 839 ms 592 KB Output is correct
64 Correct 752 ms 660 KB Output is correct
65 Correct 347 ms 592 KB Output is correct
66 Correct 661 ms 904 KB Output is correct
67 Correct 738 ms 904 KB Output is correct
68 Correct 623 ms 900 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 7 ms 336 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 7 ms 336 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 7 ms 336 KB Output is correct
9 Correct 1 ms 208 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 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 336 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 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 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 7 ms 328 KB Output is correct
30 Correct 7 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 2 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 7 ms 336 KB Output is correct
38 Correct 7 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 597 ms 5304 KB Output is correct
44 Correct 786 ms 10300 KB Output is correct
45 Correct 728 ms 10264 KB Output is correct
46 Correct 896 ms 10272 KB Output is correct
47 Correct 617 ms 5308 KB Output is correct
48 Correct 874 ms 10320 KB Output is correct
49 Correct 755 ms 10320 KB Output is correct
50 Correct 713 ms 10240 KB Output is correct
51 Correct 304 ms 592 KB Output is correct
52 Correct 673 ms 916 KB Output is correct
53 Correct 571 ms 904 KB Output is correct
54 Correct 784 ms 900 KB Output is correct
55 Correct 813 ms 13724 KB Output is correct
56 Correct 732 ms 13852 KB Output is correct
57 Correct 795 ms 13892 KB Output is correct
58 Correct 630 ms 13848 KB Output is correct
59 Correct 826 ms 13896 KB Output is correct
60 Correct 852 ms 13900 KB Output is correct
61 Correct 508 ms 676 KB Output is correct
62 Correct 710 ms 720 KB Output is correct
63 Correct 708 ms 720 KB Output is correct
64 Correct 644 ms 1004 KB Output is correct
65 Correct 680 ms 1004 KB Output is correct
66 Correct 749 ms 1000 KB Output is correct
67 Correct 771 ms 1000 KB Output is correct
68 Correct 620 ms 1004 KB Output is correct
69 Correct 926 ms 656 KB Output is correct
70 Correct 868 ms 660 KB Output is correct
71 Correct 609 ms 592 KB Output is correct
72 Correct 709 ms 1000 KB Output is correct
73 Correct 738 ms 808 KB Output is correct
74 Correct 717 ms 756 KB Output is correct
75 Correct 685 ms 656 KB Output is correct
76 Correct 767 ms 992 KB Output is correct
77 Correct 874 ms 1052 KB Output is correct
78 Correct 812 ms 1056 KB Output is correct
79 Correct 717 ms 752 KB Output is correct
80 Correct 706 ms 640 KB Output is correct
81 Correct 839 ms 592 KB Output is correct
82 Correct 752 ms 660 KB Output is correct
83 Correct 347 ms 592 KB Output is correct
84 Correct 661 ms 904 KB Output is correct
85 Correct 738 ms 904 KB Output is correct
86 Correct 623 ms 900 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 534 ms 12960 KB Output is correct
89 Correct 806 ms 9160 KB Output is correct
90 Correct 913 ms 8648 KB Output is correct
91 Correct 823 ms 14064 KB Output is correct
92 Correct 694 ms 14008 KB Output is correct
93 Correct 883 ms 14060 KB Output is correct
94 Correct 778 ms 14052 KB Output is correct
95 Correct 647 ms 14016 KB Output is correct
96 Execution timed out 3049 ms 3896 KB Time limit exceeded
97 Halted 0 ms 0 KB -