oj.uz

답안 #950865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950865 2024-03-20T20:49:56 Z blackslex Mecho (IOI09_mecho) C++17
64 / 100
 180 ms 6916 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') 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') 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;
    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
64.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 99 ms 6528 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 760 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 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 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 344 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 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 5 ms 1628 KB Output is correct
34 Correct 6 ms 1628 KB Output is correct
35 Correct 25 ms 1624 KB Output is correct
36 Correct 6 ms 1884 KB Output is correct
37 Correct 6 ms 1884 KB Output is correct
38 Correct 31 ms 2088 KB Output is correct
39 Incorrect 8 ms 2392 KB Output isn't correct
40 Correct 12 ms 2396 KB Output is correct
41 Correct 47 ms 2756 KB Output is correct
42 Incorrect 13 ms 2904 KB Output isn't correct
43 Correct 10 ms 2908 KB Output is correct
44 Correct 50 ms 3036 KB Output is correct
45 Incorrect 19 ms 3508 KB Output isn't correct
46 Correct 13 ms 3420 KB Output is correct
47 Correct 67 ms 3420 KB Output is correct
48 Incorrect 24 ms 3888 KB Output isn't correct
49 Correct 14 ms 3928 KB Output is correct
50 Correct 75 ms 3932 KB Output is correct
51 Incorrect 31 ms 4700 KB Output isn't correct
52 Incorrect 20 ms 4696 KB Output isn't correct
53 Correct 95 ms 4796 KB Output is correct
54 Incorrect 38 ms 5204 KB Output isn't correct
55 Incorrect 30 ms 5212 KB Output isn't correct
56 Correct 108 ms 5392 KB Output is correct
57 Incorrect 49 ms 6224 KB Output isn't correct
58 Incorrect 48 ms 6116 KB Output isn't correct
59 Correct 134 ms 6108 KB Output is correct
60 Incorrect 52 ms 6876 KB Output isn't correct
61 Incorrect 56 ms 6748 KB Output isn't correct
62 Correct 180 ms 6880 KB Output is correct
63 Correct 107 ms 6732 KB Output is correct
64 Correct 160 ms 6824 KB Output is correct
65 Correct 157 ms 6744 KB Output is correct
66 Correct 118 ms 6832 KB Output is correct
67 Correct 119 ms 6868 KB Output is correct
68 Correct 49 ms 6748 KB Output is correct
69 Correct 40 ms 6832 KB Output is correct
70 Correct 49 ms 6740 KB Output is correct
71 Correct 40 ms 6804 KB Output is correct
72 Incorrect 37 ms 6756 KB Output isn't correct
73 Incorrect 37 ms 6736 KB Output isn't correct
74 Correct 65 ms 6736 KB Output is correct
75 Correct 71 ms 6916 KB Output is correct
76 Correct 71 ms 6860 KB Output is correct
77 Correct 89 ms 6916 KB Output is correct
78 Correct 86 ms 6748 KB Output is correct
79 Correct 68 ms 6740 KB Output is correct
80 Correct 69 ms 6736 KB Output is correct
81 Correct 77 ms 6712 KB Output is correct
82 Correct 73 ms 6880 KB Output is correct
83 Correct 92 ms 6712 KB Output is correct
84 Correct 85 ms 6532 KB Output is correct
85 Correct 89 ms 6736 KB Output is correct
86 Correct 86 ms 6728 KB Output is correct
87 Correct 96 ms 6800 KB Output is correct
88 Correct 94 ms 6736 KB Output is correct
89 Correct 84 ms 6736 KB Output is correct
90 Correct 108 ms 6736 KB Output is correct
91 Correct 89 ms 6736 KB Output is correct
92 Correct 87 ms 6736 KB Output is correct