oj.uz

답안 #1012637

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012637 2024-07-02T12:40:38 Z toast12 Mecho (IOI09_mecho) C++14
94 / 100
 135 ms 11408 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 800;
 
int n, s;
vector<vector<char>> grid;
vector<vector<int>> dist;
 
int honey;
 
bool reachable(int mecho, int bee) {
    return ((mecho-honey)/s < bee-honey) && mecho != -1; 
}
 
void bfs(queue<pair<int, int>> &q, vector<vector<int>> &d) {
    while (!q.empty()) {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        if (x < 1 || y < 1 || x > n || y > n)
            continue;
        if (d[x+1][y] == -1 && grid[x+1][y] == '.' && reachable(d[x][y]+1, dist[x+1][y])) {
            q.push({x+1, y});
            d[x+1][y] = d[x][y]+1;
        }
        if (d[x-1][y] == -1 && grid[x-1][y] == '.' && reachable(d[x][y]+1, dist[x-1][y])) {
            q.push({x-1, y});
            d[x-1][y] = d[x][y]+1;
        }
        if (d[x][y+1] == -1 && grid[x][y+1] == '.' && reachable(d[x][y]+1, dist[x][y+1])) {
            q.push({x, y+1});
            d[x][y+1] = d[x][y]+1;
        }
        if (d[x][y-1] == -1 && grid[x][y-1] == '.' && reachable(d[x][y]+1, dist[x][y-1])) {
            q.push({x, y-1});
            d[x][y-1] = d[x][y]+1;
        }
    }
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cin >> n >> s;
    grid.resize(n+2, vector<char>(n+2, '.'));
    pair<int, int> start, end;
    queue<pair<int, int>> q;
    dist.resize(n+2, vector<int>(n+2, -1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> grid[i][j];
            if (grid[i][j] == 'G')
                grid[i][j] = '.';
            else if (grid[i][j] == 'T')
                grid[i][j] = 'X';
            else if (grid[i][j] == 'M') {
                start = {i, j};
                grid[i][j] = '.';
            }
            else if (grid[i][j] == 'D') {
                end = {i, j};
                grid[i][j] = 'X';
            }
            else {
                q.push({i, j});
                dist[i][j] = 0;
            }
        }
    }
    // distance for bees
    while (!q.empty()) {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        if (x < 1 || y < 1 || x > n || y > n)
            continue;
        if (dist[x+1][y] == -1 && grid[x+1][y] == '.') {
            q.push({x+1, y});
            dist[x+1][y] = dist[x][y]+1;
        }
        if (dist[x-1][y] == -1 && grid[x-1][y] == '.') {
            q.push({x-1, y});
            dist[x-1][y] = dist[x][y]+1;
        }
        if (dist[x][y+1] == -1 && grid[x][y+1] == '.') {
            q.push({x, y+1});
            dist[x][y+1] = dist[x][y]+1;
        }
        if (dist[x][y-1] == -1 && grid[x][y-1] == '.') {
            q.push({x, y-1});
            dist[x][y-1] = dist[x][y]+1;
        }
    }
    int lo = 0, hi = n*n;
    int ans = -1;
    while (lo <= hi) {
        int mid = (lo+hi)/2;
        vector<vector<int>> d(n+2, vector<int>(n+2, -1));
        d[start.first][start.second] = mid;
        honey = mid;
        if (dist[start.first][start.second] <= mid)
            q.pop();
        q.push(start);
        bfs(q, d);
        bool poss = reachable(d[end.first-1][end.second], dist[end.first-1][end.second]);
        poss |= reachable(d[end.first+1][end.second], dist[end.first+1][end.second]);
        poss |= reachable(d[end.first][end.second-1], dist[end.first][end.second-1]);
        poss |= reachable(d[end.first][end.second+1], dist[end.first][end.second+1]);
        if (poss) {
            lo = mid+1;
            ans = mid;
        }
        else {
            hi = mid-1;
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
94.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 50 ms 7144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 408 KB Output is correct
17 Correct 0 ms 452 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 352 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 456 KB Output is correct
25 Correct 1 ms 412 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 460 KB Output is correct
29 Correct 1 ms 456 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Runtime error 1 ms 604 KB Execution killed with signal 6
33 Correct 5 ms 1700 KB Output is correct
34 Correct 5 ms 1696 KB Output is correct
35 Correct 15 ms 1700 KB Output is correct
36 Correct 6 ms 1952 KB Output is correct
37 Correct 6 ms 2080 KB Output is correct
38 Correct 17 ms 1952 KB Output is correct
39 Correct 9 ms 2488 KB Output is correct
40 Runtime error 9 ms 4376 KB Execution killed with signal 6
41 Correct 22 ms 2488 KB Output is correct
42 Correct 11 ms 2968 KB Output is correct
43 Correct 10 ms 2972 KB Output is correct
44 Correct 27 ms 2960 KB Output is correct
45 Correct 13 ms 3544 KB Output is correct
46 Correct 13 ms 3492 KB Output is correct
47 Correct 33 ms 3496 KB Output is correct
48 Correct 15 ms 4108 KB Output is correct
49 Correct 15 ms 4088 KB Output is correct
50 Correct 36 ms 4108 KB Output is correct
51 Correct 20 ms 4716 KB Output is correct
52 Correct 18 ms 4716 KB Output is correct
53 Correct 47 ms 4740 KB Output is correct
54 Correct 20 ms 5400 KB Output is correct
55 Correct 27 ms 5404 KB Output is correct
56 Correct 65 ms 5500 KB Output is correct
57 Correct 25 ms 6108 KB Output is correct
58 Runtime error 20 ms 11356 KB Execution killed with signal 6
59 Runtime error 16 ms 11408 KB Execution killed with signal 6
60 Correct 28 ms 6880 KB Output is correct
61 Correct 26 ms 7080 KB Output is correct
62 Correct 69 ms 6884 KB Output is correct
63 Correct 77 ms 6868 KB Output is correct
64 Correct 135 ms 6872 KB Output is correct
65 Correct 102 ms 6828 KB Output is correct
66 Correct 87 ms 6856 KB Output is correct
67 Correct 85 ms 6852 KB Output is correct
68 Correct 51 ms 6932 KB Output is correct
69 Correct 54 ms 6924 KB Output is correct
70 Correct 39 ms 6928 KB Output is correct
71 Correct 42 ms 6980 KB Output is correct
72 Correct 37 ms 6876 KB Output is correct
73 Correct 30 ms 6876 KB Output is correct
74 Correct 40 ms 6888 KB Output is correct
75 Correct 46 ms 6876 KB Output is correct
76 Correct 41 ms 6928 KB Output is correct
77 Correct 44 ms 6908 KB Output is correct
78 Correct 47 ms 6884 KB Output is correct
79 Correct 37 ms 6884 KB Output is correct
80 Correct 40 ms 6888 KB Output is correct
81 Correct 44 ms 6880 KB Output is correct
82 Correct 41 ms 6912 KB Output is correct
83 Correct 48 ms 6860 KB Output is correct
84 Correct 47 ms 6864 KB Output is correct
85 Correct 48 ms 6880 KB Output is correct
86 Correct 48 ms 6888 KB Output is correct
87 Correct 47 ms 6860 KB Output is correct
88 Correct 48 ms 6864 KB Output is correct
89 Correct 50 ms 6748 KB Output is correct
90 Correct 50 ms 6888 KB Output is correct
91 Correct 50 ms 6912 KB Output is correct
92 Correct 53 ms 6892 KB Output is correct