제출 #789534

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
789534	2023-07-21 13:17:18	OrazB	벽 (IOI14_wall)	C++14	100 / 100	868 ms	99424 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>
using namespace std;
#define ll long long int
#define pii pair <int, int>
#define ff first
#define ss second
const int N = 3e6;
const int inf = 1e9+7;
int NP, q, t[4*N][2];
void F(int l, int r, int idx){
  if (l != r){
    if (t[idx<<1][1] < t[idx][0]) t[idx<<1][0] = t[idx<<1][1] = t[idx][0];
    else if (t[idx<<1][0] > t[idx][1]) t[idx<<1][0] = t[idx<<1][1] = t[idx][1];
    else{
      t[idx<<1][0] = max(t[idx<<1][0], t[idx][0]);
      t[idx<<1][1] = min(t[idx<<1][1], t[idx][1]);
    }
    if (t[idx<<1|1][1] < t[idx][0]) t[idx<<1|1][0] = t[idx<<1|1][1] = t[idx][0];
    else if (t[idx<<1|1][0] > t[idx][1]) t[idx<<1|1][0] = t[idx<<1|1][1] = t[idx][1];
    else{
      t[idx<<1|1][0] = max(t[idx<<1|1][0], t[idx][0]);
      t[idx<<1|1][1] = min(t[idx<<1|1][1], t[idx][1]);
    }
    t[idx][0] = 0;
    t[idx][1] = inf;
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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