oj.uz

답안 #767441

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767441 2023-06-26T19:00:34 Z t6twotwo 디지털 회로 (IOI22_circuit) C++17
34 / 100
 891 ms 5068 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;
vector<int> P, A, tot, lazy, S, len;
void apply(int p, int v) {
    if (v) {
        S[p] = len[p] - S[p];
    }
    lazy[p] ^= v;
}
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] = 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);
}
int T;
void init(int n, int m, vector<int> p, vector<int> a) {
    N = n, M = m;
    P = p, A = a;
    if (M == N + 1 && (1 << __lg(M)) == M) {
        S.resize(N + M);
        tot.resize(N + M);
        len.resize(N + M);
        lazy.resize(N + M);
        for (int i = N; i < N + M; i++) {
            S[i] = A[i - N];
            len[i] = 1;
            tot[i] = 1;
        }
        for (int i = N - 1; i >= 0; i--) {
            len[i] = len[i * 2 + 1] + len[i * 2 + 2];
            S[i] = S[i * 2 + 1] + S[i * 2 + 2];
            tot[i] = mul(2, mul(tot[i * 2 + 1], tot[i * 2 + 2]));
        }
        T = 1;
        int x = N;
        while (x > 0) {
            T = mul(T, tot[x]);
            x = (x - 1) / 2;
        }
    }
}
int count_ways(int L, int R) {
    if (N <= 1000 && M <= 1000) {
        vector dp(N, vector{1});
        vector<int> on(N + M), off(N + M), tot(N + M, 1);
        for (int i = L; i <= R; i++) {
            A[i - N] ^= 1;
        }
        for (int i = N + M - 1; i >= 0; i--) {
            if (i >= N) {
                on[i] = A[i - N];
                off[i] = tot[i] - on[i];
            } else {
                int sum = 0;
                for (int j = dp[i].size() - 1; j; j--) {
                    sum = add(sum, dp[i][j]);
                    on[i] = add(on[i], sum);
                }
                tot[i] = mul(tot[i], (int)dp[i].size() - 1);
                off[i] = sub(tot[i], on[i]);
            }
            if (i) {
                int K = dp[P[i]].size();
                dp[P[i]].resize(K + 1);
                for (int j = K; j; j--) {
                    dp[P[i]][j] = add(mul(dp[P[i]][j], off[i]), mul(dp[P[i]][j - 1], on[i]));
                }
                dp[P[i]][0] = mul(dp[P[i]][0], off[i]);
                tot[P[i]] = mul(tot[P[i]], tot[i]);
            }
        }
        return on[0];
    }
    update(0, 0, M, L - N, R - N + 1);
    return mul(S[0], T);
}

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 10 ms 208 KB Output is correct
4 Correct 13 ms 208 KB Output is correct
5 Correct 10 ms 208 KB Output is correct
6 Correct 10 ms 336 KB Output is correct
7 Correct 13 ms 208 KB Output is correct
8 Correct 11 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 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 2 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 384 KB Output is correct
12 Correct 1 ms 336 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 10 ms 208 KB Output is correct
4 Correct 13 ms 208 KB Output is correct
5 Correct 10 ms 208 KB Output is correct
6 Correct 10 ms 336 KB Output is correct
7 Correct 13 ms 208 KB Output is correct
8 Correct 11 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 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 2 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 384 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 384 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 10 ms 208 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 3 ms 208 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 11 ms 336 KB Output is correct
38 Correct 13 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 445 ms 2512 KB Output is correct
2 Correct 678 ms 4688 KB Output is correct
3 Correct 785 ms 4656 KB Output is correct
4 Correct 786 ms 4660 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 445 ms 2512 KB Output is correct
2 Correct 678 ms 4688 KB Output is correct
3 Correct 785 ms 4656 KB Output is correct
4 Correct 786 ms 4660 KB Output is correct
5 Correct 559 ms 2512 KB Output is correct
6 Correct 891 ms 4648 KB Output is correct
7 Correct 659 ms 4680 KB Output is correct
8 Correct 792 ms 4636 KB Output is correct
9 Correct 350 ms 412 KB Output is correct
10 Correct 653 ms 548 KB Output is correct
11 Correct 705 ms 552 KB Output is correct
12 Correct 570 ms 556 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 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 2 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 384 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 445 ms 2512 KB Output is correct
14 Correct 678 ms 4688 KB Output is correct
15 Correct 785 ms 4656 KB Output is correct
16 Correct 786 ms 4660 KB Output is correct
17 Correct 559 ms 2512 KB Output is correct
18 Correct 891 ms 4648 KB Output is correct
19 Correct 659 ms 4680 KB Output is correct
20 Correct 792 ms 4636 KB Output is correct
21 Correct 350 ms 412 KB Output is correct
22 Correct 653 ms 548 KB Output is correct
23 Correct 705 ms 552 KB Output is correct
24 Correct 570 ms 556 KB Output is correct
25 Runtime error 26 ms 5068 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -

Subtask #7
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 10 ms 208 KB Output is correct
4 Correct 13 ms 208 KB Output is correct
5 Correct 10 ms 208 KB Output is correct
6 Correct 10 ms 336 KB Output is correct
7 Correct 13 ms 208 KB Output is correct
8 Correct 11 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 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 2 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 384 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 384 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 10 ms 208 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 3 ms 208 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 11 ms 336 KB Output is correct
38 Correct 13 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 Runtime error 2 ms 592 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -

Subtask #8
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 10 ms 208 KB Output is correct
4 Correct 13 ms 208 KB Output is correct
5 Correct 10 ms 208 KB Output is correct
6 Correct 10 ms 336 KB Output is correct
7 Correct 13 ms 208 KB Output is correct
8 Correct 11 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 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 2 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 384 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 384 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 10 ms 208 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 3 ms 208 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 11 ms 336 KB Output is correct
38 Correct 13 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 445 ms 2512 KB Output is correct
44 Correct 678 ms 4688 KB Output is correct
45 Correct 785 ms 4656 KB Output is correct
46 Correct 786 ms 4660 KB Output is correct
47 Correct 559 ms 2512 KB Output is correct
48 Correct 891 ms 4648 KB Output is correct
49 Correct 659 ms 4680 KB Output is correct
50 Correct 792 ms 4636 KB Output is correct
51 Correct 350 ms 412 KB Output is correct
52 Correct 653 ms 548 KB Output is correct
53 Correct 705 ms 552 KB Output is correct
54 Correct 570 ms 556 KB Output is correct
55 Runtime error 26 ms 5068 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -