oj.uz

답안 #950874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950874 2024-03-20T21:03:20 Z blackslex Mecho (IOI09_mecho) C++17
84 / 100
 141 ms 6720 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] = 1, 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' || c[nx][ny] == 'D') 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 + 1; 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' || f2[nx][ny]) 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 = 1e6;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (bs(mid)) l = mid + 1;
        else r = mid - 1;
    }
    printf("%d", r);
}

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
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
7 Correct 81 ms 6224 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 2 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 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 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 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 6 ms 1628 KB Output is correct
34 Correct 6 ms 1628 KB Output is correct
35 Correct 20 ms 1628 KB Output is correct
36 Correct 6 ms 2204 KB Output is correct
37 Correct 6 ms 2000 KB Output is correct
38 Correct 31 ms 1884 KB Output is correct
39 Correct 8 ms 2396 KB Output is correct
40 Correct 9 ms 2396 KB Output is correct
41 Correct 31 ms 2396 KB Output is correct
42 Correct 10 ms 2648 KB Output is correct
43 Correct 11 ms 2652 KB Output is correct
44 Correct 42 ms 2652 KB Output is correct
45 Correct 11 ms 3172 KB Output is correct
46 Correct 11 ms 3164 KB Output is correct
47 Correct 49 ms 3352 KB Output is correct
48 Correct 14 ms 3672 KB Output is correct
49 Correct 18 ms 4176 KB Output is correct
50 Correct 58 ms 3672 KB Output is correct
51 Correct 16 ms 4444 KB Output is correct
52 Correct 16 ms 4476 KB Output is correct
53 Correct 70 ms 4444 KB Output is correct
54 Correct 17 ms 4956 KB Output is correct
55 Correct 18 ms 5208 KB Output is correct
56 Correct 80 ms 5088 KB Output is correct
57 Correct 24 ms 5720 KB Output is correct
58 Correct 19 ms 5724 KB Output is correct
59 Correct 93 ms 5724 KB Output is correct
60 Correct 20 ms 6232 KB Output is correct
61 Correct 27 ms 6236 KB Output is correct
62 Correct 107 ms 6236 KB Output is correct
63 Correct 92 ms 6224 KB Output is correct
64 Correct 141 ms 6452 KB Output is correct
65 Correct 126 ms 6352 KB Output is correct
66 Correct 113 ms 6340 KB Output is correct
67 Correct 94 ms 6452 KB Output is correct
68 Correct 55 ms 6224 KB Output is correct
69 Correct 45 ms 6228 KB Output is correct
70 Correct 42 ms 6224 KB Output is correct
71 Correct 37 ms 6236 KB Output is correct
72 Incorrect 40 ms 6484 KB Output isn't correct
73 Incorrect 36 ms 6232 KB Output isn't correct
74 Correct 60 ms 6228 KB Output is correct
75 Correct 65 ms 6228 KB Output is correct
76 Correct 60 ms 6236 KB Output is correct
77 Correct 63 ms 6464 KB Output is correct
78 Correct 75 ms 6400 KB Output is correct
79 Correct 57 ms 6228 KB Output is correct
80 Correct 61 ms 6236 KB Output is correct
81 Correct 90 ms 6344 KB Output is correct
82 Correct 53 ms 6232 KB Output is correct
83 Correct 74 ms 6472 KB Output is correct
84 Correct 69 ms 6460 KB Output is correct
85 Correct 70 ms 6476 KB Output is correct
86 Correct 73 ms 6488 KB Output is correct
87 Correct 74 ms 6232 KB Output is correct
88 Correct 90 ms 6720 KB Output is correct
89 Correct 87 ms 6292 KB Output is correct
90 Correct 79 ms 6480 KB Output is correct
91 Correct 80 ms 6244 KB Output is correct
92 Correct 77 ms 6248 KB Output is correct