oj.uz

Submission #1088865

# Submission time Handle Problem Language Result Execution time Memory
1088865 2024-09-15T11:02:21 Z StefanSebez Mecho (IOI09_mecho) C++14
71 / 100
 152 ms 7416 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
const int inf=1e9;
vector<string>a;
bool was[850][850];
int depth[850][850],dist[850][850],n,S;
bool Dobar(int x,int y){
	if(x<0||x>=n||y<0||y>=n||a[x][y]=='T'||was[x][y]) return false;
	return true;
}
int main(){
    scanf("%i%i",&n,&S);
    for(int i=0;i<n;i++){string s;cin>>s;a.pb(s);}
    int X0,Y0,X1,Y1;
    vector<pair<int,int> >H;
    for(int i=0;i<n;i++) for(int j=0;j<n;j++){if(a[i][j]=='M'){X0=i,Y0=j;}if(a[i][j]=='H')H.pb({i,j});if(a[i][j]=='D'){X1=i,Y1=j;}}
    queue<pair<int,int> >kju;
    for(auto i:H){kju.push(i);was[i.fi][i.se]=true;}
    while(kju.size()){
		int u=kju.front().fi,v=kju.front().se;kju.pop();
		if(Dobar(u-1,v)){depth[u-1][v]=depth[u][v]+1;was[u-1][v]=true;kju.push({u-1,v});}
		if(Dobar(u+1,v)){depth[u+1][v]=depth[u][v]+1;was[u+1][v]=true;kju.push({u+1,v});}
		if(Dobar(u,v-1)){depth[u][v-1]=depth[u][v]+1;was[u][v-1]=true;kju.push({u,v-1});}
		if(Dobar(u,v+1)){depth[u][v+1]=depth[u][v]+1;was[u][v+1]=true;kju.push({u,v+1});}
    }
    depth[X1][Y1]=inf;
    //for(int i=0;i<n;i++) {for(int j=0;j<n;j++) printf("%i ",depth[i][j]);printf("\n");}
    int l=0,r=5000,res=-1;
    while(l<=r){
		//printf("%i %i**\n",l,r);
		int mid=l+r>>1;
		for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) {dist[i][j]=0;was[i][j]=false;}
		if(depth[X0][Y0]>mid) kju.push({X0,Y0});was[X0][Y0]=true;
		bool moze=false;
		for(int i=S,dst=mid;kju.size();i+=S,dst++){
			while(kju.size()){
				int u=kju.front().fi,v=kju.front().se;
				//printf("%i %i\n",u,v);
				if(depth[u][v]<=dst){kju.pop();continue;}
				if(dist[u][v]>i) break;
				if(u==X1 && v==Y1) moze=true;
				if(dist[u][v]==i) break;
				kju.pop();
				if(Dobar(u-1,v)&&depth[u-1][v]>dst){dist[u-1][v]=dist[u][v]+1;was[u-1][v]=true;kju.push({u-1,v});}
				if(Dobar(u+1,v)&&depth[u+1][v]>dst){dist[u+1][v]=dist[u][v]+1;was[u+1][v]=true;kju.push({u+1,v});}
				if(Dobar(u,v-1)&&depth[u][v-1]>dst){dist[u][v-1]=dist[u][v]+1;was[u][v-1]=true;kju.push({u,v-1});}
				if(Dobar(u,v+1)&&depth[u][v+1]>dst){dist[u][v+1]=dist[u][v]+1;was[u][v+1]=true;kju.push({u,v+1});}
			}
		}
		if(moze) res=mid,l=mid+1;
		else r=mid-1;
    }
    printf("%i\n",res);
    return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:36:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |   int mid=l+r>>1;
      |           ~^~
mecho.cpp:38:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   38 |   if(depth[X0][Y0]>mid) kju.push({X0,Y0});was[X0][Y0]=true;
      |   ^~
mecho.cpp:38:43: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   38 |   if(depth[X0][Y0]>mid) kju.push({X0,Y0});was[X0][Y0]=true;
      |                                           ^~~
mecho.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%i%i",&n,&S);
      |     ~~~~~^~~~~~~~~~~~~~
mecho.cpp:38:18: warning: 'Y0' may be used uninitialized in this function [-Wmaybe-uninitialized]
   38 |   if(depth[X0][Y0]>mid) kju.push({X0,Y0});was[X0][Y0]=true;
      |      ~~~~~~~~~~~~^
mecho.cpp:38:18: warning: 'X0' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:46:14: warning: 'Y1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   46 |     if(u==X1 && v==Y1) moze=true;
      |        ~~~~~~^~~~~~~~
mecho.cpp:46:5: warning: 'X1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   46 |     if(u==X1 && v==Y1) moze=true;
      |     ^~

Subtask #1
71.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 59 ms 7084 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 1 ms 860 KB Output isn't correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 0 ms 860 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Incorrect 12 ms 3224 KB Output isn't correct
34 Incorrect 15 ms 3160 KB Output isn't correct
35 Correct 17 ms 3164 KB Output is correct
36 Incorrect 16 ms 3416 KB Output isn't correct
37 Incorrect 20 ms 3420 KB Output isn't correct
38 Correct 21 ms 3420 KB Output is correct
39 Incorrect 20 ms 3924 KB Output isn't correct
40 Incorrect 24 ms 4036 KB Output isn't correct
41 Correct 26 ms 4184 KB Output is correct
42 Incorrect 24 ms 4236 KB Output isn't correct
43 Incorrect 30 ms 4440 KB Output isn't correct
44 Correct 32 ms 4444 KB Output is correct
45 Incorrect 29 ms 4700 KB Output isn't correct
46 Incorrect 37 ms 4700 KB Output isn't correct
47 Correct 37 ms 4700 KB Output is correct
48 Incorrect 34 ms 5292 KB Output isn't correct
49 Incorrect 45 ms 5208 KB Output isn't correct
50 Correct 46 ms 5212 KB Output is correct
51 Incorrect 52 ms 5644 KB Output isn't correct
52 Incorrect 61 ms 5720 KB Output isn't correct
53 Correct 55 ms 5724 KB Output is correct
54 Incorrect 46 ms 5976 KB Output isn't correct
55 Incorrect 59 ms 5980 KB Output isn't correct
56 Correct 70 ms 6204 KB Output is correct
57 Incorrect 53 ms 6488 KB Output isn't correct
58 Incorrect 80 ms 6640 KB Output isn't correct
59 Correct 88 ms 6672 KB Output is correct
60 Incorrect 60 ms 7004 KB Output isn't correct
61 Incorrect 87 ms 7252 KB Output isn't correct
62 Correct 85 ms 7000 KB Output is correct
63 Correct 92 ms 6996 KB Output is correct
64 Correct 152 ms 7100 KB Output is correct
65 Correct 125 ms 7116 KB Output is correct
66 Correct 96 ms 6964 KB Output is correct
67 Correct 93 ms 7100 KB Output is correct
68 Correct 46 ms 6992 KB Output is correct
69 Correct 41 ms 7000 KB Output is correct
70 Correct 41 ms 6932 KB Output is correct
71 Correct 45 ms 7000 KB Output is correct
72 Correct 29 ms 6996 KB Output is correct
73 Correct 28 ms 7416 KB Output is correct
74 Correct 43 ms 7260 KB Output is correct
75 Correct 51 ms 7256 KB Output is correct
76 Correct 54 ms 7260 KB Output is correct
77 Correct 44 ms 7256 KB Output is correct
78 Correct 55 ms 7260 KB Output is correct
79 Correct 43 ms 7248 KB Output is correct
80 Correct 44 ms 7220 KB Output is correct
81 Correct 50 ms 7248 KB Output is correct
82 Correct 45 ms 7260 KB Output is correct
83 Correct 60 ms 7260 KB Output is correct
84 Correct 52 ms 7248 KB Output is correct
85 Correct 64 ms 7252 KB Output is correct
86 Correct 62 ms 7260 KB Output is correct
87 Correct 64 ms 7324 KB Output is correct
88 Correct 58 ms 7260 KB Output is correct
89 Correct 58 ms 7036 KB Output is correct
90 Correct 59 ms 7208 KB Output is correct
91 Correct 59 ms 7260 KB Output is correct
92 Correct 70 ms 7252 KB Output is correct