제출 #113252

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
113252	2019-05-24 12:35:39	njchung99	벽 (IOI14_wall)	C++14	100 / 100	1275 ms	69496 KiB

wall

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 "wall.h"
#include<cstdio>
#include<algorithm>
using namespace std;
int mi[8000000], ma[8000000];
int *dap;
void update(int lo, int hi, int val, int node, int x, int y, int p) {
  if (hi < x || y < lo)return;
  if (lo <= x && y <= hi) {
    if (p == 1) {
      mi[node] = max(mi[node], val);
      ma[node] = max(ma[node], val);
    }
    else if (p == 2)
    {
      mi[node] = min(mi[node], val);
      ma[node] = min(ma[node], val);
    }
    if (x == y)
      dap[x] = ma[node];
    return;
  }
  int ll = node * 2;
  int rr = node * 2 + 1;
  int mid = (x + y) / 2;
  mi[ll] = min(mi[ll], mi[node]); mi[rr] = min(mi[rr], mi[node]);
  ma[ll] = min(ma[ll], mi[node]); ma[rr] = min(ma[rr], mi[node]);
  mi[ll] = max(mi[ll], ma[node]); mi[rr] = max(mi[rr], ma[node]);
  ma[ll] = max(ma[ll], ma[node]); ma[rr] = max(ma[rr], ma[node]);
  ma[node] = 0; mi[node] = 1234567890;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 24 / 24
• Subtask 3: 29 / 29
• Subtask 4: 39 / 39