제출 #973403

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
973403	2024-05-01 23:09:26	colossal_pepe	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	1254 ms	106264 KiB

sortbooks

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;
const int INF = 1e9;
struct SGT {
  int n;
  vector<int> tree;
  SGT(int _n) {
    n = _n;
    tree.resize(4 * n, 0);
  }
  void update(int node, int l, int r, int idx, int x) {
    if (l == r) tree[node] = x;
    else {
      int mid = (l + r) / 2;
      if (idx <= mid) update(2 * node, l, mid, idx, x);
      else update(2 * node + 1, mid + 1, r, idx, x);
      tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }
  }
  int query(int node, int l, int r, int L, int R) {
    if (R < l or r < L) return 0;
    else if (L <= l and r <= R) return tree[node];
    else{
      int mid = (l + r) / 2;
      return max(query(2 * node, l, mid, L, R), query(2 * node + 1, mid + 1, r, L, R));
    }
  }
};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 17 / 17
• Subtask 5: 30 / 30
• Subtask 6: 23 / 23