# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159710 | geon040702 | 고기잡이 (KOI13_fish) | C++14 | 132 ms | 508 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define inside(a, b, c) ((a)<=(c) && (c)<=(b))
int X[1000], Y[1000];
int Fx[1000], Fy[1000];
int main(void)
{
int N, M, L;
int i, j, k;
int w, h, cnt;
int res = 0;
scanf("%d %d %d", &N, &L, &M);
for (i = 0 ; i < M ; i++) {
scanf("%d %d", &Fx[i], &Fy[i]);
X[i] = Fx[i];
Y[i] = Fy[i];
}
std::sort(X, X+M);
std::sort(Y, Y+M);
L /= 2;
for (w = 1 ; w < L ; w++) {
h = L - w;
for (i = 0 ; i < M ; i++) {
for (j = 0 ; j < M ; j++) {
cnt = 0;
for (k = 0 ; k < M ; k++) {
if (inside(X[i], X[i] + w, Fx[k]) && inside(Y[j], Y[j] + h, Fy[k]))
cnt++;
}
if(res < cnt)
res = cnt;
}
}
}
printf("%d", res);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |