Submission #8002

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
80022014-08-27 05:35:42lingxiang공주님의 정원 (KOI11_flower)C++98
3.97 / 18
36 ms1088 KiB
#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];}
}
ans += (max >= df(3,1));
int ni=0,nmax=max;
while(nmax<df(11,30)){
for(int i=mi;i<=max+1;i++){
if(T[i]>nmax){ni=i,nmax=T[i];}
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...