oj.uz

Submission #950867

# Submission time Handle Problem Language Result Execution time Memory
950867 2024-03-20T20:55:00 Z blackslex Mecho (IOI09_mecho) C++17
64 / 100
 159 ms 6500 KB 
#include<bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;
using tp = tuple<int, int, int>;

const int cd[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};
int n, s, sx, sy, tx, ty;

int main() {
    scanf("%d %d", &n, &s);
    vector<string> c(n + 5);
    for (int i = 1; i <= n; i++) cin >> c[i], c[i] = " " + c[i];
    queue<pii> q;
    vector<vector<int>> d(n + 5, vector<int>(n + 5, 1e9));
    vector<vector<bool>> f(n + 5, vector<bool>(n + 5));
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (c[i][j] == 'M') sx = i, sy = j; else if (c[i][j] == 'H') d[i][j] = 0, q.emplace(i, j); else if (c[i][j] == 'D') tx = i, ty = j;
    while (!q.empty()) {
        auto [x, y] = q.front(); q.pop();
        if (f[x][y]) continue; f[x][y] = 1;
        for (int i = 0; i < 4; i++) {
            int nx = x + cd[i][0], ny = y + cd[i][1];
            if (nx <= 0 || nx > n || ny <= 0 || ny > n || c[nx][ny] == 'T') continue;
            if (d[nx][ny] > d[x][y] + 1) d[nx][ny] = d[x][y] + 1, q.emplace(nx, ny);
        }
    }
    auto bs = [&] (int val) {
        vector<vector<int>> d2(n + 5, vector<int>(n + 5, 1e9));
        vector<vector<bool>> f2(n + 5, vector<bool>(n + 5));
        queue<tp> cq; d2[sx][sy] = val; cq.emplace(sx, sy, 0);
        while (!cq.empty()) {
            auto [x, y, t] = cq.front(); cq.pop();
            if (f2[x][y]) continue; f2[x][y] = 1;
            int nt = t + 1, nts = (t + 1) % s;
            for (int i = 0; i < 4; i++) {
                int nx = x + cd[i][0], ny = y + cd[i][1];
                if (nx <= 0 || nx > n || ny <= 0 || ny > n || c[nx][ny] == 'T') continue;
                if (!nts) d2[nx][ny] = d2[x][y] + 1;
                else d2[nx][ny] = d2[x][y];
                if (d2[nx][ny] < d[nx][ny]) cq.emplace(nx, ny, nt);
            }
        }
        return d2[tx][ty] != 1e9;
    };
    int l = 0, r = 1e5, ans = -1;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (bs(mid)) ans = mid, l = mid + 1;
        else r = mid - 1;
    }
    printf("%d", ans);
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:20:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   20 |         if (f[x][y]) continue; f[x][y] = 1;
      |         ^~
mecho.cpp:20:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   20 |         if (f[x][y]) continue; f[x][y] = 1;
      |                                ^
mecho.cpp: In lambda function:
mecho.cpp:33:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   33 |             if (f2[x][y]) continue; f2[x][y] = 1;
      |             ^~
mecho.cpp:33:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   33 |             if (f2[x][y]) continue; f2[x][y] = 1;
      |                                     ^~
mecho.cpp: In function 'int main()':
mecho.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d", &n, &s);
      |     ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
64.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 104 ms 6464 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 5 ms 1628 KB Output is correct
34 Correct 5 ms 1628 KB Output is correct
35 Correct 22 ms 1672 KB Output is correct
36 Correct 6 ms 1884 KB Output is correct
37 Correct 6 ms 2008 KB Output is correct
38 Correct 32 ms 1884 KB Output is correct
39 Incorrect 8 ms 2392 KB Output isn't correct
40 Correct 8 ms 2304 KB Output is correct
41 Correct 47 ms 2652 KB Output is correct
42 Incorrect 13 ms 2652 KB Output isn't correct
43 Correct 9 ms 2652 KB Output is correct
44 Correct 50 ms 2652 KB Output is correct
45 Incorrect 19 ms 3324 KB Output isn't correct
46 Correct 12 ms 3164 KB Output is correct
47 Correct 77 ms 3340 KB Output is correct
48 Incorrect 23 ms 3892 KB Output isn't correct
49 Correct 18 ms 3928 KB Output is correct
50 Correct 95 ms 3888 KB Output is correct
51 Incorrect 30 ms 4444 KB Output isn't correct
52 Incorrect 19 ms 4316 KB Output isn't correct
53 Correct 113 ms 4444 KB Output is correct
54 Incorrect 37 ms 5208 KB Output isn't correct
55 Incorrect 36 ms 5460 KB Output isn't correct
56 Correct 99 ms 5208 KB Output is correct
57 Incorrect 43 ms 5724 KB Output isn't correct
58 Incorrect 43 ms 5724 KB Output isn't correct
59 Correct 119 ms 5772 KB Output is correct
60 Incorrect 52 ms 6452 KB Output isn't correct
61 Incorrect 56 ms 6444 KB Output isn't correct
62 Correct 141 ms 6480 KB Output is correct
63 Correct 108 ms 6228 KB Output is correct
64 Correct 157 ms 6452 KB Output is correct
65 Correct 159 ms 6452 KB Output is correct
66 Correct 117 ms 6224 KB Output is correct
67 Correct 111 ms 6472 KB Output is correct
68 Correct 50 ms 6448 KB Output is correct
69 Correct 40 ms 6224 KB Output is correct
70 Correct 45 ms 6228 KB Output is correct
71 Correct 40 ms 6236 KB Output is correct
72 Incorrect 32 ms 6236 KB Output isn't correct
73 Incorrect 35 ms 6500 KB Output isn't correct
74 Correct 82 ms 6468 KB Output is correct
75 Correct 75 ms 6472 KB Output is correct
76 Correct 66 ms 6492 KB Output is correct
77 Correct 81 ms 6228 KB Output is correct
78 Correct 88 ms 6312 KB Output is correct
79 Correct 63 ms 6480 KB Output is correct
80 Correct 73 ms 6480 KB Output is correct
81 Correct 81 ms 6476 KB Output is correct
82 Correct 72 ms 6328 KB Output is correct
83 Correct 95 ms 6480 KB Output is correct
84 Correct 87 ms 6492 KB Output is correct
85 Correct 89 ms 6480 KB Output is correct
86 Correct 80 ms 6296 KB Output is correct
87 Correct 83 ms 6236 KB Output is correct
88 Correct 94 ms 6480 KB Output is correct
89 Correct 104 ms 6472 KB Output is correct
90 Correct 90 ms 6244 KB Output is correct
91 Correct 90 ms 6480 KB Output is correct
92 Correct 88 ms 6476 KB Output is correct