oj.uz

답안 #470706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470706 2021-09-05T07:41:35 Z dooompy Mecho (IOI09_mecho) C++17
73 / 100
 209 ms 6136 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;

    while (!q.empty()) {
        auto cur = q.front(); q.pop();
        if (cur.x == dx && cur.y == dy) return true;

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

        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 || bees[newx][newy] < cur.time || tree[newx][newy] || seen[newx][newy]) continue;
            seen[newx][newy] = true;
            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]) 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 = max(biggest, mid);
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }

    cout << biggest;

}

Subtask #1
73.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1228 KB Output is correct
2 Incorrect 2 ms 1228 KB Output isn't correct
3 Correct 2 ms 1228 KB Output is correct
4 Incorrect 2 ms 1228 KB Output isn't correct
5 Correct 2 ms 1228 KB Output is correct
6 Incorrect 2 ms 1352 KB Output isn't correct
7 Incorrect 101 ms 5744 KB Output isn't correct
8 Correct 2 ms 1356 KB Output is correct
9 Correct 2 ms 1356 KB Output is correct
10 Correct 2 ms 1384 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Incorrect 2 ms 1484 KB Output isn't correct
13 Incorrect 2 ms 1484 KB Output isn't correct
14 Correct 2 ms 1604 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 1484 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 2 ms 1612 KB Output is correct
27 Correct 3 ms 1740 KB Output is correct
28 Correct 2 ms 1612 KB Output is correct
29 Correct 2 ms 1608 KB Output is correct
30 Correct 2 ms 1612 KB Output is correct
31 Correct 3 ms 1612 KB Output is correct
32 Correct 2 ms 1612 KB Output is correct
33 Correct 7 ms 3148 KB Output is correct
34 Correct 7 ms 3148 KB Output is correct
35 Correct 29 ms 3164 KB Output is correct
36 Correct 8 ms 3404 KB Output is correct
37 Correct 8 ms 3404 KB Output is correct
38 Correct 34 ms 3368 KB Output is correct
39 Correct 9 ms 3660 KB Output is correct
40 Correct 9 ms 3700 KB Output is correct
41 Correct 42 ms 3660 KB Output is correct
42 Correct 11 ms 3924 KB Output is correct
43 Correct 11 ms 3916 KB Output is correct
44 Correct 57 ms 4012 KB Output is correct
45 Correct 12 ms 4300 KB Output is correct
46 Correct 12 ms 4308 KB Output is correct
47 Correct 67 ms 4216 KB Output is correct
48 Correct 14 ms 4556 KB Output is correct
49 Correct 14 ms 4512 KB Output is correct
50 Correct 87 ms 4616 KB Output is correct
51 Correct 16 ms 4812 KB Output is correct
52 Correct 16 ms 4916 KB Output is correct
53 Correct 102 ms 4936 KB Output is correct
54 Correct 18 ms 5196 KB Output is correct
55 Correct 18 ms 5160 KB Output is correct
56 Correct 109 ms 5228 KB Output is correct
57 Correct 21 ms 5476 KB Output is correct
58 Correct 22 ms 5528 KB Output is correct
59 Correct 139 ms 5552 KB Output is correct
60 Correct 22 ms 5828 KB Output is correct
61 Correct 22 ms 5792 KB Output is correct
62 Correct 141 ms 5780 KB Output is correct
63 Correct 127 ms 5876 KB Output is correct
64 Correct 209 ms 5788 KB Output is correct
65 Correct 200 ms 5864 KB Output is correct
66 Correct 142 ms 5828 KB Output is correct
67 Correct 128 ms 5756 KB Output is correct
68 Correct 62 ms 5848 KB Output is correct
69 Correct 60 ms 5828 KB Output is correct
70 Correct 44 ms 5828 KB Output is correct
71 Correct 45 ms 5772 KB Output is correct
72 Incorrect 42 ms 5888 KB Output isn't correct
73 Incorrect 41 ms 6128 KB Output isn't correct
74 Correct 76 ms 6068 KB Output is correct
75 Correct 85 ms 6052 KB Output is correct
76 Correct 75 ms 6136 KB Output is correct
77 Correct 80 ms 6048 KB Output is correct
78 Correct 85 ms 6048 KB Output is correct
79 Correct 67 ms 6004 KB Output is correct
80 Correct 78 ms 6124 KB Output is correct
81 Correct 86 ms 6088 KB Output is correct
82 Correct 70 ms 6120 KB Output is correct
83 Correct 94 ms 5956 KB Output is correct
84 Correct 92 ms 5976 KB Output is correct
85 Correct 84 ms 6088 KB Output is correct
86 Correct 93 ms 5976 KB Output is correct
87 Correct 89 ms 6068 KB Output is correct
88 Correct 96 ms 6016 KB Output is correct
89 Correct 103 ms 6016 KB Output is correct
90 Correct 107 ms 6020 KB Output is correct
91 Correct 96 ms 6024 KB Output is correct
92 Correct 99 ms 5956 KB Output is correct