oj.uz

답안 #16243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
16243 2015-08-18T11:18:54 Z eaststar 수족관 1 (KOI13_aqua1) C++14
100 / 100
 2 ms 1268 KB 
#include <stdio.h>
struct data{
    int x,y,h;
}a[2510];
int chk[40010],t,ans;
int main(){
    int i,n,k,x,y;
    scanf("%d",&n);
    for(i=1,n/=2;i<=n;++i)scanf("%d%d%d%d",&x,&y,&a[i].x,&a[i].y);
    scanf("%d",&k);
    for(i=1;i<=k;++i)scanf("%d%d%d%d",&x,&y,&y,&y),chk[x]=1;
    for(i=1;i<=n;++i)a[i].h=chk[a[i].x];
    for(i=1;i<=n;++i){
        x=a[i].x;
        while(t&&a[t].y>a[i].y){
            if(a[t-1].y>=a[i].y){
                if(a[t].h)a[t-1].h=1;
                else ans+=(a[i].x-a[t].x)*(a[t].y-a[t-1].y);
            }
            else{
                if(a[t].h)a[i].h=1;
                else ans+=(a[i].x-a[t].x)*(a[t].y-a[i].y);
                a[i].x=a[t].x;
            }
            --t;
        }
        if(a[t].y==a[i].y)a[t].h|=a[i].h;
        else a[++t]=a[i];
    }
    printf("%d",ans);
    return 0;
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1268 KB Output is correct
2 Correct 0 ms 1268 KB Output is correct
3 Correct 0 ms 1268 KB Output is correct
4 Correct 0 ms 1268 KB Output is correct
5 Correct 0 ms 1268 KB Output is correct
6 Correct 0 ms 1268 KB Output is correct
7 Correct 0 ms 1268 KB Output is correct
8 Correct 0 ms 1268 KB Output is correct
9 Correct 0 ms 1268 KB Output is correct
10 Correct 0 ms 1268 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1268 KB Output is correct
2 Correct 0 ms 1268 KB Output is correct
3 Correct 0 ms 1268 KB Output is correct
4 Correct 0 ms 1268 KB Output is correct
5 Correct 0 ms 1268 KB Output is correct
6 Correct 0 ms 1268 KB Output is correct
7 Correct 0 ms 1268 KB Output is correct
8 Correct 0 ms 1268 KB Output is correct
9 Correct 0 ms 1268 KB Output is correct
10 Correct 0 ms 1268 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1268 KB Output is correct
2 Correct 0 ms 1268 KB Output is correct
3 Correct 0 ms 1268 KB Output is correct
4 Correct 0 ms 1268 KB Output is correct
5 Correct 0 ms 1268 KB Output is correct
6 Correct 0 ms 1268 KB Output is correct
7 Correct 0 ms 1268 KB Output is correct
8 Correct 0 ms 1268 KB Output is correct
9 Correct 0 ms 1268 KB Output is correct
10 Correct 0 ms 1268 KB Output is correct

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1268 KB Output is correct
2 Correct 0 ms 1268 KB Output is correct
3 Correct 0 ms 1268 KB Output is correct
4 Correct 0 ms 1268 KB Output is correct
5 Correct 0 ms 1268 KB Output is correct
6 Correct 0 ms 1268 KB Output is correct
7 Correct 0 ms 1268 KB Output is correct
8 Correct 2 ms 1268 KB Output is correct
9 Correct 0 ms 1268 KB Output is correct
10 Correct 0 ms 1268 KB Output is correct