# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
470717 |
2021-09-05T08:08:51 Z |
dooompy |
Mecho (IOI09_mecho) |
C++17 |
|
234 ms |
5508 KB |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
bool tree[1005][1005];
int bees[1005][1005];
bool seen[1005][1005];
int n, s, sx, sy, dx, dy;
int mx[]{1, -1, 0, 0};
int my[]{0, 0, 1, -1};
struct bear {
int x, y, time, move;
};
bool able(int time) {
fill(&seen[0][0], &seen[0][0] + sizeof(seen) / sizeof(seen[0][0]), false);
int curtime = time;
// curtime can go into curtime+2 but must finish on curtime+3
queue<bear> q;
q.push({sx, sy, curtime+2, 0});
seen[sx][sy] = true;
if (bees[sx][sy] < curtime + 2) return false;
while (!q.empty()) {
auto cur = q.front(); q.pop();
if (cur.x == dx && cur.y == dy) return true;
// if (seen[cur.x][cur.y]) continue;
if (cur.move == s) {
cur.time++;
if (bees[cur.x][cur.y] < cur.time) {
continue;
}
cur.move = 0;
}
if (bees[cur.x][cur.y] < cur.time) {
continue;
}
for (int i = 0; i < 4; i++) {
int newx = cur.x + mx[i], newy = cur.y + my[i];
if (newx < 0 || newx >= n || newy < 0 || newy >= n || ((newx != dx && newy != dy) && bees[newx][newy] < cur.time) || tree[newx][newy] || seen[newx][newy]) continue;
seen[newx][newy] = true;
q.push({newx, newy, cur.time, cur.move+1});
}
}
return false;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// freopen("", "r", stdin);
// freopen("", "w", stdout);
cin >> n >> s;
queue<pair<int, int>> q;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char c; cin>> c;
if (c == 'T') tree[i][j] = true;
if (c == 'M') {
sx = i; sy = j;
}
if (c == 'D') {
dx = i; dy = j;
}
if (c == 'H') {
q.push({i, j});
bees[i][j] = 1;
}
}
}
while (!q.empty()) {
auto cur = q.front();
q.pop();
for (int i = 0; i < 4; i++) {
int newx = cur.first + mx[i], newy = cur.second + my[i];
if (newx < 0 || newx >= n || newy < 0 || newy >= n || bees[newx][newy] || tree[newx][newy] || (newx == dx && newy == dy)) continue;
bees[newx][newy] = bees[cur.first][cur.second] + 1;
q.push({newx, newy});
}
}
int lo = 0, hi = 1e9;
int biggest = -1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
if (able(mid)) {
biggest = mid;
lo = mid + 1;
} else {
hi = mid - 1;
}
}
cout << biggest;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1228 KB |
Output is correct |
2 |
Correct |
2 ms |
1228 KB |
Output is correct |
3 |
Correct |
2 ms |
1228 KB |
Output is correct |
4 |
Correct |
2 ms |
1228 KB |
Output is correct |
5 |
Correct |
2 ms |
1228 KB |
Output is correct |
6 |
Correct |
2 ms |
1300 KB |
Output is correct |
7 |
Correct |
108 ms |
5220 KB |
Output is correct |
8 |
Correct |
2 ms |
1356 KB |
Output is correct |
9 |
Correct |
3 ms |
1356 KB |
Output is correct |
10 |
Correct |
2 ms |
1356 KB |
Output is correct |
11 |
Correct |
2 ms |
1356 KB |
Output is correct |
12 |
Correct |
2 ms |
1484 KB |
Output is correct |
13 |
Correct |
2 ms |
1484 KB |
Output is correct |
14 |
Correct |
2 ms |
1484 KB |
Output is correct |
15 |
Correct |
2 ms |
1404 KB |
Output is correct |
16 |
Correct |
2 ms |
1356 KB |
Output is correct |
17 |
Correct |
2 ms |
1356 KB |
Output is correct |
18 |
Correct |
2 ms |
1356 KB |
Output is correct |
19 |
Correct |
2 ms |
1356 KB |
Output is correct |
20 |
Correct |
2 ms |
1356 KB |
Output is correct |
21 |
Correct |
2 ms |
1484 KB |
Output is correct |
22 |
Correct |
2 ms |
1484 KB |
Output is correct |
23 |
Correct |
2 ms |
1484 KB |
Output is correct |
24 |
Correct |
2 ms |
1484 KB |
Output is correct |
25 |
Correct |
2 ms |
1484 KB |
Output is correct |
26 |
Correct |
2 ms |
1484 KB |
Output is correct |
27 |
Correct |
2 ms |
1612 KB |
Output is correct |
28 |
Correct |
3 ms |
1568 KB |
Output is correct |
29 |
Correct |
2 ms |
1612 KB |
Output is correct |
30 |
Correct |
3 ms |
1612 KB |
Output is correct |
31 |
Correct |
2 ms |
1612 KB |
Output is correct |
32 |
Correct |
4 ms |
1612 KB |
Output is correct |
33 |
Correct |
6 ms |
3040 KB |
Output is correct |
34 |
Correct |
7 ms |
3020 KB |
Output is correct |
35 |
Correct |
28 ms |
3040 KB |
Output is correct |
36 |
Correct |
7 ms |
3256 KB |
Output is correct |
37 |
Correct |
8 ms |
3216 KB |
Output is correct |
38 |
Correct |
35 ms |
3276 KB |
Output is correct |
39 |
Correct |
9 ms |
3528 KB |
Output is correct |
40 |
Correct |
9 ms |
3416 KB |
Output is correct |
41 |
Correct |
44 ms |
3448 KB |
Output is correct |
42 |
Correct |
10 ms |
3684 KB |
Output is correct |
43 |
Correct |
12 ms |
3660 KB |
Output is correct |
44 |
Correct |
66 ms |
3660 KB |
Output is correct |
45 |
Correct |
12 ms |
3932 KB |
Output is correct |
46 |
Correct |
12 ms |
3972 KB |
Output is correct |
47 |
Correct |
70 ms |
3928 KB |
Output is correct |
48 |
Correct |
14 ms |
4160 KB |
Output is correct |
49 |
Correct |
14 ms |
4172 KB |
Output is correct |
50 |
Correct |
84 ms |
4308 KB |
Output is correct |
51 |
Correct |
16 ms |
4428 KB |
Output is correct |
52 |
Correct |
17 ms |
4432 KB |
Output is correct |
53 |
Correct |
143 ms |
4496 KB |
Output is correct |
54 |
Correct |
19 ms |
4664 KB |
Output is correct |
55 |
Correct |
18 ms |
4684 KB |
Output is correct |
56 |
Correct |
114 ms |
4728 KB |
Output is correct |
57 |
Correct |
22 ms |
4980 KB |
Output is correct |
58 |
Correct |
20 ms |
4904 KB |
Output is correct |
59 |
Correct |
143 ms |
4920 KB |
Output is correct |
60 |
Correct |
22 ms |
5128 KB |
Output is correct |
61 |
Correct |
22 ms |
5136 KB |
Output is correct |
62 |
Correct |
164 ms |
5236 KB |
Output is correct |
63 |
Correct |
134 ms |
5168 KB |
Output is correct |
64 |
Correct |
234 ms |
5304 KB |
Output is correct |
65 |
Correct |
212 ms |
5228 KB |
Output is correct |
66 |
Correct |
158 ms |
5188 KB |
Output is correct |
67 |
Correct |
145 ms |
5232 KB |
Output is correct |
68 |
Correct |
64 ms |
5256 KB |
Output is correct |
69 |
Correct |
64 ms |
5256 KB |
Output is correct |
70 |
Correct |
48 ms |
5176 KB |
Output is correct |
71 |
Correct |
49 ms |
5188 KB |
Output is correct |
72 |
Correct |
44 ms |
5192 KB |
Output is correct |
73 |
Correct |
52 ms |
5444 KB |
Output is correct |
74 |
Correct |
82 ms |
5508 KB |
Output is correct |
75 |
Correct |
90 ms |
5500 KB |
Output is correct |
76 |
Correct |
82 ms |
5436 KB |
Output is correct |
77 |
Correct |
87 ms |
5452 KB |
Output is correct |
78 |
Correct |
94 ms |
5480 KB |
Output is correct |
79 |
Correct |
71 ms |
5452 KB |
Output is correct |
80 |
Correct |
82 ms |
5476 KB |
Output is correct |
81 |
Correct |
90 ms |
5476 KB |
Output is correct |
82 |
Correct |
76 ms |
5364 KB |
Output is correct |
83 |
Correct |
104 ms |
5500 KB |
Output is correct |
84 |
Correct |
91 ms |
5504 KB |
Output is correct |
85 |
Correct |
97 ms |
5316 KB |
Output is correct |
86 |
Correct |
104 ms |
5440 KB |
Output is correct |
87 |
Correct |
98 ms |
5412 KB |
Output is correct |
88 |
Correct |
112 ms |
5504 KB |
Output is correct |
89 |
Correct |
112 ms |
5316 KB |
Output is correct |
90 |
Correct |
112 ms |
5440 KB |
Output is correct |
91 |
Correct |
105 ms |
5452 KB |
Output is correct |
92 |
Correct |
109 ms |
5340 KB |
Output is correct |