oj.uz

답안 #8013

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
8013 2014-08-27T05:52:01 Z lingxiang 공주님의 정원 (KOI11_flower) C++
0.5 / 18
 36 ms 1088 KB 
#include<stdio.h>
  
int N;
int date[14]={0,31,59,90,120,151,181,212,243,273,304,334,};
int T[400], D[400];
int df(int x,int y){return date[x-1]+y;}
int ans;
  
int input(){
    scanf("%d",&N);
    int a,b,c,d;
    for(int i=0;i<400;i++)T[i] = 1000;
    for(int i=0;i<N;i++){
        scanf("%d %d %d %d",&a,&b,&c,&d);
        if(T[df(c,d)]>df(a,b))T[df(c,d)]=df(a,b);
    }
    return 0;
}
  
int solve(){
    for(int i=0;i<400;i++)D[i] = 1000;
  	int ans = 1000;
  	for(int i=0;i<df(3,1);++i)D[i] = 0;
    for(int i=df(3,1);i<=df(12,31);++i)for(int j=T[i]-1;j<i;j++)if(D[i] > D[j] + 1)D[i] = D[j] + 1;
    for(int i=df(11,30);i<=df(12,31);++i)if(ans > D[i])ans = D[i];
    if(ans == 1000)ans = 0;
    return 0;
}
  
int output(){
    printf("%d",ans);
    return 0;
}

int main(){
    input();
    solve();
    output();
    return 0;
}

Subtask #1
0.5 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Incorrect 0 ms 1088 KB Output isn't correct
3 Incorrect 0 ms 1088 KB Output isn't correct
4 Incorrect 0 ms 1088 KB Output isn't correct

Subtask #2
0.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1088 KB Output isn't correct
2 Incorrect 0 ms 1088 KB Output isn't correct
3 Incorrect 0 ms 1088 KB Output isn't correct
4 Incorrect 0 ms 1088 KB Output isn't correct
5 Incorrect 0 ms 1088 KB Output isn't correct
6 Incorrect 0 ms 1088 KB Output isn't correct

Subtask #3
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1088 KB Output isn't correct
2 Incorrect 8 ms 1088 KB Output isn't correct
3 Incorrect 12 ms 1088 KB Output isn't correct
4 Incorrect 16 ms 1088 KB Output isn't correct
5 Incorrect 16 ms 1088 KB Output isn't correct
6 Incorrect 24 ms 1088 KB Output isn't correct
7 Incorrect 20 ms 1088 KB Output isn't correct
8 Incorrect 36 ms 1088 KB Output isn't correct
9 Incorrect 36 ms 1088 KB Output isn't correct
10 Incorrect 32 ms 1088 KB Output isn't correct