제출 #41275

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
41275	2018-02-15 10:25:38	SecretAgent007	Wall (IOI14_wall)	C++14	100 / 100	715 ms	262144 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<algorithm>
#include<cstdio>
#include "wall.h"
using namespace std;
const int maxn=2000000+5;
const int INF=(1<<30);
int Max[maxn*6],Min[maxn*6];
inline void add(int id,int val)
{
    if(Max[id]==-1) Min[id]=max(Min[id],val);
    else if(val>=Max[id]) Min[id]=val,Max[id]=-1;
    else if(val>=Min[id]) Min[id]=val;
}
inline void remove(int id,int val)
{
    if(Max[id]==-1) Min[id]=min(Min[id],val);
    else if(val<=Min[id]) Min[id]=val,Max[id]=-1;
    else if(val<=Max[id]) Max[id]=val;
}
inline void push(int id)
{
    if(Max[id]==-1)
    {
        Max[id*2]=Max[id*2+1]=-1;
        Min[id*2]=Min[id*2+1]=Min[id];
        Max[id]=INF,Min[id]=0;
        return;
    }
    if(Min[id]!=0) { add(id*2,Min[id]); add(id*2+1,Min[id]);}
    if(Max[id]!=INF) { remove(id*2,Max[id]); remove(id*2+1,Max[id]); }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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