oj.uz

Submission #759135

# Submission time Handle Problem Language Result Execution time Memory
759135 2023-06-15T19:31:02 Z Blagoj Mecho (IOI09_mecho) C++17
68 / 100
 142 ms 4436 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()

int n, s, times[802][802];
vector<string> v(802);
pair<int, int> st, en;

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

inline bool valid(int x, int y) {
    return (x >= 0 && x < n && y >= 0 && y < n && v[x][y] != 'T');
}

bool check(int m) {
    if (m >= times[st.first][st.second]) return 0;
    queue<pair<int, int>> q;
    q.push(st);
    bool vis[n + 2][n + 2];
    memset(vis, 0, sizeof(vis));
    vis[st.first][st.second] = 1;
    int moves = 0;
    do {
        moves++;
        if (moves >= s) {
            moves = 0;
            m++;
        }
        int sz = q.size();
        while (sz--) {
            int x = q.front().first, y = q.front().second;
            q.pop();
            for (int d = 0; d < 4; d++) {
                int nx = x + dx[d], ny = y + dy[d];
                if (valid(nx, ny) && m < times[nx][ny] && !vis[nx][ny]) {
                    vis[nx][ny] = 1;
                    q.push({nx, ny});
                    if (make_pair(nx, ny) == en) return 1;
                }
            }
        }
    }
    while (q.size() > 0);
    return 0;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> s;
    queue<pair<int, int>> h;

    for (int i = 0; i < n; i++) {
        cin >> v[i];
        for (int j = 0; j < n; j++) {
            times[i][j] = n * n + 1000;
            if (v[i][j] == 'M') st = {i, j};
            if (v[i][j] == 'H') {
                h.push({i, j});
                times[i][j] = 0;
            }
            if (v[i][j] == 'D') en = {i, j};
        }
    }

    while (h.size() > 0) {
        int x = h.front().first, y = h.front().second;
        h.pop();
        for (int d = 0; d < 4; d++) {
            int nx = x + dx[d], ny = y + dy[d];
            if (valid(nx, ny) && times[x][y] + 1 < times[nx][ny]) {
                times[nx][ny] = times[x][y] + 1;
                h.push({nx, ny});
            }
        }
    }

    int l = 0, r = n * n + 100;
    while (l + 1 < r) {
        int m = (l + r) / 2;
        if (check(m)) l = m;
        else r = m;
    }

    cout << l;
}

Subtask #1
68.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Correct 0 ms 340 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Incorrect 88 ms 4260 KB Output isn't correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Incorrect 1 ms 468 KB Output isn't correct
13 Correct 0 ms 468 KB Output is correct
14 Incorrect 1 ms 468 KB Output isn't correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 2 ms 1620 KB Output is correct
34 Correct 2 ms 1620 KB Output is correct
35 Correct 15 ms 1704 KB Output is correct
36 Correct 3 ms 1876 KB Output is correct
37 Correct 3 ms 1876 KB Output is correct
38 Correct 20 ms 1876 KB Output is correct
39 Correct 3 ms 2132 KB Output is correct
40 Correct 3 ms 2132 KB Output is correct
41 Correct 29 ms 2132 KB Output is correct
42 Correct 4 ms 2312 KB Output is correct
43 Correct 5 ms 2388 KB Output is correct
44 Correct 39 ms 2388 KB Output is correct
45 Correct 4 ms 2644 KB Output is correct
46 Correct 4 ms 2644 KB Output is correct
47 Correct 38 ms 2696 KB Output is correct
48 Correct 5 ms 2900 KB Output is correct
49 Correct 5 ms 2900 KB Output is correct
50 Correct 48 ms 2884 KB Output is correct
51 Correct 6 ms 3156 KB Output is correct
52 Correct 6 ms 3156 KB Output is correct
53 Correct 60 ms 3156 KB Output is correct
54 Correct 6 ms 3452 KB Output is correct
55 Correct 7 ms 3540 KB Output is correct
56 Correct 68 ms 3456 KB Output is correct
57 Correct 7 ms 3800 KB Output is correct
58 Correct 7 ms 3796 KB Output is correct
59 Correct 80 ms 3832 KB Output is correct
60 Correct 8 ms 4052 KB Output is correct
61 Correct 10 ms 4052 KB Output is correct
62 Correct 115 ms 4152 KB Output is correct
63 Correct 70 ms 4140 KB Output is correct
64 Correct 142 ms 4140 KB Output is correct
65 Correct 104 ms 4144 KB Output is correct
66 Correct 91 ms 4172 KB Output is correct
67 Incorrect 98 ms 4152 KB Output isn't correct
68 Correct 38 ms 4180 KB Output is correct
69 Correct 28 ms 4076 KB Output is correct
70 Correct 27 ms 4076 KB Output is correct
71 Correct 25 ms 4076 KB Output is correct
72 Correct 18 ms 4084 KB Output is correct
73 Correct 23 ms 4336 KB Output is correct
74 Correct 42 ms 4420 KB Output is correct
75 Correct 62 ms 4436 KB Output is correct
76 Correct 50 ms 4336 KB Output is correct
77 Correct 58 ms 4420 KB Output is correct
78 Incorrect 60 ms 4296 KB Output isn't correct
79 Correct 33 ms 4400 KB Output is correct
80 Correct 42 ms 4300 KB Output is correct
81 Correct 49 ms 4340 KB Output is correct
82 Correct 43 ms 4300 KB Output is correct
83 Correct 58 ms 4260 KB Output is correct
84 Correct 63 ms 4384 KB Output is correct
85 Correct 57 ms 4308 KB Output is correct
86 Correct 61 ms 4348 KB Output is correct
87 Correct 68 ms 4308 KB Output is correct
88 Correct 64 ms 4308 KB Output is correct
89 Correct 69 ms 4300 KB Output is correct
90 Correct 85 ms 4276 KB Output is correct
91 Correct 79 ms 4308 KB Output is correct
92 Correct 61 ms 4204 KB Output is correct