Submission #853503

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
853503	2023-09-24 13:02:54	esomer	Event Hopping (BOI22_events)	C++17	100 / 100	491 ms	47156 KiB

events

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 endl "\n"
struct segTree{
  vector<pair<int, int>> mn;
  int sz;
  void init(int n){
    sz = 1;
    while(sz < n) sz *= 2;
    mn.assign(2 * sz, {2e9, 2e9});
  }
  void set(int i, pair<int, int> val, int x, int lx, int rx){
    if(rx - lx == 1){
      mn[x] = val;
      return;
    }
    int m = (lx + rx) / 2;
    if(i < m) set(i, val, 2 * x + 1, lx, m);
    else set(i, val, 2 * x + 2, m, rx);
    mn[x] = min(mn[2 * x + 1], mn[2 * x + 2]);
  }
  void set(int i, pair<int, int> val){
    set(i, val, 0, 0, sz);
  }
  pair<int, int> calc(int l, int r, int x, int lx, int rx){
    if(lx >= l && rx <= r) return mn[x];
    else if(lx >= r || rx <= l) return {2e9, 2e9};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30