oj.uz

답안 #1088862

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1088862 2024-09-15T10:52:52 Z StefanSebez Mecho (IOI09_mecho) C++14
38 / 100
 181 ms 7988 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;}
		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(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: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:32: warning: 'Y0' may be used uninitialized in this function [-Wmaybe-uninitialized]
   38 |   kju.push({X0,Y0});was[X0][Y0]=true;
      |                     ~~~~~~~~~~~^~~~~
mecho.cpp:38:32: warning: 'X0' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:44:14: warning: 'Y1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |     if(u==X1 && v==Y1) moze=true;
      |        ~~~~~~^~~~~~~~
mecho.cpp:44:5: warning: 'X1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |     if(u==X1 && v==Y1) moze=true;
      |     ^~

Subtask #1
38.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 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 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 64 ms 7832 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Correct 1 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 Incorrect 0 ms 604 KB Output isn't correct
14 Correct 1 ms 860 KB Output is correct
15 Incorrect 0 ms 600 KB Output isn't correct
16 Correct 0 ms 604 KB Output is correct
17 Incorrect 0 ms 604 KB Output isn't correct
18 Correct 1 ms 600 KB Output is correct
19 Incorrect 0 ms 604 KB Output isn't correct
20 Correct 1 ms 604 KB Output is correct
21 Incorrect 0 ms 704 KB Output isn't correct
22 Correct 0 ms 604 KB Output is correct
23 Incorrect 0 ms 604 KB Output isn't correct
24 Correct 1 ms 604 KB Output is correct
25 Incorrect 1 ms 860 KB Output isn't correct
26 Correct 1 ms 860 KB Output is correct
27 Incorrect 1 ms 860 KB Output isn't correct
28 Correct 1 ms 860 KB Output is correct
29 Incorrect 1 ms 860 KB Output isn't correct
30 Correct 1 ms 860 KB Output is correct
31 Incorrect 1 ms 860 KB Output isn't correct
32 Correct 1 ms 860 KB Output is correct
33 Incorrect 12 ms 3344 KB Output isn't correct
34 Incorrect 14 ms 3164 KB Output isn't correct
35 Correct 21 ms 3164 KB Output is correct
36 Incorrect 16 ms 3644 KB Output isn't correct
37 Incorrect 19 ms 3932 KB Output isn't correct
38 Correct 21 ms 3672 KB Output is correct
39 Incorrect 21 ms 4188 KB Output isn't correct
40 Incorrect 23 ms 4188 KB Output isn't correct
41 Correct 26 ms 4260 KB Output is correct
42 Incorrect 27 ms 4688 KB Output isn't correct
43 Incorrect 31 ms 4696 KB Output isn't correct
44 Correct 32 ms 4700 KB Output is correct
45 Incorrect 33 ms 4952 KB Output isn't correct
46 Incorrect 37 ms 4952 KB Output isn't correct
47 Correct 39 ms 5180 KB Output is correct
48 Incorrect 36 ms 5720 KB Output isn't correct
49 Incorrect 45 ms 5468 KB Output isn't correct
50 Correct 43 ms 5656 KB Output is correct
51 Incorrect 41 ms 5980 KB Output isn't correct
52 Incorrect 60 ms 5980 KB Output isn't correct
53 Correct 54 ms 5976 KB Output is correct
54 Incorrect 54 ms 6488 KB Output isn't correct
55 Incorrect 82 ms 6492 KB Output isn't correct
56 Correct 74 ms 6492 KB Output is correct
57 Incorrect 58 ms 7064 KB Output isn't correct
58 Incorrect 76 ms 7004 KB Output isn't correct
59 Correct 79 ms 7204 KB Output is correct
60 Incorrect 66 ms 7620 KB Output isn't correct
61 Incorrect 86 ms 7724 KB Output isn't correct
62 Correct 94 ms 7712 KB Output is correct
63 Correct 85 ms 7632 KB Output is correct
64 Correct 181 ms 7728 KB Output is correct
65 Correct 126 ms 7492 KB Output is correct
66 Incorrect 130 ms 7688 KB Output isn't correct
67 Correct 123 ms 7508 KB Output is correct
68 Correct 51 ms 7616 KB Output is correct
69 Correct 44 ms 7760 KB Output is correct
70 Correct 37 ms 7760 KB Output is correct
71 Correct 39 ms 7772 KB Output is correct
72 Incorrect 34 ms 7628 KB Output isn't correct
73 Incorrect 38 ms 7924 KB Output isn't correct
74 Correct 50 ms 7928 KB Output is correct
75 Correct 57 ms 7940 KB Output is correct
76 Correct 52 ms 7988 KB Output is correct
77 Correct 56 ms 7860 KB Output is correct
78 Correct 65 ms 7764 KB Output is correct
79 Correct 41 ms 7760 KB Output is correct
80 Correct 50 ms 7764 KB Output is correct
81 Correct 56 ms 7764 KB Output is correct
82 Correct 48 ms 7984 KB Output is correct
83 Correct 68 ms 7772 KB Output is correct
84 Correct 59 ms 7720 KB Output is correct
85 Correct 63 ms 7772 KB Output is correct
86 Correct 53 ms 7768 KB Output is correct
87 Correct 62 ms 7756 KB Output is correct
88 Correct 57 ms 7680 KB Output is correct
89 Correct 56 ms 7772 KB Output is correct
90 Correct 58 ms 7760 KB Output is correct
91 Correct 65 ms 7888 KB Output is correct
92 Correct 63 ms 7764 KB Output is correct