#include <bits/stdc++.h>
#define MAX_N 801
using namespace std;
int n, s;
char grid[MAX_N][MAX_N];
bool visited[MAX_N][MAX_N];
int beed[MAX_N][MAX_N];
int steps[MAX_N][MAX_N];
bool check(int t) {
vector<pair<int, int>> hives;
pair<int, int> mecho_pos, home_pos;
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
beed[i][j] = n * n;
visited[i][j] = false;
steps[i][j] = n * n;
if(grid[i][j] == 'H') {
hives.push_back({i, j});
}
if(grid[i][j] == 'M') {
mecho_pos = {i, j};
}
if(grid[i][j] == 'D') {
home_pos = {i, j};
}
}
}
queue<pair<int, int>> q;
for(auto iter : hives) {
visited[iter.first][iter.second] = true;
beed[iter.first][iter.second] = 0;
q.push(iter);
}
while(!q.empty()) {
pair<int, int> curr = q.front();
q.pop();
if(curr.first + 1 < n && !visited[curr.first + 1][curr.second] && (grid[curr.first + 1][curr.second] == 'G' || grid[curr.first + 1][curr.second] == 'M')) {
visited[curr.first + 1][curr.second] = true;
beed[curr.first + 1][curr.second] = beed[curr.first][curr.second] + 1;
q.push({curr.first + 1, curr.second});
}
if(curr.first - 1 >= 0 && !visited[curr.first - 1][curr.second] && (grid[curr.first - 1][curr.second] == 'G' || grid[curr.first - 1][curr.second] == 'M')) {
visited[curr.first - 1][curr.second] = true;
beed[curr.first - 1][curr.second] = beed[curr.first][curr.second] + 1;
q.push({curr.first - 1, curr.second});
}
if(curr.second + 1 < n && !visited[curr.first][curr.second + 1] && (grid[curr.first][curr.second + 1] == 'G' || grid[curr.first][curr.second + 1] == 'M')) {
visited[curr.first][curr.second + 1] = true;
beed[curr.first][curr.second + 1] = beed[curr.first][curr.second] + 1;
q.push({curr.first, curr.second + 1});
}
if(curr.second - 1 >= 0 && !visited[curr.first][curr.second - 1] && (grid[curr.first][curr.second - 1] == 'G' || grid[curr.first][curr.second - 1] == 'M')) {
visited[curr.first][curr.second - 1] = true;
beed[curr.first][curr.second - 1] = beed[curr.first][curr.second] + 1;
q.push({curr.first, curr.second - 1});
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
visited[i][j] = false;
}
}
visited[mecho_pos.first][mecho_pos.second] = true;
steps[mecho_pos.first][mecho_pos.second] = 0;
q.push(mecho_pos);
while(!q.empty()) {
pair<int, int> curr = q.front();
q.pop();
if(curr.first + 1 < n && !visited[curr.first + 1][curr.second] && (grid[curr.first + 1][curr.second] == 'G' || grid[curr.first + 1][curr.second] == 'M' || grid[curr.first + 1][curr.second] == 'D')) {
visited[curr.first + 1][curr.second] = true;
steps[curr.first + 1][curr.second] = steps[curr.first][curr.second] + 1;
q.push({curr.first + 1, curr.second});
}
if(curr.first - 1 >= 0 && !visited[curr.first - 1][curr.second] && (grid[curr.first - 1][curr.second] == 'G' || grid[curr.first - 1][curr.second] == 'M' || grid[curr.first - 1][curr.second] == 'D')) {
visited[curr.first - 1][curr.second] = true;
steps[curr.first - 1][curr.second] = steps[curr.first][curr.second] + 1;
q.push({curr.first - 1, curr.second});
}
if(curr.second + 1 < n && !visited[curr.first][curr.second + 1] && (grid[curr.first][curr.second + 1] == 'G' || grid[curr.first][curr.second + 1] == 'M' || grid[curr.first][curr.second + 1] == 'D')) {
visited[curr.first][curr.second + 1] = true;
steps[curr.first][curr.second + 1] = steps[curr.first][curr.second] + 1;
q.push({curr.first, curr.second + 1});
}
if(curr.second - 1 >= 0 && !visited[curr.first][curr.second - 1] && (grid[curr.first][curr.second - 1] == 'G' || grid[curr.first][curr.second - 1] == 'M' || grid[curr.first][curr.second - 1] == 'D')) {
visited[curr.first][curr.second - 1] = true;
steps[curr.first][curr.second - 1] = steps[curr.first][curr.second] + 1;
q.push({curr.first, curr.second - 1});
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
visited[i][j] = false;
}
}
if(t + 1 > beed[mecho_pos.first][mecho_pos.second]) {
return false;
}
queue<pair<pair<int, int>, int>> newq;
visited[mecho_pos.first][mecho_pos.second] = true;
newq.push({mecho_pos, 0});
while(!newq.empty()) {
pair<pair<int, int>, int> curr = newq.front();
newq.pop();
int tmp = t + 1 + ((curr.second + 1) / (s + 1));
if(curr.first.first + 1 < n && tmp <= beed[curr.first.first + 1][curr.first.second] && !visited[curr.first.first + 1][curr.first.second] && (grid[curr.first.first + 1][curr.first.second] == 'G' || grid[curr.first.first + 1][curr.first.second] == 'M' || grid[curr.first.first + 1][curr.first.second] == 'D')) {
visited[curr.first.first + 1][curr.first.second] = true;
newq.push({{curr.first.first + 1, curr.first.second}, curr.second + 1});
}
if(curr.first.first - 1 >= 0 && tmp <= beed[curr.first.first - 1][curr.first.second] && !visited[curr.first.first - 1][curr.second] && (grid[curr.first.first - 1][curr.first.second] == 'G' || grid[curr.first.first - 1][curr.first.second] == 'M' || grid[curr.first.first - 1][curr.first.second] == 'D')) {
visited[curr.first.first - 1][curr.first.second] = true;
newq.push({{curr.first.first - 1, curr.first.second}, curr.second + 1});
}
if(curr.first.second + 1 < n && tmp <= beed[curr.first.first][curr.first.second + 1] && !visited[curr.first.first][curr.first.second + 1] && (grid[curr.first.first][curr.first.second + 1] == 'G' || grid[curr.first.first][curr.first.second + 1] == 'M' || grid[curr.first.first][curr.first.second + 1] == 'D')) {
visited[curr.first.first][curr.first.second + 1] = true;
newq.push({{curr.first.first, curr.first.second + 1}, curr.second + 1});
}
if(curr.first.second - 1 >= 0 && tmp <= beed[curr.first.first][curr.first.second - 1] && !visited[curr.first.first][curr.first.second - 1] && (grid[curr.first.first][curr.first.second - 1] == 'G' || grid[curr.first.first][curr.first.second - 1] == 'M' || grid[curr.first.first][curr.first.second - 1] == 'D')) {
visited[curr.first.first][curr.first.second - 1] = true;
newq.push({{curr.first.first, curr.first.second - 1}, curr.second + 1});
}
}
return visited[home_pos.first + 1][home_pos.second] || visited[home_pos.first + 1][home_pos.second] || visited[home_pos.first - 1][home_pos.second] || visited[home_pos.first][home_pos.second + 1] || visited[home_pos.first][home_pos.second - 1];
}
int main() {
cin >> n >> s;
for(int i = 0; i < n; i++) {
string tmp;
cin >> tmp;
for(int j = 0; j < n; j++) {
grid[i][j] = tmp[j];
}
}
int l = 0, r = n * n;
int ans = -1;
// true true true ... (true) false false
while(l <= r) {
int mid = l + (r - l) / 2;
if(check(mid)) {
ans = mid;
l = mid + 1;
} else {
r = mid - 1;
}
}
cout << ans;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 7 |
Execution timed out |
1068 ms |
7280 KB |
Time limit exceeded |
| 8 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 12 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 13 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 14 |
Incorrect |
3 ms |
4696 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
2516 KB |
Output isn't correct |
| 16 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 17 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 18 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 19 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 20 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 21 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 22 |
Correct |
1 ms |
2904 KB |
Output is correct |
| 23 |
Incorrect |
1 ms |
2732 KB |
Output isn't correct |
| 24 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 25 |
Incorrect |
2 ms |
4700 KB |
Output isn't correct |
| 26 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 27 |
Incorrect |
2 ms |
4700 KB |
Output isn't correct |
| 28 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 29 |
Incorrect |
3 ms |
4700 KB |
Output isn't correct |
| 30 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 31 |
Incorrect |
2 ms |
4700 KB |
Output isn't correct |
| 32 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 33 |
Incorrect |
38 ms |
5212 KB |
Output isn't correct |
| 34 |
Correct |
31 ms |
5212 KB |
Output is correct |
| 35 |
Correct |
369 ms |
5456 KB |
Output is correct |
| 36 |
Incorrect |
57 ms |
5464 KB |
Output isn't correct |
| 37 |
Correct |
39 ms |
5208 KB |
Output is correct |
| 38 |
Correct |
360 ms |
5576 KB |
Output is correct |
| 39 |
Incorrect |
70 ms |
5212 KB |
Output isn't correct |
| 40 |
Correct |
49 ms |
5208 KB |
Output is correct |
| 41 |
Correct |
380 ms |
5416 KB |
Output is correct |
| 42 |
Incorrect |
87 ms |
5716 KB |
Output isn't correct |
| 43 |
Correct |
62 ms |
5480 KB |
Output is correct |
| 44 |
Correct |
500 ms |
5748 KB |
Output is correct |
| 45 |
Incorrect |
109 ms |
5560 KB |
Output isn't correct |
| 46 |
Correct |
73 ms |
5556 KB |
Output is correct |
| 47 |
Correct |
567 ms |
5712 KB |
Output is correct |
| 48 |
Incorrect |
130 ms |
5972 KB |
Output isn't correct |
| 49 |
Correct |
91 ms |
5760 KB |
Output is correct |
| 50 |
Correct |
643 ms |
6300 KB |
Output is correct |
| 51 |
Incorrect |
152 ms |
5996 KB |
Output isn't correct |
| 52 |
Correct |
106 ms |
5980 KB |
Output is correct |
| 53 |
Correct |
643 ms |
6420 KB |
Output is correct |
| 54 |
Incorrect |
177 ms |
6236 KB |
Output isn't correct |
| 55 |
Correct |
124 ms |
6236 KB |
Output is correct |
| 56 |
Correct |
592 ms |
6480 KB |
Output is correct |
| 57 |
Incorrect |
209 ms |
6480 KB |
Output isn't correct |
| 58 |
Correct |
141 ms |
6236 KB |
Output is correct |
| 59 |
Correct |
587 ms |
7020 KB |
Output is correct |
| 60 |
Incorrect |
244 ms |
6496 KB |
Output isn't correct |
| 61 |
Correct |
160 ms |
6692 KB |
Output is correct |
| 62 |
Incorrect |
448 ms |
7092 KB |
Output isn't correct |
| 63 |
Incorrect |
464 ms |
6660 KB |
Output isn't correct |
| 64 |
Incorrect |
479 ms |
6712 KB |
Output isn't correct |
| 65 |
Incorrect |
483 ms |
6716 KB |
Output isn't correct |
| 66 |
Incorrect |
467 ms |
6704 KB |
Output isn't correct |
| 67 |
Correct |
480 ms |
6748 KB |
Output is correct |
| 68 |
Incorrect |
424 ms |
6748 KB |
Output isn't correct |
| 69 |
Incorrect |
428 ms |
6748 KB |
Output isn't correct |
| 70 |
Incorrect |
424 ms |
6736 KB |
Output isn't correct |
| 71 |
Incorrect |
427 ms |
6748 KB |
Output isn't correct |
| 72 |
Correct |
426 ms |
6984 KB |
Output is correct |
| 73 |
Correct |
589 ms |
7704 KB |
Output is correct |
| 74 |
Execution timed out |
1050 ms |
7048 KB |
Time limit exceeded |
| 75 |
Execution timed out |
1038 ms |
7420 KB |
Time limit exceeded |
| 76 |
Execution timed out |
1008 ms |
7268 KB |
Time limit exceeded |
| 77 |
Execution timed out |
1027 ms |
7184 KB |
Time limit exceeded |
| 78 |
Execution timed out |
1037 ms |
7184 KB |
Time limit exceeded |
| 79 |
Execution timed out |
1004 ms |
7268 KB |
Time limit exceeded |
| 80 |
Execution timed out |
1036 ms |
7216 KB |
Time limit exceeded |
| 81 |
Execution timed out |
1050 ms |
7472 KB |
Time limit exceeded |
| 82 |
Execution timed out |
1028 ms |
7032 KB |
Time limit exceeded |
| 83 |
Execution timed out |
1079 ms |
7060 KB |
Time limit exceeded |
| 84 |
Correct |
965 ms |
7024 KB |
Output is correct |
| 85 |
Incorrect |
888 ms |
7248 KB |
Output isn't correct |
| 86 |
Execution timed out |
1072 ms |
7056 KB |
Time limit exceeded |
| 87 |
Execution timed out |
1044 ms |
7248 KB |
Time limit exceeded |
| 88 |
Execution timed out |
1053 ms |
7348 KB |
Time limit exceeded |
| 89 |
Execution timed out |
1044 ms |
6868 KB |
Time limit exceeded |
| 90 |
Execution timed out |
1008 ms |
6864 KB |
Time limit exceeded |
| 91 |
Execution timed out |
1068 ms |
6996 KB |
Time limit exceeded |
| 92 |
Execution timed out |
1018 ms |
6996 KB |
Time limit exceeded |
