Submission #16247

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
16247	2015-08-18 11:22:12	eaststar	공주님의 정원 (KOI11_flower)	C++14	18 / 18	82 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
30
#include<stdio.h>   
int n;   
int months[100]={0,31,28,31,30,31,30,31,31,30,31,30,31};   
struct A {   
    int start,end;   
};   
int days(int month,int day) {   
    int i;   
    int sum=0;   
    for(i=1;i<month;i++) sum+=months[i];   
    return sum+day;   
}   
A flowers[100011];   
int main() {
    scanf("%d",&n);   
    int i,j;   
    for(i=1;i<=n;i++) {   
        int s,e,ss,ee;   
        scanf("%d%d%d%d",&s,&e,&ss,&ee);   
        flowers[i].start = days(s,e);   
        flowers[i].end = days(ss,ee)-1;   
    }   
    int tear=0;   
    for(i=1;i<=n;i++) {   
        if(flowers[i].start <= days(3,1) && tear < flowers[i].end) {   
            tear=flowers[i].end;   
        }   
    }   
    if(tear == 0) {   
        printf("0");   
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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