Submission #16256

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
16256	2015-08-19 02:34:55	CodingBug	Wall (IOI14_wall)	C++98	100 / 100	1254 ms	141720 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 "wall.h"
#include <algorithm>
#include <stdio.h>
using namespace std;
struct Node{
    int mn,mx;
    Node *chi[2];
};
Node *r;
void updateTree(int s,int e,Node *no,int ss,int ee,int k,bool m){
    if(ss<=s && e<=ee){
        if(m){
            no->mx=min(no->mx,k);
            no->mn=min(no->mn,no->mx);
        }
        else{
            no->mn=max(no->mn,k);
            no->mx=max(no->mx,no->mn);
        }
        return;
    }
    if(e<ss || ee<s) return;
    int mid=(s+e)/2;
    if(no->chi[0]==NULL) no->chi[0]=new Node();
    if(no->chi[1]==NULL) no->chi[1]=new Node();
    for(int i=0;i<2;i++){
        no->chi[i]->mn=max(min(no->chi[i]->mn,no->mx),no->mn);
        no->chi[i]->mx=min(max(no->chi[i]->mx,no->mn),no->mx);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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