oj.uz

답안 #996965

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996965 2024-06-11T14:16:35 Z imann Mecho (IOI09_mecho) C++17
39 / 100
 121 ms 6908 KB 
#include <iostream>
#include <array>
#include <string>
#include <queue>

const int MAX_N = 800 + 1;
const int INF = 1e9;

std::array<std::string, MAX_N> grid;
std::array<std::array<int, MAX_N>, MAX_N> minuteToBeHive, level;

void bfs(int n) {
    std::queue<std::pair<int, int>> q;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            minuteToBeHive[i][j] = INF;
            if (grid[i][j] == 'H') {
                q.push({i, j});
                minuteToBeHive[i][j] = 0;
            }
        }
    }

    while (!q.empty()) {
        auto v = q.front();
        q.pop();
        if (v.first > 0) {
            if (grid[v.first - 1][v.second] == 'G') {
                if (minuteToBeHive[v.first - 1][v.second] == INF)
                    q.push({v.first - 1, v.second});
                minuteToBeHive[v.first - 1][v.second] = std::min(minuteToBeHive[v.first - 1][v.second], minuteToBeHive[v.first][v.second] + 1);
            }
        }
        if (v.first < n - 1) {
            if (grid[v.first + 1][v.second] == 'G') {
                if (minuteToBeHive[v.first + 1][v.second] == INF)
                    q.push({v.first + 1, v.second});
                minuteToBeHive[v.first + 1][v.second] = std::min(minuteToBeHive[v.first + 1][v.second], minuteToBeHive[v.first][v.second] + 1);
            }
        }
        if (v.second > 0) {
            if (grid[v.first][v.second - 1] == 'G') {
                if (minuteToBeHive[v.first][v.second - 1] == INF)
                    q.push({v.first, v.second - 1});
                minuteToBeHive[v.first][v.second - 1] = std::min(minuteToBeHive[v.first][v.second - 1], minuteToBeHive[v.first][v.second] + 1);
            }
        }
        if (v.second < n - 1) {
            if (grid[v.first][v.second - 1] == 'G') {
                if (minuteToBeHive[v.first][v.second + 1] == INF)
                    q.push({v.first, v.second + 1});
                minuteToBeHive[v.first][v.second + 1] = std::min(minuteToBeHive[v.first][v.second + 1], minuteToBeHive[v.first][v.second] + 1);
            }
        }
    }
}

bool bfs2(int n, int s, int startMinute) {
    std::pair<int, int> start, end;
    std::queue<std::pair<int, int>> q;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            level[i][j] = INF;
            if (grid[i][j] == 'M')
                start = {i, j};
            if (grid[i][j] == 'D')
                end = {i, j};
        }
    }
    q.push(start);
    level[start.first][start.second] = 0;
    while (!q.empty()) {
        auto v = q.front();
        q.pop();
        if (v.first > 0) {
            if ((grid[v.first - 1][v.second] == 'G' || grid[v.first - 1][v.second] == 'D') && (startMinute + (level[v.first][v.second] + 1) / s < minuteToBeHive[v.first - 1][v.second])) {
                if (level[v.first - 1][v.second] == INF)
                    q.push({v.first - 1, v.second});
                level[v.first - 1][v.second] = std::min(level[v.first - 1][v.second], level[v.first][v.second] + 1);
            }
        }
        if (v.first < n - 1) {
            if ((grid[v.first + 1][v.second] == 'G' || grid[v.first + 1][v.second] == 'D') && (startMinute + (level[v.first][v.second] + 1) / s < minuteToBeHive[v.first + 1][v.second])) {
                if (level[v.first + 1][v.second] == INF)
                    q.push({v.first + 1, v.second});
                level[v.first + 1][v.second] = std::min(level[v.first + 1][v.second], level[v.first][v.second] + 1);
            }
        }
        if (v.second > 0) {
            if ((grid[v.first][v.second - 1] == 'G' || grid[v.first][v.second - 1] == 'D') && (startMinute + (level[v.first][v.second] + 1) / s < minuteToBeHive[v.first][v.second - 1])) {
                if (level[v.first][v.second - 1] == INF)
                    q.push({v.first, v.second - 1});
                level[v.first][v.second - 1] = std::min(level[v.first][v.second - 1], level[v.first][v.second] + 1);
            }
        }
        if (v.second < n - 1) {
            if ((grid[v.first][v.second + 1] == 'G' || grid[v.first][v.second + 1] == 'D') && (startMinute + (level[v.first][v.second] + 1) / s < minuteToBeHive[v.first][v.second + 1])) {
                if (level[v.first][v.second + 1] == INF)
                    q.push({v.first, v.second + 1});
                level[v.first][v.second + 1] = std::min(level[v.first][v.second + 1], level[v.first][v.second] + 1);
            }
        }
    }
    return level[end.first][end.second] != INF;
}

int solve(int n, int s) {
    bfs(n);
    int l = 0, r = n;
    while (r - l > 1) {
        int mid = (r + l) / 2;
        if (bfs2(n, s, mid)) {
            l = mid;
        } else {
            r = mid;
        }
    }

    if (bfs2(n, s, l))
        return l;
    return -1;
}

int main() {
    int n, s; std::cin >> n >> s;
    for (int i = 0; i < n; ++i) {
        std::cin >> grid[i];
    }
    std::cout << solve(n, s) << std::endl;
}

Subtask #1
39.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 60 ms 6156 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 1 ms 4700 KB Output isn't correct
13 Incorrect 1 ms 2652 KB Output isn't correct
14 Correct 1 ms 4576 KB Output is correct
15 Incorrect 1 ms 2396 KB Output isn't correct
16 Incorrect 1 ms 2396 KB Output isn't correct
17 Incorrect 1 ms 2396 KB Output isn't correct
18 Incorrect 1 ms 2396 KB Output isn't correct
19 Incorrect 0 ms 2396 KB Output isn't correct
20 Incorrect 1 ms 2396 KB Output isn't correct
21 Incorrect 1 ms 2648 KB Output isn't correct
22 Incorrect 1 ms 2652 KB Output isn't correct
23 Incorrect 1 ms 2652 KB Output isn't correct
24 Incorrect 1 ms 2652 KB Output isn't correct
25 Incorrect 1 ms 4696 KB Output isn't correct
26 Incorrect 1 ms 4700 KB Output isn't correct
27 Incorrect 1 ms 4700 KB Output isn't correct
28 Incorrect 1 ms 4700 KB Output isn't correct
29 Incorrect 1 ms 4700 KB Output isn't correct
30 Incorrect 1 ms 4696 KB Output isn't correct
31 Incorrect 1 ms 4700 KB Output isn't correct
32 Incorrect 1 ms 4700 KB Output isn't correct
33 Incorrect 14 ms 4956 KB Output isn't correct
34 Incorrect 10 ms 5016 KB Output isn't correct
35 Incorrect 13 ms 4832 KB Output isn't correct
36 Incorrect 19 ms 4956 KB Output isn't correct
37 Incorrect 13 ms 4956 KB Output isn't correct
38 Incorrect 17 ms 4956 KB Output isn't correct
39 Incorrect 22 ms 4956 KB Output isn't correct
40 Incorrect 16 ms 4956 KB Output isn't correct
41 Incorrect 22 ms 5132 KB Output isn't correct
42 Incorrect 27 ms 5212 KB Output isn't correct
43 Incorrect 20 ms 5212 KB Output isn't correct
44 Incorrect 28 ms 5212 KB Output isn't correct
45 Incorrect 36 ms 5204 KB Output isn't correct
46 Incorrect 28 ms 5468 KB Output isn't correct
47 Incorrect 31 ms 5504 KB Output isn't correct
48 Incorrect 43 ms 5468 KB Output isn't correct
49 Incorrect 31 ms 5464 KB Output isn't correct
50 Incorrect 37 ms 5464 KB Output isn't correct
51 Incorrect 50 ms 5724 KB Output isn't correct
52 Incorrect 36 ms 5720 KB Output isn't correct
53 Incorrect 47 ms 5736 KB Output isn't correct
54 Incorrect 62 ms 5980 KB Output isn't correct
55 Incorrect 42 ms 5980 KB Output isn't correct
56 Incorrect 53 ms 5980 KB Output isn't correct
57 Incorrect 66 ms 6340 KB Output isn't correct
58 Incorrect 48 ms 6456 KB Output isn't correct
59 Incorrect 60 ms 6236 KB Output isn't correct
60 Incorrect 77 ms 6492 KB Output isn't correct
61 Incorrect 61 ms 6488 KB Output isn't correct
62 Incorrect 73 ms 6492 KB Output isn't correct
63 Incorrect 44 ms 6404 KB Output isn't correct
64 Incorrect 121 ms 6604 KB Output isn't correct
65 Incorrect 99 ms 6484 KB Output isn't correct
66 Incorrect 47 ms 6444 KB Output isn't correct
67 Correct 73 ms 6492 KB Output is correct
68 Incorrect 38 ms 6748 KB Output isn't correct
69 Incorrect 37 ms 6648 KB Output isn't correct
70 Incorrect 33 ms 6612 KB Output isn't correct
71 Incorrect 33 ms 6484 KB Output isn't correct
72 Incorrect 30 ms 6480 KB Output isn't correct
73 Incorrect 35 ms 6748 KB Output isn't correct
74 Correct 43 ms 6740 KB Output is correct
75 Correct 50 ms 6792 KB Output is correct
76 Correct 56 ms 6812 KB Output is correct
77 Correct 52 ms 6792 KB Output is correct
78 Correct 56 ms 6744 KB Output is correct
79 Correct 44 ms 6744 KB Output is correct
80 Correct 60 ms 6856 KB Output is correct
81 Correct 70 ms 6860 KB Output is correct
82 Correct 49 ms 6740 KB Output is correct
83 Correct 57 ms 6748 KB Output is correct
84 Correct 64 ms 6492 KB Output is correct
85 Correct 65 ms 6736 KB Output is correct
86 Correct 62 ms 6716 KB Output is correct
87 Correct 55 ms 6744 KB Output is correct
88 Correct 57 ms 6908 KB Output is correct
89 Correct 63 ms 6740 KB Output is correct
90 Correct 64 ms 6668 KB Output is correct
91 Correct 63 ms 6744 KB Output is correct
92 Correct 63 ms 6740 KB Output is correct