답안 #896747

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
896747	2024-01-02T04:12:29 Z	LCJLY	Mecho (IOI09_mecho)	C++14	49 / 100	172 ms	12380 KB

mecho

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;
 
void solve(){	
	int n,k;
	cin >> n >> k;
	
	string arr[n];
	for(int x=0;x<n;x++){
		cin >> arr[x];
	}
	
	int l=0;
	int r=n*n;
	int best=-1;
	int mid;
	
	pii start;
	pii done;
	
	int dist[n+5][n+5];
	memset(dist,-1,sizeof(dist));
	queue<pii>q;
	for(int x=0;x<n;x++){
		for(int y=0;y<n;y++){
			if(arr[x][y]=='H'){
				q.push({x,y});
				dist[x][y]=0;
			}
			else if(arr[x][y]=='M') start={x,y};
			else if(arr[x][y]=='D') done={x,y};
		}
	}
	
	pii dir[4]={
		{0,1},
		{0,-1},
		{1,0},
		{-1,0},
	};
	
	while(!q.empty()){
		pii cur=q.front();
		q.pop();
		for(auto it:dir){
			int newx=cur.first+it.first;
			int newy=cur.second+it.second;
			if(newx<0||newy<0||newx>=n||newy>=n) continue;
			if(dist[newx][newy]!=-1) continue;
			if(arr[newx][newy]=='G'||arr[newx][newy]=='M'){
				dist[newx][newy]=dist[cur.first][cur.second]+1;
				q.push({newx,newy});
			}
		}
	}
	
	while(l<=r){
		mid=(l+r)/2;
		
		int dist2[n][n];
		
		memset(dist2,-1,sizeof(dist2));
		dist2[start.first][start.second]=k*mid;
		if(mid<dist[start.first][start.second])q.push({start.first,start.second});
		bool visited[n+5][n+5];
		memset(visited,0,sizeof(visited));
		
		while(!q.empty()){
			pii cur=q.front();
			q.pop();;
			for(auto it:dir){
				int newx=cur.first+it.first;
				int newy=cur.second+it.second;
				if(newx<0||newy<0||newx>=n||newy>=n) continue;
				if(dist2[newx][newy]!=-1) continue;
				if(dist[newx][newy]<(dist2[cur.first][cur.second]+k)/k) continue;
				if(arr[newx][newy]=='M'||arr[newx][newy]=='G'){
					dist2[newx][newy]=dist2[cur.first][cur.second]+1;
					q.push({newx,newy});
				}
			}
		}

		
		bool amos=false;
		for(auto it:dir){
			int newx=done.first+it.first;
			int newy=done.second+it.second;
			if(newx<0||newy<0||newx>=n||newy>=n) continue;
			if(dist2[newx][newy]==-1) continue;
			if(arr[newx][newy]=='G'||arr[newx][newy]=='M'){
				if(dist2[newx][newy]!=-1) amos=true;
			}
		}	
		
		if(amos){
			best=mid;
			l=mid+1;
		}
		else r=mid-1;
	}
	cout << best;
}
 
int32_t main(){										
	ios::sync_with_stdio(0);	
	cin.tie(0);
	//freopen("out.txt", "w", stdout);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}	
}

Subtask #1

49.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	348 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	57 ms	11868 KB	Output is correct
8	Incorrect	0 ms	600 KB	Output isn't correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Incorrect	0 ms	348 KB	Output isn't correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Incorrect	1 ms	348 KB	Output isn't correct
16	Correct	0 ms	348 KB	Output is correct
17	Incorrect	0 ms	348 KB	Output isn't correct
18	Correct	0 ms	348 KB	Output is correct
19	Incorrect	0 ms	348 KB	Output isn't correct
20	Correct	0 ms	348 KB	Output is correct
21	Incorrect	0 ms	348 KB	Output isn't correct
22	Correct	0 ms	348 KB	Output is correct
23	Incorrect	0 ms	348 KB	Output isn't correct
24	Correct	0 ms	348 KB	Output is correct
25	Incorrect	0 ms	348 KB	Output isn't correct
26	Correct	0 ms	348 KB	Output is correct
27	Incorrect	0 ms	348 KB	Output isn't correct
28	Correct	0 ms	348 KB	Output is correct
29	Incorrect	0 ms	348 KB	Output isn't correct
30	Correct	0 ms	456 KB	Output is correct
31	Incorrect	0 ms	600 KB	Output isn't correct
32	Correct	1 ms	372 KB	Output is correct
33	Incorrect	4 ms	2652 KB	Output isn't correct
34	Correct	6 ms	2652 KB	Output is correct
35	Correct	15 ms	2664 KB	Output is correct
36	Incorrect	5 ms	3164 KB	Output isn't correct
37	Correct	6 ms	3200 KB	Output is correct
38	Correct	19 ms	3164 KB	Output is correct
39	Incorrect	7 ms	3932 KB	Output isn't correct
40	Correct	8 ms	3932 KB	Output is correct
41	Correct	26 ms	4100 KB	Output is correct
42	Incorrect	7 ms	4700 KB	Output isn't correct
43	Correct	8 ms	4700 KB	Output is correct
44	Correct	34 ms	4940 KB	Output is correct
45	Incorrect	9 ms	5720 KB	Output isn't correct
46	Correct	10 ms	5664 KB	Output is correct
47	Correct	40 ms	5724 KB	Output is correct
48	Incorrect	10 ms	6744 KB	Output isn't correct
49	Correct	12 ms	6748 KB	Output is correct
50	Correct	44 ms	6748 KB	Output is correct
51	Incorrect	12 ms	8024 KB	Output isn't correct
52	Correct	14 ms	7772 KB	Output is correct
53	Correct	63 ms	7992 KB	Output is correct
54	Incorrect	14 ms	9052 KB	Output isn't correct
55	Correct	16 ms	8980 KB	Output is correct
56	Correct	87 ms	9196 KB	Output is correct
57	Incorrect	15 ms	10328 KB	Output isn't correct
58	Correct	18 ms	10392 KB	Output is correct
59	Correct	95 ms	10332 KB	Output is correct
60	Incorrect	18 ms	11608 KB	Output isn't correct
61	Correct	21 ms	11612 KB	Output is correct
62	Correct	106 ms	11868 KB	Output is correct
63	Correct	98 ms	11868 KB	Output is correct
64	Correct	172 ms	11604 KB	Output is correct
65	Correct	134 ms	11612 KB	Output is correct
66	Incorrect	119 ms	11868 KB	Output isn't correct
67	Correct	98 ms	11612 KB	Output is correct
68	Correct	40 ms	11912 KB	Output is correct
69	Correct	40 ms	11868 KB	Output is correct
70	Correct	30 ms	11856 KB	Output is correct
71	Correct	37 ms	11864 KB	Output is correct
72	Correct	29 ms	11868 KB	Output is correct
73	Correct	26 ms	12380 KB	Output is correct
74	Correct	41 ms	12360 KB	Output is correct
75	Correct	53 ms	12380 KB	Output is correct
76	Correct	43 ms	12376 KB	Output is correct
77	Correct	44 ms	12352 KB	Output is correct
78	Correct	56 ms	12124 KB	Output is correct
79	Correct	35 ms	12120 KB	Output is correct
80	Correct	40 ms	12124 KB	Output is correct
81	Correct	45 ms	12124 KB	Output is correct
82	Correct	41 ms	12124 KB	Output is correct
83	Correct	52 ms	12120 KB	Output is correct
84	Correct	47 ms	12276 KB	Output is correct
85	Correct	70 ms	12320 KB	Output is correct
86	Correct	51 ms	12124 KB	Output is correct
87	Correct	63 ms	12264 KB	Output is correct
88	Correct	62 ms	12140 KB	Output is correct
89	Correct	54 ms	12124 KB	Output is correct
90	Correct	60 ms	12120 KB	Output is correct
91	Correct	57 ms	12124 KB	Output is correct
92	Correct	59 ms	12124 KB	Output is correct