제출 #927949

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
927949	2024-02-15 14:30:06	TAhmed33	벽 (IOI14_wall)	C++98	100 / 100	855 ms	57940 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 mid ((l + r) >> 1)
#define tl (node + 1)
#define tr (node + 2 * (mid - l + 1))
void chmin (int &x, int y) {
  x = min(x, y);
}
void chmax(int &x, int y) {
  x = max(x, y);
}
struct pp {
  int mx = 0, mn = 1e9;
};
struct SegmentTree {
  vector <pp> tree;
  void prop (int l, int r, int node) {
    if (l == r) return;
    chmin(tree[tl].mn, tree[node].mn);
    chmax(tree[tl].mn, tree[node].mx);
    chmax(tree[tl].mx, tree[node].mx);
    chmin(tree[tl].mx, tree[node].mn);
    chmin(tree[tr].mn, tree[node].mn);
    chmax(tree[tr].mn, tree[node].mx);
    chmax(tree[tr].mx, tree[node].mx);
    chmin(tree[tr].mx, tree[node].mn);
    tree[node].mn = 1e9; tree[node].mx = 0;
  }
  void update (int l, int r, int a, int b, int h, int t, int node) {
    prop(l, r, node);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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