제출 #623362

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
623362	2022-08-05 13:53:18	M_W	벽 (IOI14_wall)	C++17	100 / 100	844 ms	132132 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 <bits/stdc++.h>
#include "wall.h"
#define ii pair<int, int>
using namespace std;
int t[2000002 << 2][2], lazy[2000002 << 2][2]; // lower, upper
void push(int v){
    // Do something
    if(lazy[v][0] == 0 && lazy[v][1] == INT_MAX) return;
    t[v * 2][0] = max(t[v * 2][0], lazy[v][0]);
    t[v * 2 + 1][0] = max(t[v * 2 + 1][0], lazy[v][0]);
    t[v * 2][1] = max(t[v * 2][1], lazy[v][0]);
    t[v * 2 + 1][1] = max(t[v * 2 + 1][1], lazy[v][0]);
    lazy[v * 2][0] = max(lazy[v * 2][0], lazy[v][0]);
    lazy[v * 2 + 1][0] = max(lazy[v * 2 + 1][0], lazy[v][0]);
    lazy[v * 2][1] = max(lazy[v * 2][1], lazy[v][0]);
    lazy[v * 2 + 1][1] = max(lazy[v * 2 + 1][1], lazy[v][0]);
    t[v * 2][0] = min(t[v * 2][0], lazy[v][1]);
    t[v * 2 + 1][0] = min(t[v * 2 + 1][0], lazy[v][1]);
    t[v * 2][1] = min(t[v * 2][1], lazy[v][1]);
    t[v * 2 + 1][1] = min(t[v * 2 + 1][1], lazy[v][1]);
    lazy[v * 2][0] = min(lazy[v * 2][0], lazy[v][1]);
    lazy[v * 2 + 1][0] = min(lazy[v * 2 + 1][0], lazy[v][1]);
    lazy[v * 2][1] = min(lazy[v * 2][1], lazy[v][1]);
    lazy[v * 2 + 1][1] = min(lazy[v * 2 + 1][1], lazy[v][1]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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