Submission #7947

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
7947	2014-08-26 11:59:13	lingxiang	공주님의 정원 (KOI11_flower)	C++98	13.37 / 18	1000 ms	1088 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 date[14]={0,31,59,90,120,151,181,212,243,273,304,334,};
int T[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<N;i++){
    scanf("%d %d %d %d",&a,&b,&c,&d);
    if(T[df(a,b)]<df(c,d))T[df(a,b)]=df(c,d);
  }
  return 0;
}
int solve(){
  int mi=0;
  int max=0;
  for(int i=0;i<df(3,1);i++){
    if(T[i]>max){mi=i,max=T[i];}
  }
  int ni=0,nmax=0;
  while(nmax<df(11,30)){
    for(int i=mi;i<=max;i++){
      if(T[i]>nmax){ni=i,nmax=T[i];}
    }
    ans++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1.5 / 2
• Subtask 2: 4.667 / 7
• Subtask 3: 7.2 / 9