Submission #738969

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
738969	2023-05-09 17:49:23	shoryu386	Wall (IOI14_wall)	C++17	61 / 100	840 ms	36584 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"
using namespace std;
using ll = long long;
#define llINF (LLONG_MAX/10)
const int MAXN = 200001;  // 1-based
int N;
ll A[MAXN];
struct Node {
  ll sum;  // Sum tag
  ll max1;  // Max value
  ll max2;  // Second Max value
  ll maxc;  // Max value count
  ll min1;  // Min value
  ll min2;  // Second Min value
  ll minc;  // Min value count
  ll lazy;  // Lazy tag
} T[MAXN * 4];
void merge(int t) {
  // sum
  T[t].sum = T[t << 1].sum + T[t << 1 | 1].sum;
  // max
  if (T[t << 1].max1 == T[t << 1 | 1].max1) {
    T[t].max1 = T[t << 1].max1;
    T[t].max2 = max(T[t << 1].max2, T[t << 1 | 1].max2);
    T[t].maxc = T[t << 1].maxc + T[t << 1 | 1].maxc;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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