oj.uz

답안 #1088857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1088857 2024-09-15T10:42:42 Z StefanSebez Mecho (IOI09_mecho) C++14
30 / 100
 156 ms 8028 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
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});}
    }
    //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=2000,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;dst<=2000;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:34:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |   int mid=l+r>>1;
      |           ~^~
mecho.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     scanf("%i%i",&n,&S);
      |     ~~~~~^~~~~~~~~~~~~~
mecho.cpp:36:32: warning: 'Y0' may be used uninitialized in this function [-Wmaybe-uninitialized]
   36 |   kju.push({X0,Y0});was[X0][Y0]=true;
      |                     ~~~~~~~~~~~^~~~~
mecho.cpp:36:32: warning: 'X0' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:42:14: warning: 'Y1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   42 |     if(u==X1 && v==Y1) moze=true;
      |        ~~~~~~^~~~~~~~
mecho.cpp:42:5: warning: 'X1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   42 |     if(u==X1 && v==Y1) moze=true;
      |     ^~

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 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 1 ms 348 KB Output isn't correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Incorrect 63 ms 7836 KB Output isn't correct
8 Incorrect 1 ms 344 KB Output isn't correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 1 ms 860 KB Output isn't correct
13 Incorrect 1 ms 604 KB Output isn't correct
14 Correct 1 ms 860 KB Output is correct
15 Incorrect 0 ms 604 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 604 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 604 KB Output isn't correct
22 Correct 1 ms 604 KB Output is correct
23 Incorrect 1 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 700 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 5 ms 3164 KB Output isn't correct
34 Incorrect 19 ms 3160 KB Output isn't correct
35 Correct 17 ms 3160 KB Output is correct
36 Incorrect 8 ms 3676 KB Output isn't correct
37 Incorrect 19 ms 3912 KB Output isn't correct
38 Correct 21 ms 3796 KB Output is correct
39 Incorrect 8 ms 4188 KB Output isn't correct
40 Incorrect 22 ms 4140 KB Output isn't correct
41 Correct 26 ms 4184 KB Output is correct
42 Incorrect 13 ms 4696 KB Output isn't correct
43 Incorrect 24 ms 4700 KB Output isn't correct
44 Correct 32 ms 4700 KB Output is correct
45 Incorrect 10 ms 4956 KB Output isn't correct
46 Incorrect 22 ms 5136 KB Output isn't correct
47 Correct 44 ms 4952 KB Output is correct
48 Incorrect 12 ms 5468 KB Output isn't correct
49 Incorrect 45 ms 5464 KB Output isn't correct
50 Correct 48 ms 5468 KB Output is correct
51 Incorrect 19 ms 5940 KB Output isn't correct
52 Incorrect 51 ms 5976 KB Output isn't correct
53 Correct 63 ms 6176 KB Output is correct
54 Incorrect 14 ms 6488 KB Output isn't correct
55 Incorrect 33 ms 6492 KB Output isn't correct
56 Correct 66 ms 6568 KB Output is correct
57 Incorrect 16 ms 7060 KB Output isn't correct
58 Incorrect 40 ms 6984 KB Output isn't correct
59 Correct 86 ms 7004 KB Output is correct
60 Incorrect 18 ms 7508 KB Output isn't correct
61 Incorrect 82 ms 7504 KB Output isn't correct
62 Correct 90 ms 7508 KB Output is correct
63 Correct 87 ms 7504 KB Output is correct
64 Correct 156 ms 7604 KB Output is correct
65 Correct 145 ms 7668 KB Output is correct
66 Incorrect 110 ms 7632 KB Output isn't correct
67 Correct 85 ms 7504 KB Output is correct
68 Correct 49 ms 7760 KB Output is correct
69 Correct 37 ms 7620 KB Output is correct
70 Correct 42 ms 7740 KB Output is correct
71 Correct 34 ms 7504 KB Output is correct
72 Incorrect 30 ms 7636 KB Output isn't correct
73 Incorrect 27 ms 8020 KB Output isn't correct
74 Correct 45 ms 7936 KB Output is correct
75 Correct 48 ms 8028 KB Output is correct
76 Correct 75 ms 8020 KB Output is correct
77 Correct 78 ms 8020 KB Output is correct
78 Correct 66 ms 7760 KB Output is correct
79 Correct 48 ms 7956 KB Output is correct
80 Correct 49 ms 7764 KB Output is correct
81 Correct 53 ms 8016 KB Output is correct
82 Correct 47 ms 7916 KB Output is correct
83 Correct 61 ms 7944 KB Output is correct
84 Correct 95 ms 7884 KB Output is correct
85 Correct 58 ms 7944 KB Output is correct
86 Correct 74 ms 7884 KB Output is correct
87 Correct 58 ms 7760 KB Output is correct
88 Correct 59 ms 7772 KB Output is correct
89 Correct 60 ms 7712 KB Output is correct
90 Correct 75 ms 7764 KB Output is correct
91 Correct 59 ms 7772 KB Output is correct
92 Correct 63 ms 7876 KB Output is correct