답안 #1012544

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1012544	2024-07-02T10:18:26 Z	toast12	Mecho (IOI09_mecho)	C++14	73 / 100	130 ms	6968 KB

mecho

#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/s)+honey < bee) || (bee == -1)) && (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] != 'X' && 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] != 'X' && 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] != 'X' && 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] != 'X' && 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};
            else if (grid[i][j] == 'D')
                end = {i, j};
            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] != 'X') {
            q.push({x+1, y});
            dist[x+1][y] = dist[x][y]+1;
        }
        if (dist[x-1][y] == -1 && grid[x-1][y] != 'X') {
            q.push({x-1, y});
            dist[x-1][y] = dist[x][y]+1;
        }
        if (dist[x][y+1] == -1 && grid[x][y+1] != 'X') {
            q.push({x, y+1});
            dist[x][y+1] = dist[x][y]+1;
        }
        if (dist[x][y-1] == -1 && grid[x][y-1] != 'X') {
            q.push({x, y-1});
            dist[x][y-1] = dist[x][y]+1;
        }
    }
    int lo = 0, hi = MAXN*MAXN;
    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] = 0;
        honey = mid;
        q.push(start);
        bfs(q, d);
        if (reachable(d[end.first][end.second], dist[end.first][end.second])) {
            lo = mid+1;
            ans = mid;
        }
        else {
            hi = mid;
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1

73.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Correct	1 ms	348 KB	Output is correct
4	Incorrect	0 ms	348 KB	Output isn't correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	0 ms	348 KB	Output isn't correct
7	Incorrect	57 ms	6852 KB	Output isn't correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Incorrect	0 ms	348 KB	Output isn't correct
13	Incorrect	0 ms	348 KB	Output isn't correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	460 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	6 ms	1704 KB	Output is correct
34	Correct	5 ms	1704 KB	Output is correct
35	Correct	14 ms	1704 KB	Output is correct
36	Correct	8 ms	2108 KB	Output is correct
37	Correct	7 ms	1948 KB	Output is correct
38	Correct	19 ms	2084 KB	Output is correct
39	Correct	10 ms	2556 KB	Output is correct
40	Correct	9 ms	2496 KB	Output is correct
41	Correct	23 ms	2544 KB	Output is correct
42	Correct	12 ms	2972 KB	Output is correct
43	Correct	9 ms	2960 KB	Output is correct
44	Correct	27 ms	2976 KB	Output is correct
45	Correct	13 ms	3488 KB	Output is correct
46	Correct	12 ms	3496 KB	Output is correct
47	Correct	36 ms	3548 KB	Output is correct
48	Correct	14 ms	4360 KB	Output is correct
49	Correct	14 ms	4092 KB	Output is correct
50	Correct	45 ms	4100 KB	Output is correct
51	Correct	17 ms	4744 KB	Output is correct
52	Correct	16 ms	4712 KB	Output is correct
53	Correct	52 ms	4728 KB	Output is correct
54	Correct	20 ms	5404 KB	Output is correct
55	Correct	34 ms	5332 KB	Output is correct
56	Correct	87 ms	5368 KB	Output is correct
57	Correct	25 ms	6104 KB	Output is correct
58	Correct	37 ms	6104 KB	Output is correct
59	Correct	66 ms	6120 KB	Output is correct
60	Correct	29 ms	6864 KB	Output is correct
61	Correct	29 ms	6880 KB	Output is correct
62	Correct	86 ms	6868 KB	Output is correct
63	Correct	90 ms	6864 KB	Output is correct
64	Correct	130 ms	6828 KB	Output is correct
65	Correct	120 ms	6868 KB	Output is correct
66	Correct	98 ms	6824 KB	Output is correct
67	Correct	96 ms	6860 KB	Output is correct
68	Correct	53 ms	6872 KB	Output is correct
69	Correct	58 ms	6856 KB	Output is correct
70	Correct	44 ms	6884 KB	Output is correct
71	Correct	43 ms	6892 KB	Output is correct
72	Incorrect	38 ms	6848 KB	Output isn't correct
73	Incorrect	33 ms	6860 KB	Output isn't correct
74	Correct	42 ms	6860 KB	Output is correct
75	Correct	48 ms	6900 KB	Output is correct
76	Correct	44 ms	6928 KB	Output is correct
77	Correct	44 ms	6876 KB	Output is correct
78	Correct	57 ms	6900 KB	Output is correct
79	Correct	45 ms	6908 KB	Output is correct
80	Correct	44 ms	6888 KB	Output is correct
81	Correct	50 ms	6904 KB	Output is correct
82	Correct	42 ms	6892 KB	Output is correct
83	Correct	77 ms	6876 KB	Output is correct
84	Correct	57 ms	6900 KB	Output is correct
85	Correct	49 ms	6896 KB	Output is correct
86	Correct	76 ms	6968 KB	Output is correct
87	Correct	50 ms	6864 KB	Output is correct
88	Correct	57 ms	6888 KB	Output is correct
89	Correct	52 ms	6748 KB	Output is correct
90	Correct	52 ms	6928 KB	Output is correct
91	Correct	63 ms	6864 KB	Output is correct
92	Correct	53 ms	6852 KB	Output is correct