oj.uz

Submission #16849

# Submission time Handle Problem Language Result Execution time Memory
16849 2015-10-22T07:25:24 Z hjk0553 수족관 1 (KOI13_aqua1) C
100 / 100
 12 ms 1120 KB 
#include<stdio.h>
#define Mn 5000
#define INF 40000
struct aqua
{
    int height;
    int count;
    int x;
    int y;
} data[Mn/2+1];
void process()
{
    int i;
    int j;
    int edgecount;
    int holeindex;
    int xedge1,yedge1,xedge2,yedge2;
    int holecount;
    int xhole,yhole;
    int minheight;
    int ans=0;
    scanf("%d",&edgecount);
    scanf("%d %d",&xedge1,&yedge1);
    for(i=1;i<edgecount/2;i++)
    {
        scanf("%d %d %d %d",&xedge1,&yedge1,&xedge2,&yedge2);
        data[i].count=xedge2-xedge1;
        data[i].x=xedge1;
        data[i].y=yedge1;
    }
    scanf("%d %d",&xedge1,&yedge1);
    scanf("%d",&holecount);
    for(i=1;i<=holecount;i++)
    {
        scanf("%d %d %d %d",&xhole,&yhole,&xedge1,&yedge1);
        int l=1,r=edgecount/2-1,m;
        while(l<=r)
        {
            m=(l+r)/2;
            if(data[m].x==xhole && data[m].y==yhole) break;
            if(xhole!=data[m].x)
            {
                if(xhole<data[m].x) r=m-1;
                    else l=m+1;
            }
            else if(yhole!=data[m].y)
            {
                if(yhole<data[m].y) r=m-1;
                    else l=m+1;
            }
        }
        holeindex=m;
        minheight=INF;
        for(j=holeindex;j>=1;j--)
        {
            if(minheight>data[j].y) minheight=data[j].y;
            if(data[j].height<minheight) data[j].height = minheight;
        }
        minheight=INF;
        for(j=holeindex;j<edgecount/2;j++)
        {
            if(minheight>data[j].y) minheight=data[j].y;
            if(data[j].height<minheight) data[j].height = minheight;
        }
    }
    for(i=1;i<edgecount/2;i++)
    {
        ans+=(data[i].y-data[i].height)*data[i].count;
    }
    printf("%d",ans);
}
int main()
{
    process();
    return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1120 KB Output is correct
2 Correct 0 ms 1120 KB Output is correct
3 Correct 0 ms 1120 KB Output is correct
4 Correct 0 ms 1120 KB Output is correct
5 Correct 0 ms 1120 KB Output is correct
6 Correct 0 ms 1120 KB Output is correct
7 Correct 0 ms 1120 KB Output is correct
8 Correct 0 ms 1120 KB Output is correct
9 Correct 0 ms 1120 KB Output is correct
10 Correct 0 ms 1120 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1120 KB Output is correct
2 Correct 0 ms 1120 KB Output is correct
3 Correct 0 ms 1120 KB Output is correct
4 Correct 0 ms 1120 KB Output is correct
5 Correct 0 ms 1120 KB Output is correct
6 Correct 0 ms 1120 KB Output is correct
7 Correct 0 ms 1120 KB Output is correct
8 Correct 0 ms 1120 KB Output is correct
9 Correct 0 ms 1120 KB Output is correct
10 Correct 0 ms 1120 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1120 KB Output is correct
2 Correct 0 ms 1120 KB Output is correct
3 Correct 0 ms 1120 KB Output is correct
4 Correct 0 ms 1120 KB Output is correct
5 Correct 0 ms 1120 KB Output is correct
6 Correct 0 ms 1120 KB Output is correct
7 Correct 0 ms 1120 KB Output is correct
8 Correct 0 ms 1120 KB Output is correct
9 Correct 0 ms 1120 KB Output is correct
10 Correct 0 ms 1120 KB Output is correct

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1120 KB Output is correct
2 Correct 6 ms 1120 KB Output is correct
3 Correct 9 ms 1120 KB Output is correct
4 Correct 9 ms 1120 KB Output is correct
5 Correct 8 ms 1120 KB Output is correct
6 Correct 8 ms 1120 KB Output is correct
7 Correct 12 ms 1120 KB Output is correct
8 Correct 6 ms 1120 KB Output is correct
9 Correct 5 ms 1120 KB Output is correct
10 Correct 0 ms 1120 KB Output is correct