제출 #931

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
931	2013-05-26 02:30:25	tncks0121	공주님의 정원 (KOI11_flower)	C++98	18 / 18	157 ms	1668 KiB

flower

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 N_ 100001
int N;
int days[] = {0, 31, 59, 90,120,151,181,212,243,273,304,334,365};
int date_to_num(int m,int d){ return days[m-1] + d; }
int T[366];
int D[N_+1][2];
 
int main(){
    int i,j;
 
    scanf("%d",&N);
    for(i=1; i<=N; i++){
        int a, b, c, d; scanf("%d%d%d%d",&a,&b,&c,&d);
        D[i][0] = date_to_num(a,b);
        D[i][1] = date_to_num(c,d);
    }
 
    for(i=60; i<=334; i++){
        for(j=1; j<=N; j++){
            if(D[j][0] <= i && i < D[j][1]){
                if(T[i] > T[D[j][0]-1] + 1 || !T[i]) T[i] = T[D[j][0]-1] + 1;
            }
        }
    }
 
    printf("%d\n",T[334]);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1.8 / 2
• Subtask 2: 7.2 / 7
• Subtask 3: 9 / 9