답안 #1012534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1012534	2024-07-02T09:34:16 Z	toast12	Mecho (IOI09_mecho)	C++14	73 / 100	106 ms	6928 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-lo)/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	1 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Correct	0 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	48 ms	6896 KB	Output isn't correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Incorrect	1 ms	348 KB	Output isn't correct
13	Incorrect	1 ms	460 KB	Output isn't correct
14	Correct	0 ms	508 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	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	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	452 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 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	5 ms	1712 KB	Output is correct
34	Correct	5 ms	1700 KB	Output is correct
35	Correct	12 ms	1748 KB	Output is correct
36	Correct	7 ms	2080 KB	Output is correct
37	Correct	10 ms	2108 KB	Output is correct
38	Correct	16 ms	2112 KB	Output is correct
39	Correct	12 ms	2568 KB	Output is correct
40	Correct	12 ms	2508 KB	Output is correct
41	Correct	24 ms	2508 KB	Output is correct
42	Correct	10 ms	3012 KB	Output is correct
43	Correct	10 ms	2964 KB	Output is correct
44	Correct	37 ms	3008 KB	Output is correct
45	Correct	13 ms	3524 KB	Output is correct
46	Correct	12 ms	3512 KB	Output is correct
47	Correct	33 ms	3528 KB	Output is correct
48	Correct	15 ms	4096 KB	Output is correct
49	Correct	13 ms	4104 KB	Output is correct
50	Correct	40 ms	4116 KB	Output is correct
51	Correct	17 ms	4756 KB	Output is correct
52	Correct	16 ms	4716 KB	Output is correct
53	Correct	48 ms	4716 KB	Output is correct
54	Correct	27 ms	5392 KB	Output is correct
55	Correct	19 ms	5336 KB	Output is correct
56	Correct	62 ms	5372 KB	Output is correct
57	Correct	36 ms	6080 KB	Output is correct
58	Correct	25 ms	6080 KB	Output is correct
59	Correct	69 ms	6108 KB	Output is correct
60	Correct	29 ms	6840 KB	Output is correct
61	Correct	27 ms	6876 KB	Output is correct
62	Correct	76 ms	6844 KB	Output is correct
63	Correct	79 ms	6896 KB	Output is correct
64	Correct	104 ms	6860 KB	Output is correct
65	Correct	105 ms	6856 KB	Output is correct
66	Correct	80 ms	6868 KB	Output is correct
67	Correct	106 ms	6852 KB	Output is correct
68	Correct	65 ms	6884 KB	Output is correct
69	Correct	42 ms	6876 KB	Output is correct
70	Correct	41 ms	6864 KB	Output is correct
71	Correct	38 ms	6880 KB	Output is correct
72	Incorrect	51 ms	6920 KB	Output isn't correct
73	Incorrect	30 ms	6900 KB	Output isn't correct
74	Correct	51 ms	6844 KB	Output is correct
75	Correct	62 ms	6928 KB	Output is correct
76	Correct	41 ms	6900 KB	Output is correct
77	Correct	46 ms	6872 KB	Output is correct
78	Correct	51 ms	6888 KB	Output is correct
79	Correct	38 ms	6896 KB	Output is correct
80	Correct	52 ms	6880 KB	Output is correct
81	Correct	48 ms	6872 KB	Output is correct
82	Correct	56 ms	6896 KB	Output is correct
83	Correct	73 ms	6864 KB	Output is correct
84	Correct	42 ms	6864 KB	Output is correct
85	Correct	49 ms	6856 KB	Output is correct
86	Correct	64 ms	6872 KB	Output is correct
87	Correct	61 ms	6860 KB	Output is correct
88	Correct	47 ms	6868 KB	Output is correct
89	Correct	44 ms	6740 KB	Output is correct
90	Correct	71 ms	6860 KB	Output is correct
91	Correct	72 ms	6884 KB	Output is correct
92	Correct	44 ms	6868 KB	Output is correct