답안 #1012619

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1012619	2024-07-02T12:15:39 Z	toast12	Mecho (IOI09_mecho)	C++14	84 / 100	132 ms	6820 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-honey)/s < bee-honey) && (mecho != -1) && (bee != -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] = mid;
        honey = mid;
        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

84.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	51 ms	6776 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 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	1 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	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	0 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	444 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	604 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	7 ms	1712 KB	Output is correct
34	Correct	6 ms	1704 KB	Output is correct
35	Correct	13 ms	1704 KB	Output is correct
36	Correct	10 ms	2136 KB	Output is correct
37	Correct	7 ms	2108 KB	Output is correct
38	Correct	16 ms	2096 KB	Output is correct
39	Correct	13 ms	2508 KB	Output is correct
40	Correct	8 ms	2500 KB	Output is correct
41	Correct	21 ms	2516 KB	Output is correct
42	Correct	10 ms	3020 KB	Output is correct
43	Correct	10 ms	2960 KB	Output is correct
44	Correct	26 ms	2964 KB	Output is correct
45	Correct	12 ms	3496 KB	Output is correct
46	Correct	14 ms	3492 KB	Output is correct
47	Correct	31 ms	3528 KB	Output is correct
48	Correct	16 ms	4108 KB	Output is correct
49	Correct	14 ms	4064 KB	Output is correct
50	Correct	51 ms	4100 KB	Output is correct
51	Correct	16 ms	4740 KB	Output is correct
52	Correct	16 ms	4716 KB	Output is correct
53	Correct	44 ms	4748 KB	Output is correct
54	Correct	19 ms	5396 KB	Output is correct
55	Correct	18 ms	5392 KB	Output is correct
56	Correct	60 ms	5400 KB	Output is correct
57	Correct	23 ms	6040 KB	Output is correct
58	Correct	22 ms	6064 KB	Output is correct
59	Correct	63 ms	6060 KB	Output is correct
60	Correct	32 ms	6732 KB	Output is correct
61	Correct	26 ms	6724 KB	Output is correct
62	Correct	68 ms	6732 KB	Output is correct
63	Correct	84 ms	6704 KB	Output is correct
64	Correct	132 ms	6744 KB	Output is correct
65	Correct	104 ms	6716 KB	Output is correct
66	Correct	88 ms	6720 KB	Output is correct
67	Correct	83 ms	6724 KB	Output is correct
68	Correct	45 ms	6752 KB	Output is correct
69	Correct	47 ms	6776 KB	Output is correct
70	Correct	40 ms	6724 KB	Output is correct
71	Correct	42 ms	6816 KB	Output is correct
72	Incorrect	36 ms	6760 KB	Output isn't correct
73	Incorrect	32 ms	6820 KB	Output isn't correct
74	Correct	35 ms	6764 KB	Output is correct
75	Correct	40 ms	6784 KB	Output is correct
76	Correct	38 ms	6780 KB	Output is correct
77	Correct	59 ms	6732 KB	Output is correct
78	Correct	51 ms	6724 KB	Output is correct
79	Correct	57 ms	6772 KB	Output is correct
80	Correct	62 ms	6764 KB	Output is correct
81	Correct	42 ms	6780 KB	Output is correct
82	Correct	41 ms	6748 KB	Output is correct
83	Correct	46 ms	6768 KB	Output is correct
84	Correct	45 ms	6768 KB	Output is correct
85	Correct	59 ms	6732 KB	Output is correct
86	Correct	50 ms	6756 KB	Output is correct
87	Correct	73 ms	6756 KB	Output is correct
88	Correct	51 ms	6780 KB	Output is correct
89	Correct	53 ms	6744 KB	Output is correct
90	Correct	57 ms	6708 KB	Output is correct
91	Correct	51 ms	6780 KB	Output is correct
92	Correct	76 ms	6768 KB	Output is correct