oj.uz

Submission #759152

# Submission time Handle Problem Language Result Execution time Memory
759152 2023-06-15T19:51:33 Z Blagoj Mecho (IOI09_mecho) C++17
84 / 100
 148 ms 5044 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 = -1, r = (n * n) / 2 + 5;
    while (l + 1 < r) {
        int m = (l + r) / 2;
        if (check(m)) l = m;
        else r = m;
    }
 
    cout << l;
}

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 1 ms 356 KB Output isn't correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 356 KB Output isn't correct
7 Incorrect 67 ms 4784 KB Output isn't correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Incorrect 1 ms 448 KB Output isn't correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 480 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 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 488 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 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 488 KB Output is correct
30 Correct 1 ms 488 KB Output is correct
31 Correct 1 ms 484 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 3 ms 1748 KB Output is correct
34 Correct 3 ms 1776 KB Output is correct
35 Correct 15 ms 1824 KB Output is correct
36 Correct 3 ms 2032 KB Output is correct
37 Correct 3 ms 2024 KB Output is correct
38 Correct 26 ms 2076 KB Output is correct
39 Correct 3 ms 2260 KB Output is correct
40 Correct 3 ms 2288 KB Output is correct
41 Correct 26 ms 2288 KB Output is correct
42 Correct 5 ms 2676 KB Output is correct
43 Correct 4 ms 2672 KB Output is correct
44 Correct 39 ms 2644 KB Output is correct
45 Correct 5 ms 2900 KB Output is correct
46 Correct 5 ms 2900 KB Output is correct
47 Correct 38 ms 2972 KB Output is correct
48 Correct 5 ms 3332 KB Output is correct
49 Correct 5 ms 3284 KB Output is correct
50 Correct 48 ms 3312 KB Output is correct
51 Correct 6 ms 3656 KB Output is correct
52 Correct 6 ms 3668 KB Output is correct
53 Correct 68 ms 3656 KB Output is correct
54 Correct 7 ms 4028 KB Output is correct
55 Correct 7 ms 4020 KB Output is correct
56 Correct 76 ms 4024 KB Output is correct
57 Correct 8 ms 4360 KB Output is correct
58 Correct 8 ms 4308 KB Output is correct
59 Correct 76 ms 4404 KB Output is correct
60 Correct 8 ms 4716 KB Output is correct
61 Correct 9 ms 4720 KB Output is correct
62 Correct 88 ms 4692 KB Output is correct
63 Correct 75 ms 4772 KB Output is correct
64 Correct 148 ms 4772 KB Output is correct
65 Correct 110 ms 4772 KB Output is correct
66 Correct 96 ms 4704 KB Output is correct
67 Correct 87 ms 4772 KB Output is correct
68 Correct 33 ms 4696 KB Output is correct
69 Correct 32 ms 4712 KB Output is correct
70 Correct 24 ms 4696 KB Output is correct
71 Correct 27 ms 4816 KB Output is correct
72 Correct 21 ms 4720 KB Output is correct
73 Correct 22 ms 5024 KB Output is correct
74 Correct 43 ms 5044 KB Output is correct
75 Correct 54 ms 5044 KB Output is correct
76 Correct 47 ms 4936 KB Output is correct
77 Correct 45 ms 4936 KB Output is correct
78 Correct 56 ms 5024 KB Output is correct
79 Correct 33 ms 5020 KB Output is correct
80 Correct 46 ms 5012 KB Output is correct
81 Correct 58 ms 5024 KB Output is correct
82 Correct 50 ms 4948 KB Output is correct
83 Correct 61 ms 4920 KB Output is correct
84 Correct 53 ms 4948 KB Output is correct
85 Correct 67 ms 4984 KB Output is correct
86 Correct 59 ms 4956 KB Output is correct
87 Correct 72 ms 4876 KB Output is correct
88 Correct 59 ms 4924 KB Output is correct
89 Correct 62 ms 4812 KB Output is correct
90 Correct 67 ms 4820 KB Output is correct
91 Correct 71 ms 4852 KB Output is correct
92 Correct 74 ms 4948 KB Output is correct