oj.uz

Submission #608733

# Submission time Handle Problem Language Result Execution time Memory
608733 2022-07-27T09:44:38 Z Mazaalai Mecho (IOI09_mecho) C++17
84 / 100
 289 ms 5656 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define LINE "---------------\n"
#define sz(a) (int)a.size()
using namespace std;
using PII = pair <int, int>;
const int N = 802;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
int n, m, X1, Y1, X2, Y2;
vector <PII> hives;
int mat[N][N], maze[N][N];
bool check(int lim) {
    memcpy(maze, mat, sizeof(mat));
    queue <PII> bfs1, bfs2;
    for (auto& [a, b] : hives) bfs2.push({a, b});
    for (int i = 0; i < lim; i++) {
        int rep = sz(bfs2);
        for (int j = 0; j < rep; j++) {
            int x, y; tie(x, y) = bfs2.front(); bfs2.pop();
            for (int a = 0; a < 4; a++) {
                int xx = dx[a] + x;
                int yy = dy[a] + y;
                if (xx < 1 || xx > n || yy < 1 || yy > n || maze[xx][yy] == 1) continue;
                maze[xx][yy] = 1;
                bfs2.push({xx, yy});
            }
        }
    }
    // cout << LINE;
    // for (int i = 1; i <= n; i++)
    // for (int j = 1; j <= n; j++) cout << maze[i][j] << " \n"[j==n];
    if (mat[X1][Y1] == 1) return 0;
    mat[X1][Y1] = 2;
    bfs1.push({X1, Y1});
    while (maze[X2][Y2] == 0) {
        // move bear
        for (int i = 0; i < m; i++) {
            int rep = sz(bfs1);
            for (int j = 0; j < rep; j++) {
                int x, y; tie(x, y) = bfs1.front(); bfs1.pop();
                if (maze[x][y] == 1) continue;
                for (int a = 0; a < 4; a++) {
                    int xx = dx[a] + x;
                    int yy = dy[a] + y;
                    if (xx < 1 || xx > n || yy < 1 || yy > n || maze[xx][yy] != 0) continue;
                    maze[xx][yy] = 2;
                    bfs1.push({xx, yy});
                }
            }
        }
        // cout << LINE;
        // cout << LINE;
        // for (int i = 1; i <= n; i++)
        // for (int j = 1; j <= n; j++) cout << maze[i][j] << " \n"[j==n];
            
        if (maze[X2][Y2] != 0) return 1;
        // spread bees
        int rep = sz(bfs2);
        for (int j = 0; j < rep; j++) {
            int x, y; tie(x, y) = bfs2.front(); bfs2.pop();
            for (int a = 0; a < 4; a++) {
                int xx = dx[a] + x;
                int yy = dy[a] + y;
                if (xx < 1 || xx > n || yy < 1 || yy > n || maze[xx][yy] == 1) continue;
                maze[xx][yy] = 1;
                bfs2.push({xx, yy});
            }
        }

        // cout << LINE;
        // for (int i = 1; i <= n; i++)
        // for (int j = 1; j <= n; j++) cout << maze[i][j] << " \n"[j==n];
            
    }
    return 0;
}
signed main() {
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
        char x; cin >> x;
        if (x == 'T') { // tree
            mat[i][j] = 1;
        } else if (x == 'G') { // grass
            mat[i][j] = 0;
        } else if (x == 'M') { // mecho the bear
            tie(X1, Y1) = mp(i, j);
            mat[i][j] = 0;
        } else if (x == 'D') { // home of the mecho
            mat[i][j] = 0;
            tie(X2, Y2) = mp(i, j);
        } else if (x == 'H') { // bee hive
            mat[i][j] = 1;
            hives.pb({i, j});
        }
    }
    int l = 0, r = n*n, ans = -1;
    while (l <= r) {
        int m = (l+r)>>1;
        if (check(m)) {
            l = m+1;
            ans = m;
        } else {
            r = m-1;
        }
    }
    cout << ans << "\n";
}

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Incorrect 2 ms 2772 KB Output isn't correct
3 Correct 2 ms 2772 KB Output is correct
4 Incorrect 2 ms 2772 KB Output isn't correct
5 Correct 2 ms 2772 KB Output is correct
6 Incorrect 2 ms 2772 KB Output isn't correct
7 Incorrect 230 ms 5588 KB Output isn't correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Incorrect 3 ms 3028 KB Output isn't correct
13 Correct 4 ms 2900 KB Output is correct
14 Correct 4 ms 3028 KB Output is correct
15 Correct 3 ms 2900 KB Output is correct
16 Correct 4 ms 2900 KB Output is correct
17 Correct 2 ms 2900 KB Output is correct
18 Correct 2 ms 2900 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 3 ms 2900 KB Output is correct
21 Correct 3 ms 2900 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 3 ms 2900 KB Output is correct
24 Correct 3 ms 2900 KB Output is correct
25 Correct 3 ms 3028 KB Output is correct
26 Correct 3 ms 3028 KB Output is correct
27 Correct 3 ms 3028 KB Output is correct
28 Correct 3 ms 3028 KB Output is correct
29 Correct 3 ms 3028 KB Output is correct
30 Correct 3 ms 3028 KB Output is correct
31 Correct 3 ms 3028 KB Output is correct
32 Correct 3 ms 3028 KB Output is correct
33 Correct 25 ms 3924 KB Output is correct
34 Correct 22 ms 3924 KB Output is correct
35 Correct 25 ms 3924 KB Output is correct
36 Correct 30 ms 4052 KB Output is correct
37 Correct 30 ms 4104 KB Output is correct
38 Correct 29 ms 4052 KB Output is correct
39 Correct 40 ms 4248 KB Output is correct
40 Correct 35 ms 4180 KB Output is correct
41 Correct 41 ms 4264 KB Output is correct
42 Correct 50 ms 4392 KB Output is correct
43 Correct 45 ms 4308 KB Output is correct
44 Correct 48 ms 4308 KB Output is correct
45 Correct 60 ms 4564 KB Output is correct
46 Correct 54 ms 4556 KB Output is correct
47 Correct 60 ms 4564 KB Output is correct
48 Correct 69 ms 4708 KB Output is correct
49 Correct 66 ms 4716 KB Output is correct
50 Correct 64 ms 4716 KB Output is correct
51 Correct 88 ms 4820 KB Output is correct
52 Correct 83 ms 4872 KB Output is correct
53 Correct 90 ms 4876 KB Output is correct
54 Correct 98 ms 4948 KB Output is correct
55 Correct 85 ms 4948 KB Output is correct
56 Correct 93 ms 4948 KB Output is correct
57 Correct 113 ms 5176 KB Output is correct
58 Correct 112 ms 5184 KB Output is correct
59 Correct 105 ms 5116 KB Output is correct
60 Correct 130 ms 5332 KB Output is correct
61 Correct 114 ms 5356 KB Output is correct
62 Correct 119 ms 5344 KB Output is correct
63 Correct 260 ms 5348 KB Output is correct
64 Correct 250 ms 5348 KB Output is correct
65 Correct 258 ms 5344 KB Output is correct
66 Correct 258 ms 5344 KB Output is correct
67 Correct 280 ms 5344 KB Output is correct
68 Correct 261 ms 5452 KB Output is correct
69 Correct 227 ms 5372 KB Output is correct
70 Correct 238 ms 5452 KB Output is correct
71 Correct 270 ms 5332 KB Output is correct
72 Correct 225 ms 5376 KB Output is correct
73 Correct 234 ms 5644 KB Output is correct
74 Correct 245 ms 5588 KB Output is correct
75 Correct 265 ms 5588 KB Output is correct
76 Correct 246 ms 5656 KB Output is correct
77 Correct 240 ms 5588 KB Output is correct
78 Correct 237 ms 5612 KB Output is correct
79 Correct 254 ms 5620 KB Output is correct
80 Correct 275 ms 5616 KB Output is correct
81 Correct 274 ms 5592 KB Output is correct
82 Correct 289 ms 5612 KB Output is correct
83 Correct 248 ms 5588 KB Output is correct
84 Correct 253 ms 5584 KB Output is correct
85 Correct 272 ms 5592 KB Output is correct
86 Correct 244 ms 5588 KB Output is correct
87 Correct 249 ms 5568 KB Output is correct
88 Correct 250 ms 5516 KB Output is correct
89 Correct 235 ms 5460 KB Output is correct
90 Correct 238 ms 5512 KB Output is correct
91 Correct 251 ms 5580 KB Output is correct
92 Correct 253 ms 5508 KB Output is correct