제출 #551730

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
551730	2022-04-21 11:46:39	AugustinasJucas	케이크 (CEOI14_cake)	C++14	83.33 / 100	2094 ms	28012 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>
#pragma GCC optimize("O3")
using namespace std;
struct tree {
  const int inf = 1e9;
  vector<int> l, r;
  vector<pair<int, int> > val;
  int n, dbInd = 0;
  void build(int v){
    if(v >= n) {
      l[v] = r[v] = dbInd++;
      val[v] = {0, l[v]};
    }else {
      build(v*2);
      build(v*2+1);
      l[v] = l[v*2];
      r[v] = r[v*2+1];
      val[v] = min(val[v*2], val[v*2+1]);
    }
  }
  tree(int dd) {
    n = dd;
    l.resize(2*n);
    r.resize(2*n);
    val.resize(2*n);
    build(1);
  }
  void change(int v, int L, int R, int x) {
    if(L <= l[v] && r[v] <= R) {
      val[v] = {x, l[v]};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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