제출 #963738

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
963738	2024-04-15 14:51:31	Soumya1	치료 계획 (JOI20_treatment)	C++17	100 / 100	326 ms	34924 KiB

treatment

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;
using ll = long long;
const ll inf = 1e18;
const int l2 = 2e9 + 10;
struct SegmentTree {
  int n;
  vector<pair<int, int>> t;
  vector<multiset<pair<int, int>>> mst;
  SegmentTree(int _n) {
    n = _n;
    t.assign(4 * n, {l2, l2});
    mst.resize(n + 1);
  }
  void update(int x, int lx, int rx, int i, pair<int, int> v, bool erase) {
    if (lx == rx) {
      if (erase) mst[lx].erase(mst[lx].find(v));
      else mst[lx].insert(v);
      if (mst[lx].empty()) t[x] = {l2, l2};
      else t[x] = *mst[lx].begin();
      return;
    }
    int mx = (lx + rx) >> 1;
    if (i <= mx) update(x << 1, lx, mx, i, v, erase);
    else update(x << 1 | 1, mx + 1, rx, i, v, erase);
    t[x] = min(t[x << 1], t[x << 1 | 1]);
  }
  pair<int, int> query(int x, int lx, int rx, int l, int r) {
    if (l > rx || lx > r || l > r) return {l2, l2};
    if (l <= lx && r >= rx) return t[x];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 30 / 30
• Subtask 4: 61 / 61