oj.uz

Submission #848111

# Submission time Handle Problem Language Result Execution time Memory
848111 2023-09-11T10:51:23 Z uped Mecho (IOI09_mecho) C++14
70 / 100
 189 ms 6748 KB 
#include<bits/stdc++.h>

using namespace std;

int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

int main() {
    int n, s;
    cin >> n >> s;
    vector<vector<char>> f(n, vector<char>(n));
    queue<pair<int, int>> q;
    vector<vector<int>> mt(n, vector<int>(n, INT32_MAX));
    pair<int, int> start;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> f[i][j];
            if (f[i][j] == 'M') {
                start = {i, j};
            } else if (f[i][j] == 'H') {
                q.emplace(i, j);
                mt[i][j] = 0;
            }
        }
    }

    auto inside = [&](int i, int j) {
        return i >= 0 && i < n && j >= 0 && j < n && f[i][j] != 'T';
    };
    while (!q.empty()) {
        auto [i, j] = q.front();
        q.pop();
        for (int k = 0; k < 4; ++k) {
            int ni = i + dx[k];
            int nj = j + dy[k];
            if (!inside(ni, nj) || f[ni][nj] == 'D') continue;
            if (mt[i][j] + 1 < mt[ni][nj]) {
                mt[ni][nj] = mt[i][j] + 1;
                q.emplace(ni, nj);
            }
        }
    }

    bool fl = false;
    int l = -1, r = 160000;
    while (r > l + 1) {
        while (!q.empty()) q.pop();
        int mid = (l + r) / 2;
        vector<vector<int>> ms(n, vector<int>(n, INT32_MAX));
        ms[start.first][start.second] = 0;
        bool good = false;
        q.emplace(start.first, start.second);
        while (!q.empty()) {
            auto [i, j] = q.front();
            q.pop();
            for (int k = 0; k < 4; ++k) {
                int ni = i + dx[k];
                int nj = j + dy[k];
                if (!inside(ni, nj)) continue;
                if (f[ni][nj] == 'D') {
                    good = true;
                    fl = true;
                    break;
                }
                int steps = ms[i][j] + 1;
                bool possible = mid + (steps / s) < mt[ni][nj];

                if (possible && steps < ms[ni][nj]) {
                    ms[ni][nj] = steps;
                    q.emplace(ni, nj);
                }
            }
            if (good) break;
        }
        if (good) {
            l = mid;
        } else {
            r = mid;
        }
    }
    cout << l;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:31:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |         auto [i, j] = q.front();
      |              ^
mecho.cpp:54:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |             auto [i, j] = q.front();
      |                  ^
mecho.cpp:44:10: warning: variable 'fl' set but not used [-Wunused-but-set-variable]
   44 |     bool fl = false;
      |          ^~

Subtask #1
70.0 / 100.0

# Verdict Execution time Memory 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 102 ms 6748 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 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 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 0 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 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 8 ms 1544 KB Output is correct
34 Correct 7 ms 1544 KB Output is correct
35 Correct 21 ms 1544 KB Output is correct
36 Correct 10 ms 1956 KB Output is correct
37 Correct 10 ms 1884 KB Output is correct
38 Correct 27 ms 1936 KB Output is correct
39 Correct 12 ms 2252 KB Output is correct
40 Correct 13 ms 2284 KB Output is correct
41 Correct 35 ms 2420 KB Output is correct
42 Correct 16 ms 2692 KB Output is correct
43 Correct 16 ms 2692 KB Output is correct
44 Correct 48 ms 2688 KB Output is correct
45 Correct 19 ms 3428 KB Output is correct
46 Correct 19 ms 3132 KB Output is correct
47 Correct 55 ms 3132 KB Output is correct
48 Incorrect 23 ms 3708 KB Output isn't correct
49 Correct 22 ms 3668 KB Output is correct
50 Correct 61 ms 3652 KB Output is correct
51 Incorrect 26 ms 4184 KB Output isn't correct
52 Correct 25 ms 4188 KB Output is correct
53 Correct 77 ms 4228 KB Output is correct
54 Incorrect 34 ms 4868 KB Output isn't correct
55 Correct 38 ms 4892 KB Output is correct
56 Correct 92 ms 4852 KB Output is correct
57 Incorrect 34 ms 5460 KB Output isn't correct
58 Correct 34 ms 5500 KB Output is correct
59 Correct 104 ms 5488 KB Output is correct
60 Incorrect 39 ms 6204 KB Output isn't correct
61 Correct 39 ms 6204 KB Output is correct
62 Correct 131 ms 6160 KB Output is correct
63 Correct 118 ms 6152 KB Output is correct
64 Correct 189 ms 6164 KB Output is correct
65 Correct 147 ms 6204 KB Output is correct
66 Correct 130 ms 6164 KB Output is correct
67 Correct 123 ms 6168 KB Output is correct
68 Correct 65 ms 6196 KB Output is correct
69 Correct 65 ms 6272 KB Output is correct
70 Correct 57 ms 6184 KB Output is correct
71 Correct 60 ms 6216 KB Output is correct
72 Incorrect 56 ms 6324 KB Output isn't correct
73 Incorrect 62 ms 6224 KB Output isn't correct
74 Correct 74 ms 6220 KB Output is correct
75 Correct 86 ms 6404 KB Output is correct
76 Correct 81 ms 6236 KB Output is correct
77 Correct 76 ms 6200 KB Output is correct
78 Correct 96 ms 6188 KB Output is correct
79 Correct 66 ms 6240 KB Output is correct
80 Correct 84 ms 6220 KB Output is correct
81 Correct 87 ms 6172 KB Output is correct
82 Correct 83 ms 6192 KB Output is correct
83 Correct 98 ms 6184 KB Output is correct
84 Correct 92 ms 6204 KB Output is correct
85 Correct 93 ms 6216 KB Output is correct
86 Correct 95 ms 6252 KB Output is correct
87 Correct 91 ms 6196 KB Output is correct
88 Correct 105 ms 6260 KB Output is correct
89 Correct 96 ms 6200 KB Output is correct
90 Correct 95 ms 6200 KB Output is correct
91 Correct 95 ms 6188 KB Output is correct
92 Correct 101 ms 6216 KB Output is correct