Submission #219286

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
219286	2020-04-05T03:28:38 Z	EntityIT	산악 구조대 (JOI13_mountain)	C++14	0 / 100	18 ms	1408 KB

mountain

#include<bits/stdc++.h>
using namespace std;

#include "grader.h"

#define all(x) (x).begin(), (x).end()
#define sz(x) ( (int)(x).size() )
using LL = long long;

mt19937 rng( (uint32_t)chrono::steady_clock::now().time_since_epoch().count() );

void Rescue(int R, int C, int RS, int CS, int X) {
    vector<vector<pair<int, int> > > group;
    for (int i = 1; i <= R; ++i) {
        for (int j = 1; j <= C; ++j) {
            int dist = abs(i - RS) + abs(j - CS);
            while (sz(group) <= dist) group.emplace_back(vector<pair<int, int> >() );
            group[dist].emplace_back(i, j);
        }
    }

    int l = 0, r = sz(group) - 1;
    while (l < r) {
        int mid = (l + r + 1) >> 1;
        if (Measure(group[mid].back().first, group[mid].back().second) >= X) l = mid;
        else r = mid - 1;
    }

    for (const auto &i : group[l]) {
        if (Measure(i.first, i.second) == X) {
            Pinpoint(i.first, i.second);
            return ;
        }
    }
    for (const auto &i : group[l + 1]) {
        if (Measure(i.first, i.second) == X) {
            Pinpoint(i.first, i.second);
            return ;
        }
    }
}

Subtask #1

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	6 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	6 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	6 ms	384 KB	Output is correct
18	Correct	6 ms	384 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	256 KB	Output is correct
24	Correct	6 ms	388 KB	Output is correct
25	Correct	5 ms	256 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	256 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	256 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	404 KB	Output is correct
33	Correct	6 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	5 ms	384 KB	Output is correct
36	Correct	5 ms	416 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Correct	5 ms	384 KB	Output is correct
39	Correct	5 ms	384 KB	Output is correct
40	Correct	5 ms	384 KB	Output is correct
41	Correct	5 ms	384 KB	Output is correct
42	Correct	5 ms	384 KB	Output is correct
43	Correct	5 ms	384 KB	Output is correct
44	Correct	5 ms	384 KB	Output is correct
45	Correct	5 ms	384 KB	Output is correct
46	Incorrect	5 ms	256 KB	Wrong Answer [5]
47	Halted	0 ms	0 KB	-

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	18 ms	1408 KB	Wrong Answer [5]
2	Halted	0 ms	0 KB	-