# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
35361 | gabrielsimoes | Cultivation (JOI17_cultivation) | C++14 | 2000 ms | 2020 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;
const int MAXR = 42;
const int INF = 1e9 + 10;
typedef pair<int, int> pii;
#define x first
#define y second
int R, C, n;
vector<pii> v;
int main() {
scanf("%d %d %d", &R, &C, &n);
assert(R <= 40 && C <= 40);
for (int i = 0, x, y; i < n; i++) {
scanf("%d %d", &x, &y);
v.push_back(pii(x, y));
}
int ans = INF;
for (int a = 0; a < 40; a++) {
for (int b = 0; b < 40; b++) {
for (int c = 0; c < 40; c++) {
for (int d = 0; d < 40; d++) {
bool bad = 0;
for (int x = 1; x <= R && !bad; x++) {
for (int y = 1; y <= C; y++) {
bool ok = 0;
for (pii p : v) {
if (((p.x < x && x - p.x <= a) || (p.x >= x && p.x - x <= b)) &&
((p.y < y && y - p.y <= c) || (p.y >= y && p.y - y <= d)))
ok = 1;
}
if (!ok) {
bad = 1;
break;
}
}
}
if (!bad) ans = min(ans, a + b + c + d);
}
}
}
}
printf("%d\n", ans);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |