oj.uz

답안 #848164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848164 2023-09-11T13:08:08 Z uped Mecho (IOI09_mecho) C++14
100 / 100
 199 ms 6368 KB 
#include<bits/stdc++.h>

using namespace std;

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

char f[max_n][max_n];
int mt[max_n][max_n];
int n, s;
pair<int, int> start;

bool inside(int i, int j) {
    return i >= 0 && i < n && j >= 0 && j < n && f[i][j] != 'T';
}

bool check(int offset) {
    queue<pair<int, int>> q;
    vector<vector<int>> ms(n, vector<int>(n, 10e7));
    ms[start.first][start.second] = 0;
    q.emplace(start.first, start.second);

    if (mt[start.first][start.second] <= offset) {
        return false;
    }

    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') {
                return true;
            }
            int steps = ms[i][j] + 1;
            bool possible = offset + (steps / s) < mt[ni][nj];
            if (possible && steps < ms[ni][nj]) {
                ms[ni][nj] = steps;
                q.emplace(ni, nj);
            }
        }
    }
    return false;
}

int main() {
    cin >> n >> s;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            mt[i][j] = 10e7;
        }
    }
    queue<pair<int, int>> q;
    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;
            }
        }
    }

    // make mt
    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);
            }
        }
    }
    if (!check(0)) {
        cout << -1;
        return 0;
    }

    int l = 0, r = 640000;
    while (r > l + 1) {
        int mid = (r + l) / 2;
        if (check(mid)) {
            l = mid;
        } else {
            r = mid;
        }
    }
    cout << l;
}

Compilation message

mecho.cpp: In function 'bool check(int)':
mecho.cpp:29:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |         auto [i, j] = q.front();
      |              ^
mecho.cpp: In function 'int main()':
mecho.cpp:71:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   71 |         auto [i, j] = q.front();
      |              ^

Subtask #1
100.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 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 0 ms 344 KB Output is correct
7 Correct 122 ms 6168 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 2652 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 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 9 ms 3432 KB Output is correct
34 Correct 8 ms 3424 KB Output is correct
35 Correct 26 ms 3432 KB Output is correct
36 Correct 10 ms 3624 KB Output is correct
37 Correct 12 ms 3640 KB Output is correct
38 Correct 33 ms 3624 KB Output is correct
39 Correct 14 ms 3812 KB Output is correct
40 Correct 13 ms 3824 KB Output is correct
41 Correct 42 ms 3808 KB Output is correct
42 Correct 17 ms 4024 KB Output is correct
43 Correct 16 ms 4028 KB Output is correct
44 Correct 55 ms 4112 KB Output is correct
45 Correct 19 ms 4320 KB Output is correct
46 Correct 20 ms 4332 KB Output is correct
47 Correct 64 ms 4344 KB Output is correct
48 Correct 24 ms 4584 KB Output is correct
49 Correct 25 ms 4620 KB Output is correct
50 Correct 77 ms 4584 KB Output is correct
51 Correct 27 ms 4880 KB Output is correct
52 Correct 27 ms 4872 KB Output is correct
53 Correct 93 ms 4892 KB Output is correct
54 Correct 31 ms 5212 KB Output is correct
55 Correct 33 ms 5204 KB Output is correct
56 Correct 119 ms 5188 KB Output is correct
57 Correct 43 ms 5604 KB Output is correct
58 Correct 36 ms 5616 KB Output is correct
59 Correct 128 ms 5604 KB Output is correct
60 Correct 39 ms 6140 KB Output is correct
61 Correct 43 ms 6116 KB Output is correct
62 Correct 157 ms 6248 KB Output is correct
63 Correct 119 ms 6128 KB Output is correct
64 Correct 199 ms 6124 KB Output is correct
65 Correct 161 ms 6336 KB Output is correct
66 Correct 144 ms 6112 KB Output is correct
67 Correct 44 ms 5968 KB Output is correct
68 Correct 74 ms 6232 KB Output is correct
69 Correct 68 ms 6144 KB Output is correct
70 Correct 74 ms 6368 KB Output is correct
71 Correct 63 ms 6124 KB Output is correct
72 Correct 56 ms 6144 KB Output is correct
73 Correct 70 ms 6136 KB Output is correct
74 Correct 91 ms 6168 KB Output is correct
75 Correct 96 ms 6136 KB Output is correct
76 Correct 91 ms 6148 KB Output is correct
77 Correct 100 ms 6120 KB Output is correct
78 Correct 43 ms 5868 KB Output is correct
79 Correct 92 ms 6132 KB Output is correct
80 Correct 87 ms 6140 KB Output is correct
81 Correct 95 ms 6224 KB Output is correct
82 Correct 87 ms 6160 KB Output is correct
83 Correct 111 ms 6124 KB Output is correct
84 Correct 110 ms 6128 KB Output is correct
85 Correct 116 ms 6144 KB Output is correct
86 Correct 110 ms 6140 KB Output is correct
87 Correct 105 ms 6204 KB Output is correct
88 Correct 106 ms 6132 KB Output is correct
89 Correct 122 ms 6104 KB Output is correct
90 Correct 131 ms 6112 KB Output is correct
91 Correct 119 ms 6140 KB Output is correct
92 Correct 116 ms 6140 KB Output is correct