제출 #387523

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
387523	2021-04-08 18:15:22	peijar	벽 (IOI14_wall)	C++17	100 / 100	2227 ms	119148 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 <bits/stdc++.h>
using namespace std;
 
const int MAXN = 8e6;
const int INF = 1e9;
 
int segVal[MAXN], lazyMax[MAXN], lazyMin[MAXN];
int iDeb[MAXN], iFin[MAXN];
 
void buildTree(int iNoeud, int li, int ri)
{
  iDeb[iNoeud] = li, iFin[iNoeud] = ri;
  lazyMax[iNoeud] = 0;
  lazyMin[iNoeud] = INF;
  if (li == ri)
    return;
 
  buildTree(2*iNoeud, li, (li+ri)/2);
  buildTree(2*iNoeud+1, (li+ri)/2+1, ri);
}
 
void changeMax(int iNoeud, int val)
{
  lazyMax[iNoeud] = max(lazyMax[iNoeud], val);
  lazyMin[iNoeud] = max(lazyMin[iNoeud], val);
}
 
void changeMin(int iNoeud, int val)
{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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