답안 #1043935

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1043935	2024-08-05T04:46:15 Z	AC2K	산악 구조대 (JOI13_mountain)	C++17	0 / 100	4 ms	1372 KB

mountain

#include <bits/stdc++.h>

#include "grader.h"

using namespace std;

void Rescue(int R, int C, int RS, int CS, int X) {
    int upper = max(RS - 1, R - RS) + max(CS - 1, C - CS), lower = 0;

    vector<vector<pair<int,int>>> points(upper + 1);
    for (int i = 1; i <= R; ++i) {
        for (int j = 1; j <= C; ++j) {
            points[abs(i - RS) + abs(j - CS)].emplace_back(i, j);
        }
    }

    auto calc = [&](int d) {
        int res = 1e9;

        for (auto [i, j] : points[d]) {
            if (j <= 0 || j > C) continue;

            int H = Measure(i, j);
            if (H == X) {
                Pinpoint(i, j);
                return -1;
            }
            res = min(res, H);
        }

        return res;
    };

    if (calc(upper) == -1) return;
    if (calc(lower) == -1) return;

    while (upper - lower > 1) {
        int mid = (upper + lower) / 2;
        int H = calc(mid);
        if (H == -1) return;
        (H >= X ? lower : upper) = mid;
    }

    if (calc(lower) == -1) return;
    if (calc(upper) == -1) return;
}

Subtask #1

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	436 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	436 KB	Output is correct
19	Correct	0 ms	440 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	436 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	436 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	440 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	440 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	0 ms	348 KB	Output is correct
72	Correct	0 ms	348 KB	Output is correct
73	Correct	0 ms	348 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct
75	Correct	0 ms	348 KB	Output is correct
76	Correct	0 ms	348 KB	Output is correct
77	Correct	0 ms	348 KB	Output is correct
78	Correct	0 ms	348 KB	Output is correct
79	Correct	0 ms	348 KB	Output is correct
80	Correct	0 ms	348 KB	Output is correct
81	Correct	0 ms	348 KB	Output is correct
82	Correct	1 ms	348 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	0 ms	348 KB	Output is correct
85	Correct	0 ms	348 KB	Output is correct
86	Correct	0 ms	348 KB	Output is correct
87	Correct	0 ms	348 KB	Output is correct
88	Correct	0 ms	348 KB	Output is correct
89	Correct	0 ms	348 KB	Output is correct
90	Correct	0 ms	348 KB	Output is correct
91	Correct	0 ms	348 KB	Output is correct
92	Correct	0 ms	440 KB	Output is correct
93	Correct	0 ms	600 KB	Output is correct
94	Correct	0 ms	348 KB	Output is correct
95	Correct	0 ms	348 KB	Output is correct
96	Correct	0 ms	348 KB	Output is correct
97	Correct	0 ms	348 KB	Output is correct
98	Incorrect	1 ms	476 KB	Wrong Answer [5]
99	Halted	0 ms	0 KB	-

Subtask #2

0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	1372 KB	Wrong Answer [2]
2	Halted	0 ms	0 KB	-