l,M,x[100],y[100],X,i,c,*P,*Q;main(j,p,q){scanf("%*d%d%d",&l,&M);for(P=x,Q=y;~scanf("%d%d",P++,Q++););for(i=0;i<M;i++){for(j=0;j<M;j++){for(p=1;p<l/2;p++){for(c=q=0;q<M;q++)(x[i]>x[q]||x[q]>x[i]+p||y[j]>y[q]||y[q]>y[j]+l/2-p)||++c>X&&(X=c);}}}printf("%d",X);}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
4 ms |
1088 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
1088 KB |
Output is correct |
2 |
Correct |
12 ms |
1088 KB |
Output is correct |
3 |
Correct |
32 ms |
1088 KB |
Output is correct |
4 |
Correct |
52 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
84 ms |
1088 KB |
Output is correct |
3 |
Correct |
76 ms |
1088 KB |
Output is correct |
4 |
Correct |
72 ms |
1088 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
136 ms |
1088 KB |
Output is correct |
2 |
Correct |
68 ms |
1088 KB |
Output is correct |
3 |
Correct |
96 ms |
1088 KB |
Output is correct |
4 |
Correct |
132 ms |
1088 KB |
Output is correct |