oj.uz

Submission #631808

# Submission time Handle Problem Language Result Execution time Memory
631808 2022-08-18T19:21:26 Z 4123xr4323 Digital Circuit (IOI22_circuit) C++17
89 / 100
 3000 ms 24180 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 = 2e5 + 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;
    }
}

vector <int> w0, w1;

inline void dfs1 (int v, long long cur) {
    if (graph[v].empty ()) return;
    x[v] = cur;
    for (int i : graph[v]) x[v] = (x[v] * sub_size[i]) % mod;
    w0 = w1 = graph[v];
    w0[0] = 1;
    for (int i = 1; i < (int) graph[v].size (); ++i) 
        w0[i] = (w0[i - 1] * sub_size[graph[v][i - 1]]) % mod;
    w1[(int) w1.size () - 1] = 1;
    for (int i = (int) graph[v].size () - 2; i >= 0; --i) 
        w1[i] = (w1[i + 1] * sub_size[graph[v][i + 1]]) % mod;
    int d = 0;
    for (int i : graph[v]) {
        long long cur0 = cur;
        cur0 = (cur0 * w0[d]) % mod;
        cur0 = (cur0 * w1[d]) % mod;
        ++d;
        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 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 7 ms 5072 KB Output is correct
4 Correct 7 ms 5072 KB Output is correct
5 Correct 7 ms 5064 KB Output is correct
6 Correct 7 ms 5072 KB Output is correct
7 Correct 7 ms 5072 KB Output is correct
8 Correct 7 ms 5072 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 8864 KB Output is correct
2 Correct 948 ms 12696 KB Output is correct
3 Correct 761 ms 12780 KB Output is correct
4 Correct 939 ms 12024 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 8864 KB Output is correct
2 Correct 948 ms 12696 KB Output is correct
3 Correct 761 ms 12780 KB Output is correct
4 Correct 939 ms 12024 KB Output is correct
5 Correct 788 ms 8904 KB Output is correct
6 Correct 908 ms 12688 KB Output is correct
7 Correct 1006 ms 12800 KB Output is correct
8 Correct 870 ms 12744 KB Output is correct
9 Correct 352 ms 5200 KB Output is correct
10 Correct 820 ms 5460 KB Output is correct
11 Correct 864 ms 5456 KB Output is correct
12 Correct 895 ms 5456 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5020 KB Output is correct
2 Correct 2 ms 5072 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 3 ms 5072 KB Output is correct
5 Correct 3 ms 5072 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5072 KB Output is correct
8 Correct 3 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 3 ms 5200 KB Output is correct
11 Correct 3 ms 5200 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 629 ms 8864 KB Output is correct
14 Correct 948 ms 12696 KB Output is correct
15 Correct 761 ms 12780 KB Output is correct
16 Correct 939 ms 12024 KB Output is correct
17 Correct 788 ms 8904 KB Output is correct
18 Correct 908 ms 12688 KB Output is correct
19 Correct 1006 ms 12800 KB Output is correct
20 Correct 870 ms 12744 KB Output is correct
21 Correct 352 ms 5200 KB Output is correct
22 Correct 820 ms 5460 KB Output is correct
23 Correct 864 ms 5456 KB Output is correct
24 Correct 895 ms 5456 KB Output is correct
25 Correct 989 ms 17736 KB Output is correct
26 Correct 919 ms 17908 KB Output is correct
27 Correct 916 ms 17828 KB Output is correct
28 Correct 809 ms 17924 KB Output is correct
29 Correct 953 ms 24180 KB Output is correct
30 Correct 890 ms 24088 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 7 ms 5072 KB Output is correct
4 Correct 7 ms 5072 KB Output is correct
5 Correct 7 ms 5064 KB Output is correct
6 Correct 7 ms 5072 KB Output is correct
7 Correct 7 ms 5072 KB Output is correct
8 Correct 7 ms 5072 KB Output is correct
9 Correct 3 ms 5020 KB Output is correct
10 Correct 2 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5072 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 3 ms 5072 KB Output is correct
16 Correct 3 ms 5072 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 3 ms 5200 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 3 ms 5072 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 5 ms 5200 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 4 ms 5072 KB Output is correct
28 Correct 3 ms 5072 KB Output is correct
29 Correct 7 ms 5072 KB Output is correct
30 Correct 7 ms 5072 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 3 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 3 ms 5072 KB Output is correct
36 Correct 3 ms 5200 KB Output is correct
37 Correct 8 ms 5200 KB Output is correct
38 Correct 9 ms 5192 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 4 ms 5072 KB Output is correct
41 Correct 3 ms 5072 KB Output is correct
42 Correct 4 ms 5072 KB Output is correct
43 Correct 643 ms 5328 KB Output is correct
44 Correct 717 ms 5456 KB Output is correct
45 Correct 820 ms 5328 KB Output is correct
46 Correct 934 ms 5712 KB Output is correct
47 Correct 785 ms 5712 KB Output is correct
48 Correct 946 ms 5712 KB Output is correct
49 Correct 1070 ms 5712 KB Output is correct
50 Correct 633 ms 5712 KB Output is correct
51 Correct 970 ms 5436 KB Output is correct
52 Correct 1032 ms 5448 KB Output is correct
53 Correct 773 ms 5584 KB Output is correct
54 Correct 888 ms 5712 KB Output is correct
55 Correct 860 ms 5584 KB Output is correct
56 Correct 974 ms 5456 KB Output is correct
57 Correct 982 ms 5456 KB Output is correct
58 Correct 902 ms 5968 KB Output is correct
59 Correct 1103 ms 6104 KB Output is correct
60 Correct 901 ms 6104 KB Output is correct
61 Correct 812 ms 5456 KB Output is correct
62 Correct 835 ms 5328 KB Output is correct
63 Correct 920 ms 5328 KB Output is correct
64 Correct 936 ms 5456 KB Output is correct
65 Correct 448 ms 5200 KB Output is correct
66 Correct 581 ms 5456 KB Output is correct
67 Correct 1008 ms 5456 KB Output is correct
68 Correct 934 ms 5456 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 7 ms 5072 KB Output is correct
4 Correct 7 ms 5072 KB Output is correct
5 Correct 7 ms 5064 KB Output is correct
6 Correct 7 ms 5072 KB Output is correct
7 Correct 7 ms 5072 KB Output is correct
8 Correct 7 ms 5072 KB Output is correct
9 Correct 3 ms 5020 KB Output is correct
10 Correct 2 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5072 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 3 ms 5072 KB Output is correct
16 Correct 3 ms 5072 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 3 ms 5200 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 3 ms 5072 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 5 ms 5200 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 4 ms 5072 KB Output is correct
28 Correct 3 ms 5072 KB Output is correct
29 Correct 7 ms 5072 KB Output is correct
30 Correct 7 ms 5072 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 3 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 3 ms 5072 KB Output is correct
36 Correct 3 ms 5200 KB Output is correct
37 Correct 8 ms 5200 KB Output is correct
38 Correct 9 ms 5192 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 4 ms 5072 KB Output is correct
41 Correct 3 ms 5072 KB Output is correct
42 Correct 4 ms 5072 KB Output is correct
43 Correct 629 ms 8864 KB Output is correct
44 Correct 948 ms 12696 KB Output is correct
45 Correct 761 ms 12780 KB Output is correct
46 Correct 939 ms 12024 KB Output is correct
47 Correct 788 ms 8904 KB Output is correct
48 Correct 908 ms 12688 KB Output is correct
49 Correct 1006 ms 12800 KB Output is correct
50 Correct 870 ms 12744 KB Output is correct
51 Correct 352 ms 5200 KB Output is correct
52 Correct 820 ms 5460 KB Output is correct
53 Correct 864 ms 5456 KB Output is correct
54 Correct 895 ms 5456 KB Output is correct
55 Correct 989 ms 17736 KB Output is correct
56 Correct 919 ms 17908 KB Output is correct
57 Correct 916 ms 17828 KB Output is correct
58 Correct 809 ms 17924 KB Output is correct
59 Correct 953 ms 24180 KB Output is correct
60 Correct 890 ms 24088 KB Output is correct
61 Correct 643 ms 5328 KB Output is correct
62 Correct 717 ms 5456 KB Output is correct
63 Correct 820 ms 5328 KB Output is correct
64 Correct 934 ms 5712 KB Output is correct
65 Correct 785 ms 5712 KB Output is correct
66 Correct 946 ms 5712 KB Output is correct
67 Correct 1070 ms 5712 KB Output is correct
68 Correct 633 ms 5712 KB Output is correct
69 Correct 970 ms 5436 KB Output is correct
70 Correct 1032 ms 5448 KB Output is correct
71 Correct 773 ms 5584 KB Output is correct
72 Correct 888 ms 5712 KB Output is correct
73 Correct 860 ms 5584 KB Output is correct
74 Correct 974 ms 5456 KB Output is correct
75 Correct 982 ms 5456 KB Output is correct
76 Correct 902 ms 5968 KB Output is correct
77 Correct 1103 ms 6104 KB Output is correct
78 Correct 901 ms 6104 KB Output is correct
79 Correct 812 ms 5456 KB Output is correct
80 Correct 835 ms 5328 KB Output is correct
81 Correct 920 ms 5328 KB Output is correct
82 Correct 936 ms 5456 KB Output is correct
83 Correct 448 ms 5200 KB Output is correct
84 Correct 581 ms 5456 KB Output is correct
85 Correct 1008 ms 5456 KB Output is correct
86 Correct 934 ms 5456 KB Output is correct
87 Correct 3 ms 4944 KB Output is correct
88 Correct 533 ms 17024 KB Output is correct
89 Correct 1232 ms 12924 KB Output is correct
90 Correct 979 ms 12624 KB Output is correct
91 Correct 890 ms 18036 KB Output is correct
92 Correct 854 ms 17940 KB Output is correct
93 Correct 1071 ms 16952 KB Output is correct
94 Correct 1012 ms 17992 KB Output is correct
95 Correct 967 ms 17956 KB Output is correct
96 Execution timed out 3058 ms 8568 KB Time limit exceeded
97 Halted 0 ms 0 KB -