oj.uz

Submission #767404

# Submission time Handle Problem Language Result Execution time Memory
767404 2023-06-26T17:51:18 Z t6twotwo Digital Circuit (IOI22_circuit) C++17
22 / 100
 751 ms 3724 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, dp;
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) {
        tot.resize(N + M);
        dp.resize(N + M);
        for (int i = 0; i < M; i++) {
            dp[i + N] = A[i];
            tot[i + N] = 1;
        }
        for (int i = N - 1; i >= 0; i--) {
            int x = i * 2 + 1;
            int y = i * 2 + 2;
            dp[i] = add(mul(dp[x], tot[y]), mul(dp[y], tot[x]));
            tot[i] = mul(2, mul(tot[x], tot[y]));
        }
    }
}
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];
    }
    dp[L] ^= 1;
    for (int i = (L - 1) / 2; ; i = (i - 1) / 2) {
        int x = i * 2 + 1;
        int y = i * 2 + 2;
        dp[i] = add(mul(dp[x], tot[y]), mul(dp[y], tot[x]));
        if (i == 0) {
            break;
        }
    }
    return dp[0];
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory 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 11 ms 328 KB Output is correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 10 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 272 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

# Verdict Execution time Memory 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 11 ms 328 KB Output is correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 10 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 272 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 368 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 400 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 10 ms 332 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

# Verdict Execution time Memory Grader output
1 Correct 442 ms 2000 KB Output is correct
2 Correct 597 ms 3724 KB Output is correct
3 Correct 751 ms 3656 KB Output is correct
4 Correct 579 ms 3596 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 2000 KB Output is correct
2 Correct 597 ms 3724 KB Output is correct
3 Correct 751 ms 3656 KB Output is correct
4 Correct 579 ms 3596 KB Output is correct
5 Incorrect 613 ms 1944 KB 1st lines differ - on the 1st token, expected: '105182172', found: '2777846'
6 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 272 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 442 ms 2000 KB Output is correct
14 Correct 597 ms 3724 KB Output is correct
15 Correct 751 ms 3656 KB Output is correct
16 Correct 579 ms 3596 KB Output is correct
17 Incorrect 613 ms 1944 KB 1st lines differ - on the 1st token, expected: '105182172', found: '2777846'
18 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory 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 11 ms 328 KB Output is correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 10 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 272 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 368 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 400 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 10 ms 332 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 1 ms 592 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory 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 11 ms 328 KB Output is correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 10 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 272 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 368 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 400 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 10 ms 332 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 442 ms 2000 KB Output is correct
44 Correct 597 ms 3724 KB Output is correct
45 Correct 751 ms 3656 KB Output is correct
46 Correct 579 ms 3596 KB Output is correct
47 Incorrect 613 ms 1944 KB 1st lines differ - on the 1st token, expected: '105182172', found: '2777846'
48 Halted 0 ms 0 KB -