| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1037054 |
2024-07-28T00:38:46 Z |
sssamui |
Mecho (IOI09_mecho) |
C++17 |
|
147 ms |
4052 KB |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
vector<vector<char>> grd(802, vector<char>(802, 'T'));
vector<vector<bool>> swm(802, vector<bool>(802, false));
vector<vector<int>> btime(802, vector<int>(802, 0));
int sttr, sttc;
int dstr, dstc;
int h, s;
vector<int> radd = { -1, 0, 1, 0 };
vector<int> cadd = { 0, -1, 0, 1 };
bool check(int tchk)
{
queue<pair<int, pair<int, int>>> bfs;
bfs.push({ 0, {sttr, sttc} });
vector<vector<bool>> poss(h + 2, vector<bool>(h + 2, false));
poss[sttr][sttc] = true;
while (!bfs.empty() && !poss[dstr][dstc])
{
int r = bfs.front().second.first, c = bfs.front().second.second, dst = bfs.front().first;
bfs.pop();
for (int dir = 0; dir < 4; dir++) if (!poss[r + radd[dir]][c + cadd[dir]]) if (grd[r + radd[dir]][c + cadd[dir]] == 'G')
if ((dst + 1) / s < btime[r + radd[dir]][c + cadd[dir]] - tchk)
{
poss[r + radd[dir]][c + cadd[dir]] = true;
bfs.push({ dst + 1, {r + radd[dir], c + cadd[dir]} });
}
}
return poss[dstr][dstc];
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> h >> s;
queue<pair<int, int>> swmpcs;
for (int i = 1; i <= h; i++) for (int j = 1; j <= h; j++)
{
cin >> grd[i][j];
if (grd[i][j] == 'M')
{
sttr = i;
sttc = j;
grd[i][j] = 'G';
}
else if (grd[i][j] == 'D')
{
dstr = i;
dstc = j;
grd[i][j] = 'T';
}
else if (grd[i][j] == 'H')
{
swmpcs.push({ i, j });
grd[i][j] = 'T';
}
}
while (!swmpcs.empty())
{
int r = swmpcs.front().first, c = swmpcs.front().second;
swmpcs.pop();
for (int dir = 0; dir < 4; dir++) if ((!swm[r + radd[dir]][c + cadd[dir]]) && (grd[r + radd[dir]][c + cadd[dir]] == 'G'))
{
swm[r + radd[dir]][c + cadd[dir]] = true;
btime[r + radd[dir]][c + cadd[dir]] = btime[r][c] + 1;
swmpcs.push({ r + radd[dir], c + cadd[dir] });
}
}
btime[dstr][dstc] = 2 * h;
grd[dstr][dstc] = 'G';
if (!check(0)) cout << -1;
else
{
int l = 0, r = 1e8;
while (l < r)
{
int mid = l + (r - l + 1) / 2;
if (check(mid)) l = mid;
else r = mid - 1;
}
cout << l;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3676 KB |
Output is correct |
| 2 |
Correct |
3 ms |
3676 KB |
Output is correct |
| 3 |
Correct |
2 ms |
3676 KB |
Output is correct |
| 4 |
Correct |
2 ms |
3676 KB |
Output is correct |
| 5 |
Correct |
2 ms |
3652 KB |
Output is correct |
| 6 |
Correct |
2 ms |
3676 KB |
Output is correct |
| 7 |
Correct |
66 ms |
3896 KB |
Output is correct |
| 8 |
Correct |
3 ms |
3676 KB |
Output is correct |
| 9 |
Correct |
3 ms |
3676 KB |
Output is correct |
| 10 |
Correct |
2 ms |
3676 KB |
Output is correct |
| 11 |
Correct |
3 ms |
3676 KB |
Output is correct |
| 12 |
Incorrect |
4 ms |
3676 KB |
Output isn't correct |
| 13 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 14 |
Correct |
2 ms |
3676 KB |
Output is correct |
| 15 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 16 |
Incorrect |
2 ms |
3676 KB |
Output isn't correct |
| 17 |
Incorrect |
2 ms |
3676 KB |
Output isn't correct |
| 18 |
Incorrect |
2 ms |
3676 KB |
Output isn't correct |
| 19 |
Incorrect |
2 ms |
3676 KB |
Output isn't correct |
| 20 |
Incorrect |
2 ms |
3776 KB |
Output isn't correct |
| 21 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 22 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 23 |
Incorrect |
2 ms |
3676 KB |
Output isn't correct |
| 24 |
Incorrect |
3 ms |
3776 KB |
Output isn't correct |
| 25 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 26 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 27 |
Incorrect |
2 ms |
3676 KB |
Output isn't correct |
| 28 |
Incorrect |
2 ms |
3676 KB |
Output isn't correct |
| 29 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 30 |
Incorrect |
2 ms |
3676 KB |
Output isn't correct |
| 31 |
Incorrect |
3 ms |
3676 KB |
Output isn't correct |
| 32 |
Incorrect |
3 ms |
3644 KB |
Output isn't correct |
| 33 |
Incorrect |
12 ms |
3676 KB |
Output isn't correct |
| 34 |
Incorrect |
12 ms |
3672 KB |
Output isn't correct |
| 35 |
Correct |
18 ms |
3808 KB |
Output is correct |
| 36 |
Incorrect |
14 ms |
3676 KB |
Output isn't correct |
| 37 |
Incorrect |
18 ms |
3676 KB |
Output isn't correct |
| 38 |
Correct |
21 ms |
3672 KB |
Output is correct |
| 39 |
Incorrect |
14 ms |
3676 KB |
Output isn't correct |
| 40 |
Incorrect |
19 ms |
3676 KB |
Output isn't correct |
| 41 |
Correct |
25 ms |
3844 KB |
Output is correct |
| 42 |
Incorrect |
19 ms |
3676 KB |
Output isn't correct |
| 43 |
Incorrect |
23 ms |
3676 KB |
Output isn't correct |
| 44 |
Correct |
33 ms |
3852 KB |
Output is correct |
| 45 |
Incorrect |
25 ms |
3676 KB |
Output isn't correct |
| 46 |
Incorrect |
30 ms |
3672 KB |
Output isn't correct |
| 47 |
Correct |
39 ms |
3672 KB |
Output is correct |
| 48 |
Incorrect |
28 ms |
3676 KB |
Output isn't correct |
| 49 |
Incorrect |
35 ms |
3676 KB |
Output isn't correct |
| 50 |
Correct |
47 ms |
3676 KB |
Output is correct |
| 51 |
Incorrect |
27 ms |
3676 KB |
Output isn't correct |
| 52 |
Incorrect |
66 ms |
3676 KB |
Output isn't correct |
| 53 |
Correct |
52 ms |
3672 KB |
Output is correct |
| 54 |
Incorrect |
36 ms |
3672 KB |
Output isn't correct |
| 55 |
Incorrect |
70 ms |
3848 KB |
Output isn't correct |
| 56 |
Correct |
65 ms |
3676 KB |
Output is correct |
| 57 |
Incorrect |
37 ms |
3676 KB |
Output isn't correct |
| 58 |
Incorrect |
50 ms |
3676 KB |
Output isn't correct |
| 59 |
Correct |
84 ms |
3676 KB |
Output is correct |
| 60 |
Incorrect |
59 ms |
3676 KB |
Output isn't correct |
| 61 |
Incorrect |
71 ms |
3872 KB |
Output isn't correct |
| 62 |
Correct |
83 ms |
3784 KB |
Output is correct |
| 63 |
Incorrect |
33 ms |
3784 KB |
Output isn't correct |
| 64 |
Correct |
119 ms |
3880 KB |
Output is correct |
| 65 |
Correct |
147 ms |
3780 KB |
Output is correct |
| 66 |
Correct |
114 ms |
3672 KB |
Output is correct |
| 67 |
Correct |
29 ms |
3780 KB |
Output is correct |
| 68 |
Correct |
41 ms |
3672 KB |
Output is correct |
| 69 |
Correct |
37 ms |
3784 KB |
Output is correct |
| 70 |
Correct |
37 ms |
3676 KB |
Output is correct |
| 71 |
Correct |
36 ms |
3676 KB |
Output is correct |
| 72 |
Incorrect |
27 ms |
3676 KB |
Output isn't correct |
| 73 |
Incorrect |
32 ms |
3932 KB |
Output isn't correct |
| 74 |
Correct |
45 ms |
4052 KB |
Output is correct |
| 75 |
Correct |
51 ms |
3932 KB |
Output is correct |
| 76 |
Correct |
45 ms |
3928 KB |
Output is correct |
| 77 |
Correct |
51 ms |
3932 KB |
Output is correct |
| 78 |
Correct |
23 ms |
3928 KB |
Output is correct |
| 79 |
Correct |
47 ms |
3932 KB |
Output is correct |
| 80 |
Correct |
45 ms |
4008 KB |
Output is correct |
| 81 |
Correct |
56 ms |
3928 KB |
Output is correct |
| 82 |
Correct |
44 ms |
3928 KB |
Output is correct |
| 83 |
Correct |
56 ms |
3932 KB |
Output is correct |
| 84 |
Correct |
64 ms |
3928 KB |
Output is correct |
| 85 |
Correct |
56 ms |
3928 KB |
Output is correct |
| 86 |
Correct |
54 ms |
3968 KB |
Output is correct |
| 87 |
Correct |
54 ms |
3928 KB |
Output is correct |
| 88 |
Correct |
57 ms |
3932 KB |
Output is correct |
| 89 |
Correct |
61 ms |
3932 KB |
Output is correct |
| 90 |
Correct |
60 ms |
3932 KB |
Output is correct |
| 91 |
Correct |
61 ms |
3932 KB |
Output is correct |
| 92 |
Correct |
57 ms |
3932 KB |
Output is correct |
