Submission #12898

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
12898	2015-01-19 06:15:30	baneling100	수족관 1 (KOI13_aqua1)	C++98	100 / 100	4 ms	1192 KiB

aqua1

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 <stdio.h>
#define INF 0x7fffffff
struct line {
    int X1;
    int X2;
    int Y;
    int Hole;
} Line[5000];
int N, K, Ans;
int divideConquer(int Left, int Right, int H) {
    int i, Min=INF, Mid, res1=0, res2=0;
    if(Left==Right) {
        if(Line[Left].Hole)
            return 1;
        Ans+=(Line[Left].Y-H)*(Line[Left].X2-Line[Left].X1);
        return 0;
    }
    else {
        for(i=Left ; i<=Right ; i++)
            if(Min>Line[i].Y) {
                Min=Line[i].Y;
                Mid=i;
            }
        if(Left<=Mid-1)
            res1=divideConquer(Left ,Mid-1,Min);
        if(Mid+1<=Right)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 23 / 23
• Subtask 2: 19 / 19
• Subtask 3: 22 / 22
• Subtask 4: 36 / 36