Submission #8004

#	Time	Username	Problem	Language	Result	Execution time	Memory
8004		lingxiang	공주님의 정원 (KOI11_flower)	C++98	0 / 18	36 ms	1084 KiB

flower

#include<stdio.h>
  
int N;
int date[14]={0,31,59,90,120,151,181,212,243,273,304,334,};
int T[400], D[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<400;i++)T[i] = 1000;
    for(int i=0;i<N;i++){
        scanf("%d %d %d %d",&a,&b,&c,&d);
        if(T[df(c,d)]>df(a,b))T[df(c,d)]=df(a,b);
    }
    return 0;
}
  
int solve(){
    for(int i=0;i<400;i++)D[i] = 1000;
    for(int i=df(3,1);i<=df(11,30);++i)for(int j=T[i]-1;j>i;j++)if(D[j] < D[i] + 1)D[j] = D[i] + 1;
    ans = (D[df(11,30)] == 1000 ? 0 : D[df(11,30)]);
    return 0;
}
  
int output(){
    printf("%d",ans);
    return 0;
}

int main(){
    input();
    solve();
    output();
    return 0;
}

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