oj.uz

Submission #631800

# Submission time Handle Problem Language Result Execution time Memory
631800 2022-08-18T19:05:05 Z 4123xr4323 Digital Circuit (IOI22_circuit) C++17
46 / 100
 1036 ms 13548 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define all(a) a.begin(),a.end()
using namespace std;
using pii = pair <long long, long long>;
constexpr int maxn = 1e5 + 10;
constexpr int mod = 1000002022;
constexpr long long inf = 1e17 + 10;
 
vector <int> graph [maxn];
long long sub_size [maxn], ans [maxn];
long long x [maxn], tree [maxn << 2], S [maxn << 2];
bool R [maxn << 2];
int n, m;
 
inline void build (int v, int t_l, int t_r) {
    if (t_l == t_r) {
        S[v] = ans[t_l];
        return;
    }
    int t_m = t_l + t_r >> 1;
    build (v << 1, t_l, t_m);
    build (v << 1 | 1, t_m + 1, t_r);
    S[v] = (S[v << 1] + S[v << 1 | 1]) % mod;
} 
 
inline void push (int v, int t_l, int t_r) {
    if (!R[v]) return;
    tree[v] = (S[v] - tree[v] + mod) % mod;
    if (t_l < t_r) {
        R[v << 1] ^= 1;
        R[v << 1 | 1] ^= 1;
    }
    R[v] = false;
}
 
inline void update (int l, int r, int v, int t_l, int t_r) {
    push (v, t_l, t_r);
    if (l > t_r || t_l > r) return;
    if (l <= t_l && t_r <= r) {
        R[v] = true;
        push (v, t_l, t_r);
        return;
    }
    int t_m = t_l + t_r >> 1;
    update (l, r, v << 1, t_l, t_m);
    update (l, r, v << 1 | 1, t_m + 1, t_r);
    tree[v] = (tree[v << 1] + tree[v << 1 | 1]) % mod;
}
 
inline void dfs0 (int v) {
    sub_size[v] = max (1LL, (long long) graph[v].size ());
    for (int i : graph[v]) {
        dfs0 (i);
        sub_size[v] = (sub_size[v] * sub_size[i]) % mod;
    }
}
 
inline void dfs1 (int v, long long cur) {
    x[v] = cur;
    for (int i : graph[v]) x[v] = (x[v] * sub_size[i]) % mod;
    for (int i : graph[v]) {
        long long cur0 = cur;
        for (int j : graph[v]) if (i != j) cur0 = (cur0 * sub_size[j]) % mod;
        dfs1 (i, cur0);
    }
}
 
void init (int N, int M, vector <int> P, vector <int> A) {
    n = N, m = M;
    for (int i = 1; i < n + m; ++i) graph[P[i]].push_back (i);
    dfs0 (0);
    dfs1 (0, 1);
    for (int i = n; i < n + m; ++i) ans[i] = x[P[i]];
    build (1, n, n + m - 1);
    for (int i = 0; i < m; ++i) if (A[i]) update (i + n, i + n, 1, n, n + m - 1);
}
 
int count_ways (int L, int R) {
    update (L, R, 1, n, n + m - 1);
    return tree[1];
}

Compilation message

circuit.cpp: In function 'void build(int, int, int)':
circuit.cpp:21:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     int t_m = t_l + t_r >> 1;
      |               ~~~~^~~~~
circuit.cpp: In function 'void update(int, int, int, int, int)':
circuit.cpp:45:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |     int t_m = t_l + t_r >> 1;
      |               ~~~~^~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 6 ms 2640 KB Output is correct
4 Correct 6 ms 2640 KB Output is correct
5 Correct 6 ms 2640 KB Output is correct
6 Correct 6 ms 2640 KB Output is correct
7 Correct 6 ms 2640 KB Output is correct
8 Correct 6 ms 2640 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 2 ms 2640 KB Output is correct
6 Correct 2 ms 2768 KB Output is correct
7 Correct 2 ms 2768 KB Output is correct
8 Correct 2 ms 2784 KB Output is correct
9 Correct 2 ms 2768 KB Output is correct
10 Correct 2 ms 2768 KB Output is correct
11 Correct 2 ms 2768 KB Output is correct
12 Correct 2 ms 2768 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 6 ms 2640 KB Output is correct
4 Correct 6 ms 2640 KB Output is correct
5 Correct 6 ms 2640 KB Output is correct
6 Correct 6 ms 2640 KB Output is correct
7 Correct 6 ms 2640 KB Output is correct
8 Correct 6 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 2 ms 2640 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 2 ms 2768 KB Output is correct
15 Correct 2 ms 2768 KB Output is correct
16 Correct 2 ms 2784 KB Output is correct
17 Correct 2 ms 2768 KB Output is correct
18 Correct 2 ms 2768 KB Output is correct
19 Correct 2 ms 2768 KB Output is correct
20 Correct 2 ms 2768 KB Output is correct
21 Correct 3 ms 2768 KB Output is correct
22 Correct 2 ms 2640 KB Output is correct
23 Correct 2 ms 2784 KB Output is correct
24 Correct 2 ms 2768 KB Output is correct
25 Correct 2 ms 2768 KB Output is correct
26 Correct 2 ms 2768 KB Output is correct
27 Correct 2 ms 2768 KB Output is correct
28 Correct 2 ms 2768 KB Output is correct
29 Correct 6 ms 2640 KB Output is correct
30 Correct 6 ms 2700 KB Output is correct
31 Correct 2 ms 2768 KB Output is correct
32 Correct 2 ms 2768 KB Output is correct
33 Correct 2 ms 2768 KB Output is correct
34 Correct 2 ms 2768 KB Output is correct
35 Correct 3 ms 2640 KB Output is correct
36 Correct 2 ms 2768 KB Output is correct
37 Correct 6 ms 2768 KB Output is correct
38 Correct 6 ms 2784 KB Output is correct
39 Correct 3 ms 2640 KB Output is correct
40 Correct 2 ms 2728 KB Output is correct
41 Correct 2 ms 2768 KB Output is correct
42 Correct 2 ms 2640 KB Output is correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 6708 KB Output is correct
2 Runtime error 30 ms 13548 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 6708 KB Output is correct
2 Runtime error 30 ms 13548 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2640 KB Output is correct
2 Correct 2 ms 2640 KB Output is correct
3 Correct 1 ms 2640 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 2 ms 2640 KB Output is correct
6 Correct 2 ms 2768 KB Output is correct
7 Correct 2 ms 2768 KB Output is correct
8 Correct 2 ms 2784 KB Output is correct
9 Correct 2 ms 2768 KB Output is correct
10 Correct 2 ms 2768 KB Output is correct
11 Correct 2 ms 2768 KB Output is correct
12 Correct 2 ms 2768 KB Output is correct
13 Correct 432 ms 6708 KB Output is correct
14 Runtime error 30 ms 13548 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 6 ms 2640 KB Output is correct
4 Correct 6 ms 2640 KB Output is correct
5 Correct 6 ms 2640 KB Output is correct
6 Correct 6 ms 2640 KB Output is correct
7 Correct 6 ms 2640 KB Output is correct
8 Correct 6 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 2 ms 2640 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 2 ms 2768 KB Output is correct
15 Correct 2 ms 2768 KB Output is correct
16 Correct 2 ms 2784 KB Output is correct
17 Correct 2 ms 2768 KB Output is correct
18 Correct 2 ms 2768 KB Output is correct
19 Correct 2 ms 2768 KB Output is correct
20 Correct 2 ms 2768 KB Output is correct
21 Correct 3 ms 2768 KB Output is correct
22 Correct 2 ms 2640 KB Output is correct
23 Correct 2 ms 2784 KB Output is correct
24 Correct 2 ms 2768 KB Output is correct
25 Correct 2 ms 2768 KB Output is correct
26 Correct 2 ms 2768 KB Output is correct
27 Correct 2 ms 2768 KB Output is correct
28 Correct 2 ms 2768 KB Output is correct
29 Correct 6 ms 2640 KB Output is correct
30 Correct 6 ms 2700 KB Output is correct
31 Correct 2 ms 2768 KB Output is correct
32 Correct 2 ms 2768 KB Output is correct
33 Correct 2 ms 2768 KB Output is correct
34 Correct 2 ms 2768 KB Output is correct
35 Correct 3 ms 2640 KB Output is correct
36 Correct 2 ms 2768 KB Output is correct
37 Correct 6 ms 2768 KB Output is correct
38 Correct 6 ms 2784 KB Output is correct
39 Correct 3 ms 2640 KB Output is correct
40 Correct 2 ms 2728 KB Output is correct
41 Correct 2 ms 2768 KB Output is correct
42 Correct 2 ms 2640 KB Output is correct
43 Correct 673 ms 3024 KB Output is correct
44 Correct 793 ms 3024 KB Output is correct
45 Correct 909 ms 3024 KB Output is correct
46 Correct 759 ms 3408 KB Output is correct
47 Correct 832 ms 3420 KB Output is correct
48 Correct 872 ms 3408 KB Output is correct
49 Correct 900 ms 3428 KB Output is correct
50 Correct 861 ms 3408 KB Output is correct
51 Correct 1036 ms 3144 KB Output is correct
52 Correct 955 ms 3084 KB Output is correct
53 Correct 801 ms 3024 KB Output is correct
54 Correct 892 ms 3408 KB Output is correct
55 Correct 825 ms 3280 KB Output is correct
56 Correct 793 ms 3152 KB Output is correct
57 Correct 854 ms 3152 KB Output is correct
58 Correct 905 ms 3544 KB Output is correct
59 Correct 993 ms 3640 KB Output is correct
60 Correct 944 ms 3648 KB Output is correct
61 Correct 790 ms 3152 KB Output is correct
62 Correct 603 ms 3024 KB Output is correct
63 Correct 835 ms 3024 KB Output is correct
64 Correct 834 ms 3152 KB Output is correct
65 Correct 416 ms 2896 KB Output is correct
66 Correct 842 ms 3164 KB Output is correct
67 Correct 822 ms 3152 KB Output is correct
68 Correct 921 ms 3152 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 6 ms 2640 KB Output is correct
4 Correct 6 ms 2640 KB Output is correct
5 Correct 6 ms 2640 KB Output is correct
6 Correct 6 ms 2640 KB Output is correct
7 Correct 6 ms 2640 KB Output is correct
8 Correct 6 ms 2640 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 2 ms 2640 KB Output is correct
13 Correct 2 ms 2640 KB Output is correct
14 Correct 2 ms 2768 KB Output is correct
15 Correct 2 ms 2768 KB Output is correct
16 Correct 2 ms 2784 KB Output is correct
17 Correct 2 ms 2768 KB Output is correct
18 Correct 2 ms 2768 KB Output is correct
19 Correct 2 ms 2768 KB Output is correct
20 Correct 2 ms 2768 KB Output is correct
21 Correct 3 ms 2768 KB Output is correct
22 Correct 2 ms 2640 KB Output is correct
23 Correct 2 ms 2784 KB Output is correct
24 Correct 2 ms 2768 KB Output is correct
25 Correct 2 ms 2768 KB Output is correct
26 Correct 2 ms 2768 KB Output is correct
27 Correct 2 ms 2768 KB Output is correct
28 Correct 2 ms 2768 KB Output is correct
29 Correct 6 ms 2640 KB Output is correct
30 Correct 6 ms 2700 KB Output is correct
31 Correct 2 ms 2768 KB Output is correct
32 Correct 2 ms 2768 KB Output is correct
33 Correct 2 ms 2768 KB Output is correct
34 Correct 2 ms 2768 KB Output is correct
35 Correct 3 ms 2640 KB Output is correct
36 Correct 2 ms 2768 KB Output is correct
37 Correct 6 ms 2768 KB Output is correct
38 Correct 6 ms 2784 KB Output is correct
39 Correct 3 ms 2640 KB Output is correct
40 Correct 2 ms 2728 KB Output is correct
41 Correct 2 ms 2768 KB Output is correct
42 Correct 2 ms 2640 KB Output is correct
43 Correct 432 ms 6708 KB Output is correct
44 Runtime error 30 ms 13548 KB Execution killed with signal 11
45 Halted 0 ms 0 KB -