# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
372672 | two_sides | 산악 구조대 (JOI13_mountain) | C++17 | 9 ms | 492 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>
#include "grader.h"
using namespace std;
void Rescue(int r, int c, int rs, int cs, int x) {
int lim = max({rs + cs - 2, rs - 1 + c - cs,
r - rs + cs - 1, r - rs + c - cs});
auto getRand = [&](int d) {
if (d < 0) return INT_MAX;
if (d > lim) return INT_MIN;
for (int i = 1; i <= r; i++)
for (int j = 1; j <= c; j++)
if (abs(i - rs) + abs(j - cs) == d)
return Measure(i, j);
};
int curd;
for (int i = lim; i > 0; i--)
if (getRand(i + 1) < x) curd = i;
else break;
int ma = INT_MIN;
for (int i = 1; i <= r; i++)
for (int j = 1; j <= c; j++)
if (abs(i - rs) + abs(j - rs) == curd) {
int val = Measure(i, j);
if (val == x) {
Pinpoint(i, j); return;
}
ma = max(ma, val);
}
if (ma < x) curd--; else curd++;
for (int i = 1; i <= r; i++)
for (int j = 1; j <= c; j++)
if (abs(i - rs) + abs(j - rs) == curd) {
int val = Measure(i, j);
if (val == x) {
Pinpoint(i, j); return;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |