Submission #627401

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
627401	2022-08-12 14:31:18	phathnv	Digital Circuit (IOI22_circuit)	C++17	100 / 100	1771 ms	34192 KiB

circuit

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int MOD = 1e9 + 2022;
struct Segtree {
    int n;
    vector<array<int, 2>> a;
    vector<int> lazy;
    void init(int _n, const vector<array<int, 2>> &val) {
        n = _n;
        a.assign(4 * n + 1, {0, 0});
        lazy.assign(4 * n + 1, 0);
        build(1, 0, n - 1, val);
    }
    void build(int id, int l, int r, const vector<array<int, 2>> &val) {
        if (l == r) {
            a[id] = val[l];
            cerr << "build " << a[id][0] << ' ' << a[id][1] << endl;
            return;
        }
        int mid = (l + r) >> 1;
        build(id << 1, l, mid, val);
        build(id << 1 | 1, mid + 1, r, val);
        a[id][0] = (a[id << 1][0] + a[id << 1 | 1][0]) % MOD;
        a[id][1] = (a[id << 1][1] + a[id << 1 | 1][1]) % MOD;
    }
    void doLazy(int id, int l, int r) {
        if (lazy[id]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 4 / 4
• Subtask 5: 12 / 12
• Subtask 6: 27 / 27
• Subtask 7: 28 / 28
• Subtask 8: 11 / 11