oj.uz

답안 #470708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470708 2021-09-05T07:49:48 Z dooompy Mecho (IOI09_mecho) C++17
73 / 100
 208 ms 5572 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 (seen[cur.x][cur.y]) continue;

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

        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 || 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]) 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
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 1228 KB Output isn't correct
7 Incorrect 135 ms 5344 KB Output isn't correct
8 Correct 2 ms 1356 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 2 ms 1356 KB Output is correct
11 Correct 2 ms 1380 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 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 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 1484 KB Output is correct
27 Correct 2 ms 1612 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 1612 KB Output is correct
31 Correct 3 ms 1740 KB Output is correct
32 Correct 2 ms 1612 KB Output is correct
33 Correct 8 ms 3032 KB Output is correct
34 Correct 7 ms 3020 KB Output is correct
35 Correct 32 ms 2952 KB Output is correct
36 Correct 8 ms 3276 KB Output is correct
37 Correct 8 ms 3276 KB Output is correct
38 Correct 42 ms 3276 KB Output is correct
39 Correct 9 ms 3516 KB Output is correct
40 Correct 9 ms 3404 KB Output is correct
41 Correct 52 ms 3532 KB Output is correct
42 Correct 10 ms 3660 KB Output is correct
43 Correct 13 ms 3732 KB Output is correct
44 Correct 74 ms 3780 KB Output is correct
45 Correct 12 ms 3916 KB Output is correct
46 Correct 12 ms 3916 KB Output is correct
47 Correct 84 ms 3916 KB Output is correct
48 Correct 13 ms 4172 KB Output is correct
49 Correct 14 ms 4264 KB Output is correct
50 Correct 105 ms 4260 KB Output is correct
51 Correct 16 ms 4416 KB Output is correct
52 Correct 16 ms 4516 KB Output is correct
53 Correct 130 ms 4504 KB Output is correct
54 Correct 18 ms 4684 KB Output is correct
55 Correct 18 ms 4676 KB Output is correct
56 Correct 139 ms 4668 KB Output is correct
57 Correct 20 ms 4896 KB Output is correct
58 Correct 19 ms 4940 KB Output is correct
59 Correct 158 ms 4924 KB Output is correct
60 Correct 22 ms 5188 KB Output is correct
61 Correct 26 ms 5176 KB Output is correct
62 Correct 192 ms 5248 KB Output is correct
63 Correct 127 ms 5228 KB Output is correct
64 Correct 208 ms 5112 KB Output is correct
65 Correct 199 ms 5188 KB Output is correct
66 Correct 141 ms 5144 KB Output is correct
67 Correct 128 ms 5248 KB Output is correct
68 Correct 63 ms 5248 KB Output is correct
69 Correct 58 ms 5188 KB Output is correct
70 Correct 45 ms 5176 KB Output is correct
71 Correct 45 ms 5184 KB Output is correct
72 Incorrect 40 ms 5180 KB Output isn't correct
73 Incorrect 43 ms 5444 KB Output isn't correct
74 Correct 95 ms 5508 KB Output is correct
75 Correct 105 ms 5384 KB Output is correct
76 Correct 92 ms 5508 KB Output is correct
77 Correct 100 ms 5412 KB Output is correct
78 Correct 113 ms 5472 KB Output is correct
79 Correct 82 ms 5392 KB Output is correct
80 Correct 105 ms 5484 KB Output is correct
81 Correct 114 ms 5572 KB Output is correct
82 Correct 87 ms 5468 KB Output is correct
83 Correct 124 ms 5436 KB Output is correct
84 Correct 111 ms 5432 KB Output is correct
85 Correct 110 ms 5436 KB Output is correct
86 Correct 124 ms 5440 KB Output is correct
87 Correct 120 ms 5432 KB Output is correct
88 Correct 130 ms 5384 KB Output is correct
89 Correct 133 ms 5384 KB Output is correct
90 Correct 136 ms 5380 KB Output is correct
91 Correct 128 ms 5356 KB Output is correct
92 Correct 134 ms 5388 KB Output is correct