#include <bits/stdc++.h>
using namespace std;
const int NMAX = 8e2;
const int VISUAL = 4;
int dl[] = { -1, 0, 1, 0 };
int dc[] = { 0, 1, 0, -1 };
int n, step; int bee_dist[2 + NMAX][2 + NMAX];
char forest[2 + NMAX][2 + NMAX]; int dist[2 + NMAX][2 + NMAX];
pair<int, int> honey, house;
vector<pair<int, int>> bees;
void bee_spread () {
queue<pair<int, int>> q;
for ( auto pos : bees ) {
q.push ( pos );
bee_dist[pos.first][pos.second] = 1;
}
while ( !q.empty () ) {
pair<int, int> start = q.front (); q.pop ();
int line = start.first, column = start.second;
for ( int dir = 0; dir < VISUAL; dir ++ ) {
int new_line = line + dl[dir];
int new_col = column + dc[dir];
if ( forest[new_line][new_col] != 'T' && bee_dist[new_line][new_col] == 0 ) {
bee_dist[new_line][new_col] = bee_dist[line][column] + 1;
q.push ( {new_line, new_col} );
}
}
}
}
bool validation ( int time, pair<int, int> start ) {
queue<pair<int, int>> q; q.push ( start );
dist[start.first][start.second] = 1;
while ( !q.empty () ) {
start = q.front (); q.pop ();
int line = start.first, column = start.second;
for ( int dir = 0; dir < VISUAL; dir ++ ) {
int new_line = line + dl[dir];
int new_col = column + dc[dir];
if ( (forest[new_line][new_col] == 'D' || forest[new_line][new_col] == 'G') && dist[new_line][new_col] == 0 ) {
dist[new_line][new_col] = dist[line][column] + 1;
int need = ( dist[new_line][new_col] - 1 ) / step;
if ( need + time < bee_dist[new_line][new_col] - 1 )
q.push ( {new_line, new_col} );
}
}
}
if ( dist[house.first][house.second] )
return true;
return false;
}
void reset_dist () {
for ( int i = 1; i <= n; i ++ )
for ( int j = 1; j <= n; j ++ )
dist[i][j] = 0;
}
void solve () {
int left = 0, right = n; int answer = -1;
while ( left <= right ) {
int time = left + (right - left) / 2;
int status = validation ( time, honey );
if ( status == true ) {
answer = time;
left = time + 1;
}
else
right = time - 1;
reset_dist ();
}
cout << answer;
}
int main()
{
cin >> n >> step; cin.get ();
for ( int line = 1; line <= n; line ++ ) {
for ( int column = 1; column <= n; column ++ ) {
forest[line][column] = cin.get ();
if ( forest[line][column] == 'M' )
honey = {line, column};
else if ( forest[line][column] == 'D' )
house = {line, column};
else if ( forest[line][column] == 'H' )
bees.push_back ( {line, column} );
}
cin.get ();
}
for ( int indx = 0; indx < n + 2; indx ++ ) {
forest[indx][0] = forest[indx][n + 1] = 'T';
forest[0][indx] = forest[n + 1][indx] = 'T';
}
bee_spread ();
solve ();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
352 KB |
Output is correct |
| 5 |
Correct |
0 ms |
312 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
80 ms |
6604 KB |
Output is correct |
| 8 |
Correct |
0 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
308 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Incorrect |
2 ms |
692 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |
| 14 |
Correct |
1 ms |
724 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 16 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 17 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 18 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 19 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 20 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 21 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |
| 22 |
Incorrect |
1 ms |
572 KB |
Output isn't correct |
| 23 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |
| 24 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |
| 25 |
Incorrect |
1 ms |
724 KB |
Output isn't correct |
| 26 |
Incorrect |
1 ms |
724 KB |
Output isn't correct |
| 27 |
Incorrect |
1 ms |
736 KB |
Output isn't correct |
| 28 |
Incorrect |
1 ms |
724 KB |
Output isn't correct |
| 29 |
Incorrect |
1 ms |
724 KB |
Output isn't correct |
| 30 |
Incorrect |
2 ms |
724 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
852 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
852 KB |
Output isn't correct |
| 33 |
Incorrect |
15 ms |
2828 KB |
Output isn't correct |
| 34 |
Incorrect |
16 ms |
2880 KB |
Output isn't correct |
| 35 |
Correct |
19 ms |
2884 KB |
Output is correct |
| 36 |
Incorrect |
19 ms |
3240 KB |
Output isn't correct |
| 37 |
Incorrect |
20 ms |
3224 KB |
Output isn't correct |
| 38 |
Correct |
28 ms |
3304 KB |
Output is correct |
| 39 |
Incorrect |
27 ms |
3668 KB |
Output isn't correct |
| 40 |
Incorrect |
27 ms |
3668 KB |
Output isn't correct |
| 41 |
Correct |
33 ms |
3660 KB |
Output is correct |
| 42 |
Incorrect |
30 ms |
4024 KB |
Output isn't correct |
| 43 |
Incorrect |
37 ms |
4172 KB |
Output isn't correct |
| 44 |
Correct |
39 ms |
4072 KB |
Output is correct |
| 45 |
Incorrect |
37 ms |
4472 KB |
Output isn't correct |
| 46 |
Incorrect |
39 ms |
4436 KB |
Output isn't correct |
| 47 |
Correct |
46 ms |
4480 KB |
Output is correct |
| 48 |
Incorrect |
44 ms |
4888 KB |
Output isn't correct |
| 49 |
Incorrect |
46 ms |
4888 KB |
Output isn't correct |
| 50 |
Correct |
55 ms |
4808 KB |
Output is correct |
| 51 |
Incorrect |
52 ms |
5312 KB |
Output isn't correct |
| 52 |
Incorrect |
55 ms |
5196 KB |
Output isn't correct |
| 53 |
Correct |
68 ms |
5316 KB |
Output is correct |
| 54 |
Incorrect |
59 ms |
5716 KB |
Output isn't correct |
| 55 |
Incorrect |
61 ms |
5604 KB |
Output isn't correct |
| 56 |
Correct |
77 ms |
5748 KB |
Output is correct |
| 57 |
Incorrect |
77 ms |
6092 KB |
Output isn't correct |
| 58 |
Incorrect |
80 ms |
6140 KB |
Output isn't correct |
| 59 |
Correct |
87 ms |
6156 KB |
Output is correct |
| 60 |
Incorrect |
77 ms |
6568 KB |
Output isn't correct |
| 61 |
Incorrect |
84 ms |
6572 KB |
Output isn't correct |
| 62 |
Correct |
106 ms |
6580 KB |
Output is correct |
| 63 |
Correct |
107 ms |
6532 KB |
Output is correct |
| 64 |
Incorrect |
174 ms |
6588 KB |
Output isn't correct |
| 65 |
Correct |
167 ms |
6584 KB |
Output is correct |
| 66 |
Correct |
120 ms |
6556 KB |
Output is correct |
| 67 |
Correct |
106 ms |
6476 KB |
Output is correct |
| 68 |
Correct |
59 ms |
6604 KB |
Output is correct |
| 69 |
Correct |
55 ms |
6608 KB |
Output is correct |
| 70 |
Correct |
52 ms |
6608 KB |
Output is correct |
| 71 |
Correct |
51 ms |
6608 KB |
Output is correct |
| 72 |
Incorrect |
46 ms |
6648 KB |
Output isn't correct |
| 73 |
Incorrect |
44 ms |
6860 KB |
Output isn't correct |
| 74 |
Correct |
58 ms |
6812 KB |
Output is correct |
| 75 |
Correct |
65 ms |
6792 KB |
Output is correct |
| 76 |
Correct |
82 ms |
6856 KB |
Output is correct |
| 77 |
Correct |
66 ms |
6840 KB |
Output is correct |
| 78 |
Correct |
76 ms |
6752 KB |
Output is correct |
| 79 |
Correct |
63 ms |
6732 KB |
Output is correct |
| 80 |
Correct |
60 ms |
6712 KB |
Output is correct |
| 81 |
Correct |
70 ms |
6756 KB |
Output is correct |
| 82 |
Correct |
65 ms |
6752 KB |
Output is correct |
| 83 |
Correct |
81 ms |
6716 KB |
Output is correct |
| 84 |
Correct |
71 ms |
6776 KB |
Output is correct |
| 85 |
Correct |
79 ms |
6796 KB |
Output is correct |
| 86 |
Correct |
80 ms |
6788 KB |
Output is correct |
| 87 |
Correct |
75 ms |
6776 KB |
Output is correct |
| 88 |
Correct |
96 ms |
6700 KB |
Output is correct |
| 89 |
Correct |
76 ms |
6740 KB |
Output is correct |
| 90 |
Correct |
81 ms |
6748 KB |
Output is correct |
| 91 |
Correct |
78 ms |
6744 KB |
Output is correct |
| 92 |
Correct |
75 ms |
6744 KB |
Output is correct |
