제출 #7730

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
7730	2014-08-17 05:20:07	gs14004	공주님의 정원 (KOI11_flower)	C++98	18 / 18	72 ms	1864 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
#include <cstdio>
int day(int m,int d){
    return d+(m-1)*30+(m==2)-(m==3)+(m>5)+(m>7)+(m>8)+(m>10);
}
int main(){
    int n,p,q,r,s;
    scanf("%d",&n);
    int a[n],b[n];
    for (int i=0; i<n; i++) {
        scanf("%d %d %d %d",&p,&q,&r,&s);
        a[i]=day(p,q);
        b[i]=day(r,s);
    }
    r=0;
    // a[i] ~ b[i]-1. flower in
    int now=s=day(3,1);
    while (now<=day(11,30)) {
        for (int i=0; i<n; i++) {
            if(a[i]<=now && s<b[i]) s=b[i];
        }
        if(s==now){
            printf("0");
            return 0;
        }
        now=s;
        r++;
    }
    printf("%d",r);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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