| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 977550 |
2024-05-08T06:42:34 Z |
farica |
Mecho (IOI09_mecho) |
C++14 |
|
240 ms |
6736 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX_N = 4e5 + 5;
int n, s, dist[800][800], sx, sy;
string grid[800];
bool test(int m) {
priority_queue<pair<int, pair<int,int>>>pq;
vector<vector<bool>>visited(n, vector<bool>(n, 0));
pq.push({0, {sx, sy}});
while(!pq.empty()) {
int x = pq.top().second.first, y = pq.top().second.second, cnt = -1 * pq.top().first;
pq.pop();
if(visited[x][y]) continue;
visited[x][y] = 1;
if(grid[x][y] == 'D') return true;
int cost = ((cnt+1) / s) + ((cnt+1) % s > 0 ? 1 : 0) + m;
if(x && grid[x-1][y] != 'T' && dist[x-1][y] >= cost) pq.push({(cnt + 1) * -1, {x-1, y}});
if(y && grid[x][y-1] != 'T' && dist[x][y-1] >= cost) pq.push({(cnt + 1) * -1, {x, y-1}});
if(x+1<n && grid[x+1][y] != 'T' && dist[x+1][y] >= cost) pq.push({(cnt + 1) * -1, {x+1, y}});
if(y+1<n && grid[x][y+1] != 'T' && dist[x][y+1] >= cost) pq.push({(cnt + 1) * -1, {x, y+1}});
}
return false;
}
void solve() {
cin >> n >> s;
queue<pair<int,int>>q;
for(int i=0; i<n; ++i) {
cin >> grid[i];
for(int j=0; j<n; ++j) {
dist[i][j] = -1;
if(grid[i][j] == 'H') {
q.push({i, j});
dist[i][j] = 0;
} else if(grid[i][j] == 'M') sx=i, sy=j;
}
}
while(!q.empty()) {
int i = q.front().first, j = q.front().second;
q.pop();
if(i && dist[i-1][j] == -1 && grid[i-1][j] != 'T' && grid[i-1][j] != 'M') {
dist[i-1][j] = dist[i][j] + 1;
q.push({i-1, j});
}
if(j && dist[i][j-1] == -1 && grid[i][j-1] != 'T' && grid[i][j-1] != 'M') {
dist[i][j-1] = dist[i][j] + 1;
q.push({i, j-1});
}
if(i<n-1 && dist[i+1][j] == -1 && grid[i+1][j] != 'T' && grid[i+1][j] != 'M') {
dist[i+1][j] = dist[i][j] + 1;
q.push({i+1, j});
}
if(j<n-1 && dist[i][j+1] == -1 && grid[i][j+1] != 'T' && grid[i][j+1] != 'M') {
dist[i][j+1] = dist[i][j] + 1;
q.push({i, j+1});
}
}
if(!test(0)) {
cout << -1 << endl;
return;
}
int l=0, r=dist[sx][sy], mid;
while(l<=r) {
mid = (l+r)/2;
if(test(mid)) l = mid + 1;
else r = mid - 1;
}
cout << l - 1 << endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while(t--) solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 7 |
Incorrect |
177 ms |
6420 KB |
Output isn't correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 14 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 16 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 17 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 18 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 19 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 20 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 21 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 22 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 23 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 24 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 25 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 26 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 27 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 28 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 29 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 30 |
Incorrect |
1 ms |
2648 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 33 |
Incorrect |
2 ms |
2648 KB |
Output isn't correct |
| 34 |
Incorrect |
2 ms |
2652 KB |
Output isn't correct |
| 35 |
Incorrect |
19 ms |
2908 KB |
Output isn't correct |
| 36 |
Incorrect |
3 ms |
4700 KB |
Output isn't correct |
| 37 |
Incorrect |
2 ms |
4700 KB |
Output isn't correct |
| 38 |
Incorrect |
25 ms |
4956 KB |
Output isn't correct |
| 39 |
Incorrect |
3 ms |
4956 KB |
Output isn't correct |
| 40 |
Incorrect |
3 ms |
4956 KB |
Output isn't correct |
| 41 |
Incorrect |
30 ms |
4956 KB |
Output isn't correct |
| 42 |
Incorrect |
3 ms |
4956 KB |
Output isn't correct |
| 43 |
Incorrect |
3 ms |
4956 KB |
Output isn't correct |
| 44 |
Incorrect |
37 ms |
4956 KB |
Output isn't correct |
| 45 |
Incorrect |
5 ms |
4956 KB |
Output isn't correct |
| 46 |
Incorrect |
3 ms |
4956 KB |
Output isn't correct |
| 47 |
Incorrect |
45 ms |
5168 KB |
Output isn't correct |
| 48 |
Incorrect |
5 ms |
4956 KB |
Output isn't correct |
| 49 |
Incorrect |
4 ms |
4956 KB |
Output isn't correct |
| 50 |
Incorrect |
53 ms |
5212 KB |
Output isn't correct |
| 51 |
Incorrect |
6 ms |
5212 KB |
Output isn't correct |
| 52 |
Incorrect |
4 ms |
5100 KB |
Output isn't correct |
| 53 |
Incorrect |
65 ms |
5212 KB |
Output isn't correct |
| 54 |
Incorrect |
6 ms |
5464 KB |
Output isn't correct |
| 55 |
Incorrect |
5 ms |
5464 KB |
Output isn't correct |
| 56 |
Incorrect |
74 ms |
5548 KB |
Output isn't correct |
| 57 |
Incorrect |
7 ms |
5724 KB |
Output isn't correct |
| 58 |
Incorrect |
6 ms |
5724 KB |
Output isn't correct |
| 59 |
Incorrect |
88 ms |
5960 KB |
Output isn't correct |
| 60 |
Incorrect |
8 ms |
6236 KB |
Output isn't correct |
| 61 |
Incorrect |
6 ms |
6240 KB |
Output isn't correct |
| 62 |
Incorrect |
96 ms |
6180 KB |
Output isn't correct |
| 63 |
Incorrect |
79 ms |
6240 KB |
Output isn't correct |
| 64 |
Incorrect |
93 ms |
6232 KB |
Output isn't correct |
| 65 |
Incorrect |
87 ms |
6284 KB |
Output isn't correct |
| 66 |
Incorrect |
75 ms |
6164 KB |
Output isn't correct |
| 67 |
Correct |
56 ms |
6236 KB |
Output is correct |
| 68 |
Incorrect |
32 ms |
6236 KB |
Output isn't correct |
| 69 |
Incorrect |
38 ms |
6236 KB |
Output isn't correct |
| 70 |
Incorrect |
28 ms |
6232 KB |
Output isn't correct |
| 71 |
Incorrect |
26 ms |
6236 KB |
Output isn't correct |
| 72 |
Incorrect |
44 ms |
6488 KB |
Output isn't correct |
| 73 |
Incorrect |
115 ms |
6692 KB |
Output isn't correct |
| 74 |
Incorrect |
203 ms |
6488 KB |
Output isn't correct |
| 75 |
Incorrect |
116 ms |
6492 KB |
Output isn't correct |
| 76 |
Incorrect |
99 ms |
6488 KB |
Output isn't correct |
| 77 |
Incorrect |
125 ms |
6692 KB |
Output isn't correct |
| 78 |
Correct |
120 ms |
6492 KB |
Output is correct |
| 79 |
Incorrect |
218 ms |
6736 KB |
Output isn't correct |
| 80 |
Incorrect |
120 ms |
6644 KB |
Output isn't correct |
| 81 |
Incorrect |
111 ms |
6492 KB |
Output isn't correct |
| 82 |
Incorrect |
128 ms |
6636 KB |
Output isn't correct |
| 83 |
Incorrect |
125 ms |
6568 KB |
Output isn't correct |
| 84 |
Incorrect |
230 ms |
6556 KB |
Output isn't correct |
| 85 |
Incorrect |
133 ms |
6492 KB |
Output isn't correct |
| 86 |
Incorrect |
127 ms |
6564 KB |
Output isn't correct |
| 87 |
Incorrect |
143 ms |
6560 KB |
Output isn't correct |
| 88 |
Incorrect |
133 ms |
6232 KB |
Output isn't correct |
| 89 |
Incorrect |
240 ms |
6480 KB |
Output isn't correct |
| 90 |
Incorrect |
149 ms |
6468 KB |
Output isn't correct |
| 91 |
Incorrect |
193 ms |
6488 KB |
Output isn't correct |
| 92 |
Incorrect |
138 ms |
6464 KB |
Output isn't correct |
