oj.uz

Submission #372717

# Submission time Handle Problem Language Result Execution time Memory
372717 2021-03-01T11:04:15 Z hoanghq2004 산악 구조대 (JOI13_mountain) C++17
0 / 100
 9 ms 2028 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

int height[210][210];

int ask(int i, int j, int X) {
    if (height[i][j] != -1) return height[i][j];
    height[i][j] = Measure(i, j);
    if (height[i][j] == X) Pinpoint(i, j);
    return height[i][j];
}

void check(int x, int y, int u, int v, int RS, int CS, int X) {
    map <int, vector <pair <int, int> > > mp;
    vector <pair <int, int> > block[210 * 210];
    for (int i = x; i <= u; ++i) {
        for (int j = y; j <= v; ++j) {
            mp[abs(i - RS) + abs(j - CS)].push_back({i, j});
        }
    }
    int sz = 0;
    for (auto [id, vcell]: mp) block[sz++] = vcell;

    int L = 0, R = sz - 1;
    while (R - L > 1) {
        int mid = (L + R) / 2;
        if (ask(block[mid].front().first, block[mid].front().second, X) < X) R = mid;
        else L = mid;
    }
    for (auto [i, j]: block[L]) ask(i, j, X);
    for (auto [i, j]: block[R]) ask(i, j, X);
}

void Rescue(int n, int m, int RS, int CS, int X) {
    memset(height, -1, sizeof(height));
    check(1, 1, RS, CS, RS, CS, X);
    check(RS + 1, CS + 1, n, m, RS, CS, X);
    check(1, CS + 1, RS, m, RS, CS, X);
    check(RS + 1, 1, n, CS, RS, CS, X);
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 80.0

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