| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 608673 |
2022-07-27T09:01:15 Z |
Mazaalai |
Mecho (IOI09_mecho) |
C++17 |
|
228 ms |
5724 KB |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define LINE "---------------\n"
#define sz(a) (int)a.size()
using namespace std;
using PII = pair <int, int>;
const int N = 805;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
int n, m, X1, Y1, X2, Y2;
vector <PII> hives;
int mat[N][N], maze[N][N];
bool check(int lim) {
memcpy(maze, mat, sizeof(mat));
queue <PII> bfs1, bfs2;
for (auto& [a, b] : hives) bfs2.push({a, b});
for (int i = 0; i < lim; i++) {
int rep = sz(bfs2);
for (int j = 0; j < rep; j++) {
int x, y; tie(x, y) = bfs2.front(); bfs2.pop();
for (int a = 0; a < 4; a++) {
int xx = dx[a] + x;
int yy = dy[a] + y;
if (xx < 1 || xx > n || yy < 1 || yy > n || maze[xx][yy] == 1) continue;
maze[xx][yy] = 1;
bfs2.push({xx, yy});
}
}
}
// cout << LINE;
// for (int i = 1; i <= n; i++)
// for (int j = 1; j <= n; j++) cout << maze[i][j] << " \n"[j==n];
mat[X1][Y1] = 2;
bfs1.push({X1, Y1});
while (maze[X2][Y2] == 0) {
// move bear
for (int i = 0; i < m; i++) {
int rep = sz(bfs1);
for (int j = 0; j < rep; j++) {
int x, y; tie(x, y) = bfs1.front(); bfs1.pop();
if (maze[x][y] == 1) continue;
for (int a = 0; a < 4; a++) {
int xx = dx[a] + x;
int yy = dy[a] + y;
if (xx < 1 || xx > n || yy < 1 || yy > n || maze[xx][yy] != 0) continue;
maze[xx][yy] = 2;
bfs1.push({xx, yy});
}
}
}
// cout << LINE;
// cout << LINE;
// for (int i = 1; i <= n; i++)
// for (int j = 1; j <= n; j++) cout << maze[i][j] << " \n"[j==n];
if (maze[X2][Y2] != 0) return 1;
// spread bees
int rep = sz(bfs2);
for (int j = 0; j < rep; j++) {
int x, y; tie(x, y) = bfs2.front(); bfs2.pop();
for (int a = 0; a < 4; a++) {
int xx = dx[a] + x;
int yy = dy[a] + y;
if (xx < 1 || xx > n || yy < 1 || yy > n || maze[xx][yy] == 1) continue;
maze[xx][yy] = 1;
bfs2.push({xx, yy});
}
}
// cout << LINE;
// for (int i = 1; i <= n; i++)
// for (int j = 1; j <= n; j++) cout << maze[i][j] << " \n"[j==n];
}
return 0;
}
signed main() {
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// freopen("0.in", "r", stdin);
// freopen("0.out", "w", stdout);
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
char x; cin >> x;
if (x == 'T') { // tree
mat[i][j] = 1;
} else if (x == 'G') { // grass
mat[i][j] = 0;
} else if (x == 'M') { // mecho the bear
tie(X1, Y1) = mp(i, j);
mat[i][j] = 0;
} else if (x == 'D') { // home of the mecho
mat[i][j] = 0;
tie(X2, Y2) = mp(i, j);
} else if (x == 'H') { // bee hive
mat[i][j] = 1;
hives.pb({i, j});
}
}
int l = 0, r = 2*n, ans = -1;
while (l <= r) {
int m = (l+r)>>1;
if (check(m)) {
l = m+1;
ans = m;
} else {
r = m-1;
}
}
cout << ans << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2848 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
2772 KB |
Output isn't correct |
| 3 |
Correct |
3 ms |
2772 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
2772 KB |
Output isn't correct |
| 5 |
Correct |
2 ms |
2772 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
2772 KB |
Output isn't correct |
| 7 |
Incorrect |
152 ms |
5484 KB |
Output isn't correct |
| 8 |
Correct |
2 ms |
2900 KB |
Output is correct |
| 9 |
Correct |
3 ms |
2892 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2900 KB |
Output is correct |
| 11 |
Correct |
2 ms |
2900 KB |
Output is correct |
| 12 |
Incorrect |
2 ms |
3028 KB |
Output isn't correct |
| 13 |
Correct |
3 ms |
3028 KB |
Output is correct |
| 14 |
Correct |
3 ms |
3028 KB |
Output is correct |
| 15 |
Incorrect |
3 ms |
2900 KB |
Output isn't correct |
| 16 |
Incorrect |
3 ms |
2900 KB |
Output isn't correct |
| 17 |
Incorrect |
2 ms |
2900 KB |
Output isn't correct |
| 18 |
Incorrect |
3 ms |
2900 KB |
Output isn't correct |
| 19 |
Incorrect |
4 ms |
2948 KB |
Output isn't correct |
| 20 |
Incorrect |
3 ms |
2900 KB |
Output isn't correct |
| 21 |
Incorrect |
2 ms |
2900 KB |
Output isn't correct |
| 22 |
Incorrect |
3 ms |
2900 KB |
Output isn't correct |
| 23 |
Incorrect |
3 ms |
2900 KB |
Output isn't correct |
| 24 |
Incorrect |
2 ms |
2900 KB |
Output isn't correct |
| 25 |
Incorrect |
2 ms |
3028 KB |
Output isn't correct |
| 26 |
Incorrect |
3 ms |
3028 KB |
Output isn't correct |
| 27 |
Incorrect |
3 ms |
3028 KB |
Output isn't correct |
| 28 |
Incorrect |
4 ms |
3028 KB |
Output isn't correct |
| 29 |
Incorrect |
3 ms |
3028 KB |
Output isn't correct |
| 30 |
Incorrect |
4 ms |
3028 KB |
Output isn't correct |
| 31 |
Incorrect |
3 ms |
3028 KB |
Output isn't correct |
| 32 |
Incorrect |
3 ms |
3028 KB |
Output isn't correct |
| 33 |
Incorrect |
5 ms |
3924 KB |
Output isn't correct |
| 34 |
Incorrect |
6 ms |
3924 KB |
Output isn't correct |
| 35 |
Correct |
15 ms |
3964 KB |
Output is correct |
| 36 |
Incorrect |
6 ms |
4096 KB |
Output isn't correct |
| 37 |
Incorrect |
6 ms |
4052 KB |
Output isn't correct |
| 38 |
Correct |
18 ms |
4128 KB |
Output is correct |
| 39 |
Incorrect |
6 ms |
4208 KB |
Output isn't correct |
| 40 |
Incorrect |
6 ms |
4284 KB |
Output isn't correct |
| 41 |
Correct |
22 ms |
4180 KB |
Output is correct |
| 42 |
Incorrect |
6 ms |
4436 KB |
Output isn't correct |
| 43 |
Incorrect |
11 ms |
4436 KB |
Output isn't correct |
| 44 |
Correct |
24 ms |
4444 KB |
Output is correct |
| 45 |
Incorrect |
7 ms |
4564 KB |
Output isn't correct |
| 46 |
Incorrect |
8 ms |
4520 KB |
Output isn't correct |
| 47 |
Correct |
29 ms |
4604 KB |
Output is correct |
| 48 |
Incorrect |
8 ms |
4692 KB |
Output isn't correct |
| 49 |
Incorrect |
12 ms |
4692 KB |
Output isn't correct |
| 50 |
Correct |
40 ms |
4760 KB |
Output is correct |
| 51 |
Incorrect |
9 ms |
4920 KB |
Output isn't correct |
| 52 |
Incorrect |
14 ms |
4908 KB |
Output isn't correct |
| 53 |
Correct |
45 ms |
4912 KB |
Output is correct |
| 54 |
Incorrect |
11 ms |
5060 KB |
Output isn't correct |
| 55 |
Incorrect |
14 ms |
4948 KB |
Output isn't correct |
| 56 |
Correct |
39 ms |
5060 KB |
Output is correct |
| 57 |
Incorrect |
10 ms |
5204 KB |
Output isn't correct |
| 58 |
Incorrect |
12 ms |
5232 KB |
Output isn't correct |
| 59 |
Correct |
49 ms |
5216 KB |
Output is correct |
| 60 |
Incorrect |
11 ms |
5384 KB |
Output isn't correct |
| 61 |
Incorrect |
14 ms |
5332 KB |
Output isn't correct |
| 62 |
Correct |
81 ms |
5376 KB |
Output is correct |
| 63 |
Correct |
196 ms |
5372 KB |
Output is correct |
| 64 |
Correct |
219 ms |
5376 KB |
Output is correct |
| 65 |
Correct |
175 ms |
5372 KB |
Output is correct |
| 66 |
Correct |
184 ms |
5380 KB |
Output is correct |
| 67 |
Correct |
171 ms |
5372 KB |
Output is correct |
| 68 |
Correct |
169 ms |
5488 KB |
Output is correct |
| 69 |
Correct |
166 ms |
5400 KB |
Output is correct |
| 70 |
Correct |
193 ms |
5364 KB |
Output is correct |
| 71 |
Correct |
228 ms |
5404 KB |
Output is correct |
| 72 |
Correct |
197 ms |
5400 KB |
Output is correct |
| 73 |
Correct |
165 ms |
5668 KB |
Output is correct |
| 74 |
Correct |
170 ms |
5676 KB |
Output is correct |
| 75 |
Correct |
148 ms |
5672 KB |
Output is correct |
| 76 |
Correct |
190 ms |
5680 KB |
Output is correct |
| 77 |
Correct |
152 ms |
5676 KB |
Output is correct |
| 78 |
Correct |
155 ms |
5612 KB |
Output is correct |
| 79 |
Correct |
167 ms |
5632 KB |
Output is correct |
| 80 |
Correct |
155 ms |
5648 KB |
Output is correct |
| 81 |
Correct |
177 ms |
5644 KB |
Output is correct |
| 82 |
Correct |
183 ms |
5636 KB |
Output is correct |
| 83 |
Correct |
186 ms |
5600 KB |
Output is correct |
| 84 |
Correct |
160 ms |
5596 KB |
Output is correct |
| 85 |
Correct |
171 ms |
5620 KB |
Output is correct |
| 86 |
Correct |
171 ms |
5680 KB |
Output is correct |
| 87 |
Correct |
197 ms |
5724 KB |
Output is correct |
| 88 |
Correct |
159 ms |
5540 KB |
Output is correct |
| 89 |
Correct |
168 ms |
5540 KB |
Output is correct |
| 90 |
Correct |
187 ms |
5536 KB |
Output is correct |
| 91 |
Correct |
171 ms |
5540 KB |
Output is correct |
| 92 |
Correct |
134 ms |
5520 KB |
Output is correct |
