제출 #580899

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
580899	2022-06-22 05:41:32	amunduzbaev	Event Hopping (BOI22_events)	C++17	100 / 100	208 ms	12248 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 ar array
typedef int64_t ll;
//~ #define int ll
const int N = 1e5 + 5;
int l[N], r[N], p[N][20];
struct ST{
  int tree[N << 2];
  
  void sett(int i, int v, int lx = 0, int rx = N, int x = 1){
    if(lx == rx){
      if(r[v] > r[tree[x]]) tree[x] = v;
      return;
    }
    int m = (lx + rx) >> 1;
    if(i <= m) sett(i, v, lx, m, x << 1);
    else sett(i, v, m + 1, rx, x << 1 | 1);
    if(r[tree[x << 1]] > r[tree[x << 1 | 1]]) tree[x] = tree[x << 1];
    else tree[x] = tree[x << 1 | 1];
  }
  
  int get(int l, int r, int lx = 0, int rx = N, int x = 1){
    if(lx > r || rx < l) return 0;
    if(lx >= l && rx <= r) return tree[x];
    int m = (lx + rx) >> 1;
    int L = get(l, r, lx, m, x << 1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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