답안 #896742

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
896742	2024-01-02T03:53:26 Z	LCJLY	Mecho (IOI09_mecho)	C++14	27 / 100	310 ms	21044 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]=='T') continue;
			if(arr[newx][newy]=='D') continue;
			dist[newx][newy]=dist[cur.first][cur.second]+1;
			q.push({newx,newy});
		}
	}
	
	dist[done.first][done.second]=1e15;
	
	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));
		
		for(int x=0;x<n;x++){
			vector<pii>storage;
			int target=(x+1+mid)*k;
			while(!q.empty()){
				pii cur=q.front();
				q.pop();
				if((dist2[cur.first][cur.second]+k-1)/k==x+mid+1&&x+mid+1<dist[cur.first][cur.second]){
					storage.push_back({cur.first,cur.second});
					visited[cur.first][cur.second]=1;
				}
				if(dist2[cur.first][cur.second]>=target) continue;
				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(arr[newx][newy]=='T') continue;
					dist2[newx][newy]=dist2[cur.first][cur.second]+1;
					q.push({newx,newy});
				}
			}
			
			for(auto it:storage) q.push(it);
		}
		
		if(visited[done.first][done.second]){
			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

27.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	600 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	Incorrect	0 ms	348 KB	Output isn't correct
6	Incorrect	0 ms	596 KB	Output isn't correct
7	Incorrect	104 ms	12760 KB	Output isn't correct
8	Correct	0 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	Incorrect	0 ms	344 KB	Output isn't correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Incorrect	0 ms	348 KB	Output isn't correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	0 ms	348 KB	Output isn't correct
19	Correct	0 ms	348 KB	Output is correct
20	Incorrect	0 ms	344 KB	Output isn't correct
21	Correct	0 ms	348 KB	Output is correct
22	Incorrect	0 ms	348 KB	Output isn't correct
23	Correct	0 ms	348 KB	Output is correct
24	Incorrect	0 ms	348 KB	Output isn't correct
25	Correct	1 ms	348 KB	Output is correct
26	Incorrect	0 ms	348 KB	Output isn't correct
27	Correct	0 ms	348 KB	Output is correct
28	Incorrect	0 ms	348 KB	Output isn't correct
29	Correct	1 ms	348 KB	Output is correct
30	Incorrect	1 ms	348 KB	Output isn't correct
31	Correct	1 ms	348 KB	Output is correct
32	Incorrect	0 ms	348 KB	Output isn't correct
33	Correct	10 ms	2652 KB	Output is correct
34	Incorrect	6 ms	2652 KB	Output isn't correct
35	Incorrect	20 ms	3812 KB	Output isn't correct
36	Correct	12 ms	3420 KB	Output is correct
37	Incorrect	7 ms	3164 KB	Output isn't correct
38	Incorrect	20 ms	4888 KB	Output isn't correct
39	Correct	19 ms	4184 KB	Output is correct
40	Incorrect	8 ms	3932 KB	Output isn't correct
41	Incorrect	26 ms	5932 KB	Output isn't correct
42	Correct	22 ms	4696 KB	Output is correct
43	Incorrect	10 ms	4956 KB	Output isn't correct
44	Incorrect	31 ms	7288 KB	Output isn't correct
45	Correct	26 ms	5852 KB	Output is correct
46	Incorrect	14 ms	5936 KB	Output isn't correct
47	Incorrect	64 ms	10440 KB	Output isn't correct
48	Correct	28 ms	6744 KB	Output is correct
49	Incorrect	14 ms	6748 KB	Output isn't correct
50	Incorrect	78 ms	10984 KB	Output isn't correct
51	Correct	33 ms	8004 KB	Output is correct
52	Incorrect	17 ms	8028 KB	Output isn't correct
53	Incorrect	63 ms	12084 KB	Output isn't correct
54	Correct	43 ms	9052 KB	Output is correct
55	Incorrect	20 ms	9152 KB	Output isn't correct
56	Incorrect	83 ms	13676 KB	Output isn't correct
57	Correct	50 ms	10468 KB	Output is correct
58	Incorrect	26 ms	10328 KB	Output isn't correct
59	Incorrect	137 ms	15720 KB	Output isn't correct
60	Correct	47 ms	11612 KB	Output is correct
61	Incorrect	25 ms	11868 KB	Output isn't correct
62	Incorrect	105 ms	21044 KB	Output isn't correct
63	Incorrect	164 ms	11868 KB	Output isn't correct
64	Correct	310 ms	20592 KB	Output is correct
65	Incorrect	258 ms	12184 KB	Output isn't correct
66	Incorrect	160 ms	11856 KB	Output isn't correct
67	Incorrect	176 ms	11888 KB	Output isn't correct
68	Incorrect	55 ms	11856 KB	Output isn't correct
69	Correct	78 ms	13724 KB	Output is correct
70	Incorrect	39 ms	11856 KB	Output isn't correct
71	Incorrect	34 ms	11856 KB	Output isn't correct
72	Correct	29 ms	12572 KB	Output is correct
73	Correct	31 ms	12408 KB	Output is correct
74	Incorrect	57 ms	13096 KB	Output isn't correct
75	Incorrect	77 ms	12380 KB	Output isn't correct
76	Incorrect	69 ms	12372 KB	Output isn't correct
77	Incorrect	82 ms	12220 KB	Output isn't correct
78	Incorrect	86 ms	12124 KB	Output isn't correct
79	Incorrect	76 ms	15940 KB	Output isn't correct
80	Incorrect	64 ms	12352 KB	Output isn't correct
81	Incorrect	87 ms	12124 KB	Output isn't correct
82	Incorrect	74 ms	12372 KB	Output isn't correct
83	Incorrect	88 ms	12124 KB	Output isn't correct
84	Incorrect	80 ms	15136 KB	Output isn't correct
85	Incorrect	113 ms	12424 KB	Output isn't correct
86	Incorrect	109 ms	12460 KB	Output isn't correct
87	Incorrect	81 ms	12492 KB	Output isn't correct
88	Incorrect	102 ms	12420 KB	Output isn't correct
89	Incorrect	129 ms	16088 KB	Output isn't correct
90	Incorrect	118 ms	12820 KB	Output isn't correct
91	Incorrect	87 ms	13160 KB	Output isn't correct
92	Incorrect	96 ms	12716 KB	Output isn't correct