oj.uz

답안 #470710

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

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

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

        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 (cur.x == dx && cur.y == dy) return true;


        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
84.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 1356 KB Output isn't correct
7 Incorrect 158 ms 5228 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 1356 KB Output is correct
11 Correct 3 ms 1356 KB Output is correct
12 Incorrect 2 ms 1484 KB Output isn't correct
13 Correct 2 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 1504 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 3 ms 1484 KB Output is correct
26 Correct 3 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 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 3020 KB Output is correct
35 Correct 35 ms 3040 KB Output is correct
36 Correct 8 ms 3276 KB Output is correct
37 Correct 8 ms 3232 KB Output is correct
38 Correct 42 ms 3276 KB Output is correct
39 Correct 12 ms 3532 KB Output is correct
40 Correct 11 ms 3404 KB Output is correct
41 Correct 53 ms 3464 KB Output is correct
42 Correct 11 ms 3744 KB Output is correct
43 Correct 10 ms 3772 KB Output is correct
44 Correct 68 ms 3760 KB Output is correct
45 Correct 15 ms 3952 KB Output is correct
46 Correct 15 ms 4020 KB Output is correct
47 Correct 85 ms 4028 KB Output is correct
48 Correct 14 ms 4172 KB Output is correct
49 Correct 14 ms 4264 KB Output is correct
50 Correct 101 ms 4216 KB Output is correct
51 Correct 16 ms 4424 KB Output is correct
52 Correct 16 ms 4424 KB Output is correct
53 Correct 121 ms 4428 KB Output is correct
54 Correct 20 ms 4728 KB Output is correct
55 Correct 18 ms 4744 KB Output is correct
56 Correct 136 ms 4756 KB Output is correct
57 Correct 20 ms 4940 KB Output is correct
58 Correct 19 ms 4908 KB Output is correct
59 Correct 175 ms 4988 KB Output is correct
60 Correct 22 ms 5196 KB Output is correct
61 Correct 22 ms 5180 KB Output is correct
62 Correct 182 ms 5316 KB Output is correct
63 Correct 133 ms 5228 KB Output is correct
64 Correct 218 ms 5216 KB Output is correct
65 Correct 212 ms 5240 KB Output is correct
66 Correct 142 ms 5232 KB Output is correct
67 Correct 128 ms 5228 KB Output is correct
68 Correct 60 ms 5140 KB Output is correct
69 Correct 60 ms 5260 KB Output is correct
70 Correct 44 ms 5240 KB Output is correct
71 Correct 51 ms 5288 KB Output is correct
72 Correct 40 ms 5180 KB Output is correct
73 Correct 55 ms 5416 KB Output is correct
74 Correct 92 ms 5496 KB Output is correct
75 Correct 105 ms 5504 KB Output is correct
76 Correct 93 ms 5396 KB Output is correct
77 Correct 102 ms 5572 KB Output is correct
78 Correct 112 ms 5452 KB Output is correct
79 Correct 99 ms 5384 KB Output is correct
80 Correct 95 ms 5444 KB Output is correct
81 Correct 115 ms 5444 KB Output is correct
82 Correct 89 ms 5484 KB Output is correct
83 Correct 123 ms 5316 KB Output is correct
84 Correct 110 ms 5440 KB Output is correct
85 Correct 109 ms 5432 KB Output is correct
86 Correct 154 ms 5444 KB Output is correct
87 Correct 125 ms 5380 KB Output is correct
88 Correct 127 ms 5380 KB Output is correct
89 Correct 129 ms 5316 KB Output is correct
90 Correct 135 ms 5316 KB Output is correct
91 Correct 132 ms 5440 KB Output is correct
92 Correct 131 ms 5316 KB Output is correct