| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 947245 |
2024-03-15T18:36:37 Z |
narsuk |
Mecho (IOI09_mecho) |
C++17 |
|
749 ms |
9812 KB |
#include <bits/stdc++.h>
using namespace std;
//
#define ll long long int
#define endl "\n";
const int maxn = 801;
// array<int,n>
// pq
int n,st;
pair<int,int>mv[4]={ {0,1},{0,-1} , {1,0}, {-1,0} };
char g[maxn][maxn];
char g1[maxn][maxn];
char g2[maxn][maxn];
bool val(int x , int y){
if(x<0 || x>=n || y<0 || y>=n || g[x][y]=='T' )return 0;
return 1;
}
int xc,yc;
int xcc;
int ycc;
int beetime[maxn][maxn];
void bbfs(){
int vis[n][n];
queue<pair<pair<int,int>,int>>q;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
beetime[i][j]=INT_MAX;
if(g1[i][j]=='H'){
q.push({{i,j},0});
}
vis[i][j]=0;
}
}
while(!q.empty()){
pair<int,int>cur;
cur=q.front().first;
int dt = q.front().second;
q.pop();
if(vis[cur.first][cur.second])continue;
vis[cur.first][cur.second]=1;
if(g1[cur.first][cur.second]=='D' || g1[cur.first][cur.second]=='T'){
continue;
}
beetime[cur.first][cur.second]=dt;
// cout<<cur.first<<" "<<cur.second<<endl;
for(auto ele : mv){
int xx = cur.first+ele.first;
int yy = cur.second+ele.second;
if(val(xx,yy)){
q.push({{xx,yy},dt+1});
}
}
}
}
// int mbfs(int x){
bool tme(int marc , int bee){
int ccur = marc/st;
// if(ccur*st!=marc){
// return (marc/st)-1<bee;
// }
return marc/st <bee;
}
bool check(int x){
bbfs();
queue<pair<pair<int,int>,int>>q;
bool vis[n][n];
int dist[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
vis[i][j]=0;
dist[i][j]=INT_MAX;
}
}
q.push({{xc,yc},0});
if(beetime[xc][yc]<=x)q.pop();
while(!q.empty()){
pair<int,int>cur=q.front().first;
int dt = q.front().second;
dist[cur.first][cur.second]=dt;
q.pop();
if(vis[cur.first][cur.second])continue;
vis[cur.first][cur.second]=1;
for(auto ele :mv){
int xx = cur.first+ele.first;
int yy = cur.second+ele.second;
if(val(xx,yy) && !vis[xx][yy] && tme(dt+1 , beetime[xx][yy]-x) && g[xx][yy]!='H'){
q.push({{xx,yy} , dt+1});
}
}
}
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// cout<<vis[i][j]<<" ";
// }
// cout<<endl;
// }
for(auto ele : mv){
int xx = xcc+ele.first;
int yy = ycc+ele.second;
if(val(xx,yy) && vis[xx][yy]==1 && tme(dist[xx][yy] ,beetime[xx][yy]-x)){
// cout<<xx<<" "<<yy<<endl;
return 1;
}
}
return 0;
}
void solu(){
cin>>n>>st;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>g[i][j];
g1[i][j]=g[i][j];
if(g[i][j]=='M'){
xc=i;
yc=j;
}
if(g[i][j]=='D'){
xcc = i;
ycc = j;
}
}
}
// cout<<endl;
int l=0;
int r = 1e6;
int ans=0;
while(l<r){
int mid = l + (r-l+1)/2;
// cout<<mid<<endl;
if(check(mid)){
ans=max(mid,ans);
l=mid;
}else{
r=mid-1;
}
}
// cout<<check(2)<<endl;
cout<<ans<<endl;
}
int main(){
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// int cass;
// cin>>cass;
// for(int i=0;i<cass;i++)
solu();
return 0;
}
Compilation message
mecho.cpp: In function 'bool tme(int, int)':
mecho.cpp:74:6: warning: unused variable 'ccur' [-Wunused-variable]
74 | int ccur = marc/st;
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
608 ms |
8784 KB |
Output is correct |
| 8 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 13 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 14 |
Incorrect |
3 ms |
4700 KB |
Output isn't correct |
| 15 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 18 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 19 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 20 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 21 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 22 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 23 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 24 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 25 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 26 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 27 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 28 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 29 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 30 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 31 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 32 |
Correct |
2 ms |
4952 KB |
Output is correct |
| 33 |
Correct |
34 ms |
5208 KB |
Output is correct |
| 34 |
Correct |
34 ms |
5208 KB |
Output is correct |
| 35 |
Correct |
93 ms |
5312 KB |
Output is correct |
| 36 |
Correct |
44 ms |
5468 KB |
Output is correct |
| 37 |
Correct |
43 ms |
5464 KB |
Output is correct |
| 38 |
Correct |
106 ms |
5364 KB |
Output is correct |
| 39 |
Correct |
57 ms |
5688 KB |
Output is correct |
| 40 |
Correct |
53 ms |
5468 KB |
Output is correct |
| 41 |
Correct |
132 ms |
5724 KB |
Output is correct |
| 42 |
Correct |
69 ms |
5816 KB |
Output is correct |
| 43 |
Correct |
67 ms |
5724 KB |
Output is correct |
| 44 |
Correct |
169 ms |
5940 KB |
Output is correct |
| 45 |
Correct |
82 ms |
6156 KB |
Output is correct |
| 46 |
Correct |
79 ms |
5976 KB |
Output is correct |
| 47 |
Correct |
201 ms |
5976 KB |
Output is correct |
| 48 |
Correct |
105 ms |
6460 KB |
Output is correct |
| 49 |
Correct |
98 ms |
6232 KB |
Output is correct |
| 50 |
Correct |
244 ms |
6488 KB |
Output is correct |
| 51 |
Correct |
114 ms |
6736 KB |
Output is correct |
| 52 |
Correct |
111 ms |
6740 KB |
Output is correct |
| 53 |
Correct |
289 ms |
6792 KB |
Output is correct |
| 54 |
Correct |
140 ms |
7096 KB |
Output is correct |
| 55 |
Correct |
129 ms |
6992 KB |
Output is correct |
| 56 |
Correct |
335 ms |
7164 KB |
Output is correct |
| 57 |
Correct |
164 ms |
7516 KB |
Output is correct |
| 58 |
Correct |
164 ms |
7520 KB |
Output is correct |
| 59 |
Correct |
403 ms |
7504 KB |
Output is correct |
| 60 |
Correct |
172 ms |
7932 KB |
Output is correct |
| 61 |
Correct |
169 ms |
7932 KB |
Output is correct |
| 62 |
Correct |
472 ms |
8016 KB |
Output is correct |
| 63 |
Correct |
415 ms |
7772 KB |
Output is correct |
| 64 |
Correct |
472 ms |
8180 KB |
Output is correct |
| 65 |
Correct |
474 ms |
7948 KB |
Output is correct |
| 66 |
Correct |
504 ms |
8004 KB |
Output is correct |
| 67 |
Incorrect |
465 ms |
7940 KB |
Output isn't correct |
| 68 |
Correct |
424 ms |
7944 KB |
Output is correct |
| 69 |
Correct |
491 ms |
8028 KB |
Output is correct |
| 70 |
Correct |
457 ms |
8288 KB |
Output is correct |
| 71 |
Correct |
461 ms |
8020 KB |
Output is correct |
| 72 |
Correct |
451 ms |
7860 KB |
Output is correct |
| 73 |
Correct |
627 ms |
9596 KB |
Output is correct |
| 74 |
Correct |
704 ms |
9596 KB |
Output is correct |
| 75 |
Correct |
738 ms |
9812 KB |
Output is correct |
| 76 |
Correct |
727 ms |
9604 KB |
Output is correct |
| 77 |
Correct |
749 ms |
9804 KB |
Output is correct |
| 78 |
Incorrect |
603 ms |
9416 KB |
Output isn't correct |
| 79 |
Correct |
633 ms |
9556 KB |
Output is correct |
| 80 |
Correct |
627 ms |
9580 KB |
Output is correct |
| 81 |
Correct |
621 ms |
9572 KB |
Output is correct |
| 82 |
Correct |
651 ms |
9392 KB |
Output is correct |
| 83 |
Correct |
587 ms |
9184 KB |
Output is correct |
| 84 |
Correct |
636 ms |
9320 KB |
Output is correct |
| 85 |
Correct |
614 ms |
9616 KB |
Output is correct |
| 86 |
Correct |
625 ms |
9412 KB |
Output is correct |
| 87 |
Correct |
599 ms |
9132 KB |
Output is correct |
| 88 |
Correct |
620 ms |
8864 KB |
Output is correct |
| 89 |
Correct |
655 ms |
9160 KB |
Output is correct |
| 90 |
Correct |
630 ms |
9040 KB |
Output is correct |
| 91 |
Correct |
628 ms |
8912 KB |
Output is correct |
| 92 |
Correct |
603 ms |
8904 KB |
Output is correct |
