#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++;
}
int ni=0,nmax=max;
while(nmax<df(11,30)){
for(int i=mi;i<=max;i++){
if(T[i]>nmax){ni=i,nmax=T[i];}
}
if(max>=nmax){
ans=0;
return 0;
}
ans++;
mi=ni;
max=nmax;
}
return 0;
}
int output(){
printf("%d",ans);
return 0;
}
int main(){
input();
solve();
output();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
1088 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
1088 KB |
Output isn't correct |
2 |
Incorrect |
4 ms |
1088 KB |
Output isn't correct |
3 |
Incorrect |
12 ms |
1088 KB |
Output isn't correct |
4 |
Incorrect |
8 ms |
1088 KB |
Output isn't correct |
5 |
Incorrect |
12 ms |
1088 KB |
Output isn't correct |
6 |
Incorrect |
24 ms |
1088 KB |
Output isn't correct |
7 |
Incorrect |
24 ms |
1088 KB |
Output isn't correct |
8 |
Incorrect |
36 ms |
1088 KB |
Output isn't correct |
9 |
Incorrect |
28 ms |
1088 KB |
Output isn't correct |
10 |
Incorrect |
28 ms |
1088 KB |
Output isn't correct |