Submission #480656

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
480656	2021-10-17 14:16:28	Haidara	Wall (IOI14_wall)	C++17	100 / 100	1063 ms	99328 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 v(i) vector< i >
using namespace std;
const int maxn=2000001;
int n;
const int inf=INT_MAX;
struct node
{
    int mx,mn;
    node():mx(inf),mn(0) {}
} st[maxn*4];
void pull(int inx)
{
    st[inx*2].mn=max(st[inx].mn,min(st[inx*2].mn,st[inx].mx));
    st[inx*2].mx=min(st[inx].mx,max(st[inx*2].mx,st[inx].mn));
    st[inx*2+1].mn=max(st[inx].mn,min(st[inx*2+1].mn,st[inx].mx));
    st[inx*2+1].mx=min(st[inx].mx,max(st[inx*2+1].mx,st[inx].mn));
    st[inx].mn=0,st[inx].mx=inf;
}
bool go;
void add(int ql,int qr,int val,int l=0,int r=n-1,int inx=1)
{
    if(ql<=l&&r<=qr)
    {
        if(go)
        {
            st[inx].mn=max(st[inx].mn,val);
            st[inx].mx=max(st[inx].mx,val);
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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