Submission #538197

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
538197	2022-03-16 08:06:10	fhvirus	Treatment Project (JOI20_treatment)	C++17	100 / 100	189 ms	30032 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;
struct Lisan: vector<int> {
  void done() { sort(begin(), end()); erase(unique(begin(), end()), end()); }
  int operator () (const int& v) const { return std::lower_bound(begin(), end(), v) - begin(); }
  int upper_bound (const int& v) const { return std::upper_bound(begin(), end(), v) - begin(); }
};
struct Treatment {
  int T, L, R, C, x, y;
  Treatment (const int& _T, const int& _L, const int& _R, const int& _C):
    T(_T), L(_L), R(_R), C(_C), x(L + T), y(L - T) {}
};
struct SegmentTree {
  int n; vector<vector<pair<int, int>>> val;
  SegmentTree (const int& _n): n(_n), val(4 << __lg(n)) {}
  void insert(int i, int l, int r, int p, pair<int, int> v) {
    if (l + 1 == r) {
      val[i].push_back(v);
      return;
    }
    int m = (l + r) / 2;
    if (p < m) insert(i * 2, l, m, p, v);
    else insert(i * 2 + 1, m, r, p, v);
  }
  void insert(int x, int y, int i) { insert(1, 0, n, x, pair<int, int>(y, i)); }
  void build(int i, int l, int r) {
    if (l + 1 == r) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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