oj.uz

답안 #470715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470715 2021-09-05T08:05:39 Z dooompy Mecho (IOI09_mecho) C++17
100 / 100
 225 ms 5552 KB 
#include "bits/stdc++.h"

using namespace std;

using ll = long long;

bool tree[1005][1005];
int bees[1005][1005];
bool seen[1005][1005];
int n, s, sx, sy, dx, dy;

int mx[]{1, -1, 0, 0};
int my[]{0, 0, 1, -1};

struct bear {
    int x, y, time, move;
};

bool able(int time) {
    fill(&seen[0][0], &seen[0][0] + sizeof(seen) / sizeof(seen[0][0]), false);
    int curtime = time;

    // curtime can go into curtime+2 but must finish on curtime+3

    queue<bear> q;
    q.push({sx, sy, curtime+2, 0});
//    seen[sx][sy] = true;

    if (bees[sx][sy] < curtime + 2) return false;

    while (!q.empty()) {
        auto cur = q.front(); q.pop();

        if (cur.x == dx && cur.y == dy) return true;


        if (seen[cur.x][cur.y]) continue;

        if (cur.move == s) {
            cur.time++;
            if (bees[cur.x][cur.y] < cur.time) {
                continue;
            }
            cur.move = 0;
        }

        if (bees[cur.x][cur.y] < cur.time) {
            continue;
        }



        seen[cur.x][cur.y] = true;

        for (int i = 0; i < 4; i++) {
            int newx = cur.x + mx[i], newy = cur.y + my[i];

            if (newx < 0 || newx >= n || newy < 0 || newy >= n || ((newx != dx && newy != dy) && bees[newx][newy] < cur.time) || tree[newx][newy] || seen[newx][newy]) continue;

            q.push({newx, newy, cur.time, cur.move+1});
        }
    }

    return false;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    cin >> n >> s;
    queue<pair<int, int>> q;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            char c; cin>> c;
            if (c == 'T') tree[i][j] = true;
            if (c == 'M') {
                sx = i; sy = j;

            }
            if (c == 'D') {
                dx = i; dy = j;
            }
            if (c == 'H') {
                q.push({i, j});
                bees[i][j] = 1;
            }
        }
    }

    while (!q.empty()) {
        auto cur = q.front();
        q.pop();

        for (int i = 0; i < 4; i++) {
            int newx = cur.first + mx[i], newy = cur.second + my[i];
            if (newx < 0 || newx >= n || newy < 0 || newy >= n || bees[newx][newy] || tree[newx][newy] || (newx == dx && newy == dy)) continue;
            bees[newx][newy] = bees[cur.first][cur.second] + 1;
            q.push({newx, newy});
        }
    }

    int lo = 0, hi = 1e9;

    int biggest = -1;

    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        if (able(mid)) {
            biggest = mid;
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }

    cout << biggest;

}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1228 KB Output is correct
2 Correct 2 ms 1228 KB Output is correct
3 Correct 2 ms 1228 KB Output is correct
4 Correct 2 ms 1228 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 2 ms 1228 KB Output is correct
7 Correct 170 ms 5224 KB Output is correct
8 Correct 3 ms 1356 KB Output is correct
9 Correct 2 ms 1356 KB Output is correct
10 Correct 2 ms 1356 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 2 ms 1484 KB Output is correct
13 Correct 3 ms 1484 KB Output is correct
14 Correct 2 ms 1484 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 2 ms 1356 KB Output is correct
18 Correct 2 ms 1356 KB Output is correct
19 Correct 2 ms 1356 KB Output is correct
20 Correct 2 ms 1356 KB Output is correct
21 Correct 2 ms 1484 KB Output is correct
22 Correct 2 ms 1588 KB Output is correct
23 Correct 2 ms 1484 KB Output is correct
24 Correct 2 ms 1484 KB Output is correct
25 Correct 2 ms 1484 KB Output is correct
26 Correct 3 ms 1484 KB Output is correct
27 Correct 2 ms 1560 KB Output is correct
28 Correct 2 ms 1612 KB Output is correct
29 Correct 2 ms 1612 KB Output is correct
30 Correct 2 ms 1656 KB Output is correct
31 Correct 2 ms 1612 KB Output is correct
32 Correct 2 ms 1612 KB Output is correct
33 Correct 7 ms 3020 KB Output is correct
34 Correct 7 ms 2992 KB Output is correct
35 Correct 35 ms 2952 KB Output is correct
36 Correct 8 ms 3276 KB Output is correct
37 Correct 9 ms 3216 KB Output is correct
38 Correct 43 ms 3268 KB Output is correct
39 Correct 12 ms 3488 KB Output is correct
40 Correct 9 ms 3528 KB Output is correct
41 Correct 60 ms 3532 KB Output is correct
42 Correct 11 ms 3768 KB Output is correct
43 Correct 10 ms 3768 KB Output is correct
44 Correct 73 ms 3660 KB Output is correct
45 Correct 12 ms 4016 KB Output is correct
46 Correct 12 ms 3916 KB Output is correct
47 Correct 92 ms 4032 KB Output is correct
48 Correct 15 ms 4224 KB Output is correct
49 Correct 17 ms 4172 KB Output is correct
50 Correct 125 ms 4244 KB Output is correct
51 Correct 16 ms 4476 KB Output is correct
52 Correct 16 ms 4492 KB Output is correct
53 Correct 129 ms 4500 KB Output is correct
54 Correct 17 ms 4684 KB Output is correct
55 Correct 20 ms 4684 KB Output is correct
56 Correct 155 ms 4796 KB Output is correct
57 Correct 20 ms 4944 KB Output is correct
58 Correct 24 ms 4904 KB Output is correct
59 Correct 167 ms 4996 KB Output is correct
60 Correct 26 ms 5152 KB Output is correct
61 Correct 22 ms 5212 KB Output is correct
62 Correct 225 ms 5248 KB Output is correct
63 Correct 142 ms 5236 KB Output is correct
64 Correct 219 ms 5232 KB Output is correct
65 Correct 212 ms 5232 KB Output is correct
66 Correct 158 ms 5140 KB Output is correct
67 Correct 134 ms 5188 KB Output is correct
68 Correct 63 ms 5252 KB Output is correct
69 Correct 63 ms 5176 KB Output is correct
70 Correct 45 ms 5264 KB Output is correct
71 Correct 48 ms 5188 KB Output is correct
72 Correct 46 ms 5196 KB Output is correct
73 Correct 65 ms 5500 KB Output is correct
74 Correct 96 ms 5436 KB Output is correct
75 Correct 107 ms 5552 KB Output is correct
76 Correct 96 ms 5500 KB Output is correct
77 Correct 102 ms 5412 KB Output is correct
78 Correct 147 ms 5476 KB Output is correct
79 Correct 88 ms 5476 KB Output is correct
80 Correct 99 ms 5444 KB Output is correct
81 Correct 116 ms 5476 KB Output is correct
82 Correct 91 ms 5384 KB Output is correct
83 Correct 133 ms 5512 KB Output is correct
84 Correct 144 ms 5364 KB Output is correct
85 Correct 118 ms 5328 KB Output is correct
86 Correct 131 ms 5396 KB Output is correct
87 Correct 129 ms 5432 KB Output is correct
88 Correct 138 ms 5396 KB Output is correct
89 Correct 153 ms 5384 KB Output is correct
90 Correct 144 ms 5316 KB Output is correct
91 Correct 142 ms 5388 KB Output is correct
92 Correct 141 ms 5384 KB Output is correct