oj.uz

Submission #608720

# Submission time Handle Problem Language Result Execution time Memory
608720 2022-07-27T09:37:44 Z Mazaalai Mecho (IOI09_mecho) C++17
84 / 100
 310 ms 5708 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 = 805;
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];

    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);
    // freopen("0.in", "r", stdin);
    // freopen("0.out", "w", stdout);
    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/2+1, 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 3 ms 2772 KB Output is correct
4 Incorrect 2 ms 2772 KB Output isn't correct
5 Correct 2 ms 2796 KB Output is correct
6 Incorrect 2 ms 2900 KB Output isn't correct
7 Incorrect 213 ms 5488 KB Output isn't correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 2 ms 2900 KB Output is correct
10 Correct 2 ms 2900 KB Output is correct
11 Correct 2 ms 2900 KB Output is correct
12 Incorrect 4 ms 3056 KB Output isn't correct
13 Correct 3 ms 3028 KB Output is correct
14 Correct 5 ms 3028 KB Output is correct
15 Correct 2 ms 2924 KB Output is correct
16 Correct 2 ms 2900 KB Output is correct
17 Correct 2 ms 2912 KB Output is correct
18 Correct 3 ms 2900 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 2 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 3028 KB Output is correct
24 Correct 3 ms 3028 KB Output is correct
25 Correct 3 ms 3028 KB Output is correct
26 Correct 4 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 4 ms 3028 KB Output is correct
33 Correct 24 ms 3968 KB Output is correct
34 Correct 21 ms 3968 KB Output is correct
35 Correct 27 ms 3928 KB Output is correct
36 Correct 30 ms 4128 KB Output is correct
37 Correct 30 ms 4108 KB Output is correct
38 Correct 30 ms 4052 KB Output is correct
39 Correct 42 ms 4180 KB Output is correct
40 Correct 36 ms 4180 KB Output is correct
41 Correct 42 ms 4180 KB Output is correct
42 Correct 55 ms 4436 KB Output is correct
43 Correct 46 ms 4436 KB Output is correct
44 Correct 49 ms 4436 KB Output is correct
45 Correct 57 ms 4576 KB Output is correct
46 Correct 62 ms 4596 KB Output is correct
47 Correct 63 ms 4564 KB Output is correct
48 Correct 66 ms 4736 KB Output is correct
49 Correct 62 ms 4740 KB Output is correct
50 Correct 67 ms 4740 KB Output is correct
51 Correct 81 ms 4792 KB Output is correct
52 Correct 76 ms 4900 KB Output is correct
53 Correct 78 ms 4820 KB Output is correct
54 Correct 96 ms 5048 KB Output is correct
55 Correct 82 ms 5124 KB Output is correct
56 Correct 87 ms 5056 KB Output is correct
57 Correct 102 ms 5180 KB Output is correct
58 Correct 93 ms 5204 KB Output is correct
59 Correct 98 ms 5188 KB Output is correct
60 Correct 119 ms 5364 KB Output is correct
61 Correct 109 ms 5380 KB Output is correct
62 Correct 111 ms 5316 KB Output is correct
63 Correct 260 ms 5332 KB Output is correct
64 Correct 269 ms 5388 KB Output is correct
65 Correct 256 ms 5312 KB Output is correct
66 Correct 265 ms 5376 KB Output is correct
67 Correct 275 ms 5368 KB Output is correct
68 Correct 233 ms 5332 KB Output is correct
69 Correct 212 ms 5408 KB Output is correct
70 Correct 245 ms 5460 KB Output is correct
71 Correct 235 ms 5408 KB Output is correct
72 Correct 235 ms 5400 KB Output is correct
73 Correct 224 ms 5672 KB Output is correct
74 Correct 241 ms 5588 KB Output is correct
75 Correct 248 ms 5708 KB Output is correct
76 Correct 237 ms 5588 KB Output is correct
77 Correct 253 ms 5676 KB Output is correct
78 Correct 254 ms 5644 KB Output is correct
79 Correct 262 ms 5636 KB Output is correct
80 Correct 246 ms 5636 KB Output is correct
81 Correct 249 ms 5656 KB Output is correct
82 Correct 245 ms 5636 KB Output is correct
83 Correct 248 ms 5620 KB Output is correct
84 Correct 245 ms 5616 KB Output is correct
85 Correct 267 ms 5600 KB Output is correct
86 Correct 246 ms 5644 KB Output is correct
87 Correct 256 ms 5488 KB Output is correct
88 Correct 244 ms 5548 KB Output is correct
89 Correct 240 ms 5536 KB Output is correct
90 Correct 249 ms 5544 KB Output is correct
91 Correct 254 ms 5544 KB Output is correct
92 Correct 310 ms 5544 KB Output is correct