Submission #683188

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
683188	2023-01-17 22:14:16	NK_	Sterilizing Spray (JOI15_sterilizing)	C++17	100 / 100	259 ms	7548 KiB

sterilizing

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
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
using ll = long long;
struct Seg {
  const ll ID = 0; ll comb(ll a, ll b) { return a + b; }
  vector<ll> seg; int n;
  void init(int _n) { n = _n; seg.assign(2*n, ID); }
  void pull(int x) { seg[x] = comb(seg[2*x], seg[2*x+1]); }
  void set(int p, int x) { seg[p += n] = x; for(p /= 2; p; p /= 2) pull(p); }
  ll query(int l, int r) {
    ll ra = ID, rb = ID;
    for(l += n, r += n+1; l < r; l /= 2, r /= 2) {
      if (l&1) ra = comb(ra, seg[l++]);
      if (r&1) rb = comb(seg[--r], rb);
    }
    return comb(ra, rb);
  } 
};
int main() {
  cin.tie(0)->sync_with_stdio(0);
  
  int N, Q, K; cin >> N >> Q >> K;
  vector<int> A(N); for(auto &x : A) cin >> x;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 75 / 75