Submission #629138

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
629138	2022-08-14 08:10:33	kdh9949	Digital Circuit (IOI22_circuit)	C++17	100 / 100	1304 ms	29456 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 "circuit.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int SZ = 131072;
const ll MOD = ll(1e9) + 2022;
struct Seg {
  int l[2 * SZ];
  ll d[2 * SZ], w[2 * SZ];
  void i(int n, vector<int> a, vector<ll> v) {
    for(int i = 0; i < n; i++) w[i + SZ] = v[i];
    for(int i = 0; i < n; i++) if(a[i]) d[i + SZ] = v[i];
    for(int i = SZ - 1; i; i--) {
      d[i] = (d[2 * i] + d[2 * i + 1]) % MOD;
      w[i] = (w[2 * i] + w[2 * i + 1]) % MOD;
    }
  }
  void flp(int x) {
    d[x] = (w[x] + MOD - d[x]) % MOD;
    l[x] ^= 1;
  }
  void u(int s, int e, int x = 1, int p = 0, int q = SZ - 1) {
    if(e < p || q < s) return;
    if(s <= p && q <= e) {
      flp(x);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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