Submission #7607

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
7607	2014-08-12 13:42:00	dohyun0324	Wall (IOI14_wall)	C++98	100 / 100	940 ms	49496 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>
using namespace std;
int c=1;
struct data
{
    int mini,maxi;
}tree[4194400];
void spread(int k)
{
    if(tree[k*2].mini<tree[k].mini)
    {
        tree[k*2].mini=tree[k].mini;
        tree[k*2].maxi=max(tree[k*2].maxi,tree[k*2].mini);
    }
    if(tree[k*2].maxi>tree[k].maxi)
    {
        tree[k*2].maxi=tree[k].maxi;
        tree[k*2].mini=min(tree[k*2].mini,tree[k*2].maxi);
    }
    if(tree[k*2+1].mini<tree[k].mini)
    {
        tree[k*2+1].mini=tree[k].mini;
        tree[k*2+1].maxi=max(tree[k*2+1].maxi,tree[k*2+1].mini);
    }
    if(tree[k*2+1].maxi>tree[k].maxi)
    {
        tree[k*2+1].maxi=tree[k].maxi;
        tree[k*2+1].mini=min(tree[k*2+1].mini,tree[k*2+1].maxi);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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