Submission #383253

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
383253	2021-03-29 10:32:49	ritul_kr_singh	Railway (BOI17_railway)	C++17	100 / 100	606 ms	35936 KiB

railway

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;
#define int long long
#define sp << " " <<
#define nl << "\n"
struct segtree{
  int sz = 1;
  vector<bool> a;
  segtree(int n){
    while(sz < n) sz *= 2;
    a.assign(2*sz, false);
  }
  void update(int i, int x, int lx, int rx){
    if(rx-lx==1) return void(a[x] = !a[x]);
    int mx = (lx+rx)/2;
    if(i<mx) update(i, 2*x+1, lx, mx);
    else update(i, 2*x+2, mx, rx);
    a[x] = max(a[2*x+1], a[2*x+2]);
  }
  void update(int i){ update(i, 0, 0, sz); }
  bool get(int l, int r, int x, int lx, int rx){
    if(r<=lx or rx<=l) return false;
    if(l<=lx and rx<=r) return a[x];
    int mx = (lx+rx)/2;
    return get(l, r, 2*x+1, lx, mx) or get(l, r, 2*x+2, mx, rx);
  }
  bool get(int l, int r){ return get(l, r+1, 0, 0, sz); }
};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 15 / 15
• Subtask 3: 7 / 7
• Subtask 4: 29 / 29
• Subtask 5: 16 / 16
• Subtask 6: 25 / 25