제출 #543785

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
543785	2022-03-31 11:42:18	amunduzbaev	새 집 (APIO18_new_home)	C++17	5 / 100	1373 ms	1048576 KiB

new_home

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 ar array
#define pq priority_queue
const int N = 3e5 + 5;
const int M = 1e7 + 5;
const int MX = 1e8 + 5;
 
struct ST{
  multiset<int> tree[M][2];
  int f[M][2], last;
  ST(){
    last = 0;
  }
  
  void make(int x){
    if(!f[x][0]) f[x][0] = ++last;
    if(!f[x][1]) f[x][1] = ++last;
  }
  
  void add(int l, int r, int s, int t, int lx = 0, int rx = MX, int x = 0){
    if(lx > r || rx < l) return;
    if(lx >= l && rx <= r){
      if(t == 1){
        tree[x][0].insert(s + (lx - l));
        //~ tree[x][0] = max(tree[x][0], s + (lx - l));
      } else {
        tree[x][1].insert(s - (lx - l));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 23
• Subtask 5: 0 / 35
• Subtask 6: 0 / 20