oj.uz

답안 #848158

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848158 2023-09-11T13:01:17 Z uped Mecho (IOI09_mecho) C++14
70 / 100
 200 ms 6260 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);
    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 = 160000;
    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:24:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |         auto [i, j] = q.front();
      |              ^
mecho.cpp: In function 'int main()':
mecho.cpp:66:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   66 |         auto [i, j] = q.front();
      |              ^

Subtask #1
70.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 444 KB Output is correct
4 Correct 0 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 112 ms 6120 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 1 ms 2652 KB Output isn't correct
13 Incorrect 1 ms 852 KB Output isn't correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 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 2648 KB Output is correct
33 Correct 8 ms 3632 KB Output is correct
34 Correct 8 ms 3432 KB Output is correct
35 Correct 25 ms 3496 KB Output is correct
36 Correct 10 ms 3620 KB Output is correct
37 Correct 11 ms 3624 KB Output is correct
38 Correct 33 ms 3632 KB Output is correct
39 Correct 13 ms 4056 KB Output is correct
40 Correct 13 ms 3804 KB Output is correct
41 Correct 41 ms 3788 KB Output is correct
42 Correct 16 ms 4108 KB Output is correct
43 Correct 16 ms 4112 KB Output is correct
44 Correct 56 ms 4076 KB Output is correct
45 Correct 19 ms 4284 KB Output is correct
46 Correct 19 ms 4324 KB Output is correct
47 Correct 63 ms 4300 KB Output is correct
48 Incorrect 23 ms 4592 KB Output isn't correct
49 Correct 22 ms 4620 KB Output is correct
50 Correct 73 ms 4592 KB Output is correct
51 Incorrect 26 ms 4872 KB Output isn't correct
52 Correct 25 ms 4864 KB Output is correct
53 Correct 94 ms 4884 KB Output is correct
54 Incorrect 30 ms 5156 KB Output isn't correct
55 Correct 30 ms 5172 KB Output is correct
56 Correct 105 ms 5156 KB Output is correct
57 Incorrect 35 ms 5632 KB Output isn't correct
58 Correct 36 ms 5868 KB Output is correct
59 Correct 128 ms 5596 KB Output is correct
60 Incorrect 39 ms 6148 KB Output isn't correct
61 Correct 41 ms 6148 KB Output is correct
62 Correct 143 ms 6104 KB Output is correct
63 Correct 123 ms 6104 KB Output is correct
64 Correct 200 ms 6100 KB Output is correct
65 Correct 168 ms 6244 KB Output is correct
66 Correct 138 ms 6072 KB Output is correct
67 Correct 44 ms 5848 KB Output is correct
68 Correct 75 ms 6128 KB Output is correct
69 Correct 67 ms 6120 KB Output is correct
70 Correct 68 ms 6132 KB Output is correct
71 Correct 65 ms 6132 KB Output is correct
72 Incorrect 52 ms 6144 KB Output isn't correct
73 Incorrect 73 ms 6148 KB Output isn't correct
74 Correct 89 ms 6148 KB Output is correct
75 Correct 100 ms 6136 KB Output is correct
76 Correct 99 ms 6128 KB Output is correct
77 Correct 103 ms 6120 KB Output is correct
78 Correct 42 ms 5968 KB Output is correct
79 Correct 81 ms 6136 KB Output is correct
80 Correct 95 ms 6260 KB Output is correct
81 Correct 94 ms 6160 KB Output is correct
82 Correct 87 ms 6124 KB Output is correct
83 Correct 104 ms 6164 KB Output is correct
84 Correct 108 ms 6160 KB Output is correct
85 Correct 111 ms 6140 KB Output is correct
86 Correct 111 ms 6180 KB Output is correct
87 Correct 105 ms 6164 KB Output is correct
88 Correct 110 ms 6132 KB Output is correct
89 Correct 118 ms 6112 KB Output is correct
90 Correct 120 ms 6100 KB Output is correct
91 Correct 118 ms 6108 KB Output is correct
92 Correct 111 ms 6228 KB Output is correct