제출 #385392

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
385392	2021-04-04 06:31:58	ritul_kr_singh	케이크 (CEOI14_cake)	C++17	100 / 100	675 ms	7652 KiB

cake

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 nl << '\n'
#define sp << ' ' <<
struct SegmentTree{
  vector<int> a; int sz = 1, ID = -1e9;
  SegmentTree(vector<int> &v){
    while(sz < (int)v.size()) sz += sz;
    a.resize(2*sz, ID);
    build(v, 0, 0, sz);
  }
  void build(vector<int> &v, int x, int lx, int rx){
    if(rx-lx==1){
      if(lx<(int)v.size()) a[x] = v[lx];
      return;
    }
    int mx = (lx+rx)/2;
    build(v, 2*x+1, lx, mx);
    build(v, 2*x+2, mx, rx);
    a[x] = max(a[2*x+1], a[2*x+2]);
  }
  void update(int i, int val, int x, int lx, int rx){
    if(rx-lx==1) return void(a[x] = val);
    int mx = (lx+rx)/2;
    if(i<mx) update(i, val, 2*x+1, lx, mx);
    else update(i, val, 2*x+2, mx, rx);
    a[x] = max(a[2*x+1], a[2*x+2]);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50