제출 #448301

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
448301	2021-07-29 13:58:32	dutch	Long Mansion (JOI17_long_mansion)	C++17	100 / 100	761 ms	60896 KiB

long_mansion

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 f(z) z = n + 1 - z
 
const int LIM = 5e5+1, INF = 1e9, S = 1<<19;
 
struct SegmentTree{
  vector<int> a; int l, r;
  SegmentTree(int N, int* v) : a(S+S, INF) {
    for(int i=N-0; --i>=0; ) a[i+S-1] = v[i];
    for(int i=S-1; --i>=0; ){
      a[i] = min(a[2*i+1], a[2*i+2]);
    }
  }
  int query(int x, int lx, int rx){
    if(a[x] >= r || rx <= l) return 0;
    if(rx - lx < 2) return lx;
    int mx = (lx + rx) / 2;
    return query(2*x+1, lx, mx) ? : query(2*x+2, mx, rx);
  }
  int operator()(int L, int V){ //first v[i] s.t. i>=l && v[i]<v
    l = L, r = V; return query(0, 0, S);
  }
  int rangeMin(int x, int lx, int rx){
    if(r<=lx || rx<=l) return INF;
    if(l<=lx && rx<=r) return a[x];
    int mx = (lx + rx) / 2;
    return min(rangeMin(2*x+1, lx, mx), rangeMin(2*x+2, mx, rx));
  }
  int rangeMin(int L, int R){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 15 / 15
• Subtask 4: 75 / 75