제출 #555377

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
555377	2022-04-30 17:54:51	sidon	Dynamic Diameter (CEOI19_diameter)	C++17	100 / 100	2117 ms	188872 KiB

diameter

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 int64_t
 
const int Z = 1e5, B = 17, INF = 1e18+1;
 
array<int, 2> operator+(const int &x, array<int, 2> y) {
  y[0] += x;
  return y;
}
 
struct SegmentTree {
  int n, *add;
  array<int, 2> *val;
  int sL, sR, sV;
  SegmentTree(int N) : n(2<<__lg(N-1)), add(new int[2*n] {}), val(new array<int, 2> [2*n] {}) {
    for(int i = n - 1; i < 2*n; ++i) val[i][0] = -INF;
  }
  void assign(const int &i, const array<int, 2> &v) {
    val[n+i-1] = v;
  }
  void build() {
    for(int i = n-1; i--; ) val[i] = max(val[2*i+1], val[2*i+2]);
  }
  void update(int l, int r, int v) {
    sL = l, sR = r + 1, sV = v;
    upd(0, 0, n);
  }
  void upd(int x, int l, int r) {
    if(sL <= l && r <= sR) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 13 / 13
• Subtask 3: 7 / 7
• Subtask 4: 18 / 18
• Subtask 5: 24 / 24
• Subtask 6: 27 / 27