oj.uz

답안 #896730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896730 2024-01-02T03:10:20 Z LCJLY Mecho (IOI09_mecho) C++14
2 / 100
 105 ms 12636 KB 
#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;
	int best=0;
	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;
			dist[newx][newy]=dist[cur.first][cur.second]+1;
			q.push({newx,newy});
		}
	}
	
	//for(int x=0;x<n;x++){
		//for(int y=0;y<n;y++){
			//cout << dist[x][y] << " ";
		//}
		//cout << "\n";
	//}

	
	while(l<=r){
		mid=(l+r)/2;
		
		int dist2[n][n];
		
		memset(dist2,-1,sizeof(dist2));
		dist2[start.first][start.second]=k*mid;
		q.push({start.first,start.second});
		
		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;
				int hold=(dist2[cur.first][cur.second]+k)/k;
				if(dist[newx][newy]<hold) continue;
				dist2[newx][newy]=dist2[cur.first][cur.second]+1;
				q.push({newx,newy});
			}
		}
		
		if(dist2[done.first][done.second]!=-1){
			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
2.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Incorrect 1 ms 344 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 Incorrect 0 ms 348 KB Output isn't correct
7 Incorrect 52 ms 11868 KB Output isn't correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Incorrect 1 ms 600 KB Output isn't correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Incorrect 0 ms 452 KB Output isn't correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Incorrect 0 ms 348 KB Output isn't correct
20 Incorrect 1 ms 348 KB Output isn't correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Incorrect 0 ms 348 KB Output isn't correct
23 Incorrect 0 ms 348 KB Output isn't correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Incorrect 0 ms 348 KB Output isn't correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Incorrect 0 ms 348 KB Output isn't correct
28 Incorrect 1 ms 348 KB Output isn't correct
29 Incorrect 1 ms 548 KB Output isn't correct
30 Incorrect 1 ms 348 KB Output isn't correct
31 Incorrect 1 ms 348 KB Output isn't correct
32 Incorrect 1 ms 348 KB Output isn't correct
33 Incorrect 6 ms 2652 KB Output isn't correct
34 Incorrect 8 ms 2652 KB Output isn't correct
35 Incorrect 17 ms 2652 KB Output isn't correct
36 Incorrect 5 ms 3340 KB Output isn't correct
37 Incorrect 11 ms 3160 KB Output isn't correct
38 Incorrect 22 ms 3164 KB Output isn't correct
39 Incorrect 9 ms 4044 KB Output isn't correct
40 Incorrect 14 ms 3928 KB Output isn't correct
41 Incorrect 25 ms 3932 KB Output isn't correct
42 Incorrect 8 ms 4768 KB Output isn't correct
43 Incorrect 17 ms 4700 KB Output isn't correct
44 Incorrect 35 ms 4928 KB Output isn't correct
45 Incorrect 14 ms 5724 KB Output isn't correct
46 Incorrect 21 ms 5720 KB Output isn't correct
47 Incorrect 51 ms 5724 KB Output isn't correct
48 Incorrect 12 ms 6872 KB Output isn't correct
49 Incorrect 27 ms 6832 KB Output isn't correct
50 Incorrect 61 ms 6748 KB Output isn't correct
51 Incorrect 19 ms 7772 KB Output isn't correct
52 Incorrect 31 ms 7772 KB Output isn't correct
53 Incorrect 58 ms 7772 KB Output isn't correct
54 Incorrect 16 ms 9052 KB Output isn't correct
55 Incorrect 36 ms 9052 KB Output isn't correct
56 Incorrect 69 ms 9040 KB Output isn't correct
57 Incorrect 33 ms 10320 KB Output isn't correct
58 Incorrect 43 ms 10328 KB Output isn't correct
59 Incorrect 88 ms 10332 KB Output isn't correct
60 Incorrect 20 ms 11868 KB Output isn't correct
61 Incorrect 46 ms 11732 KB Output isn't correct
62 Incorrect 105 ms 11868 KB Output isn't correct
63 Incorrect 20 ms 11868 KB Output isn't correct
64 Incorrect 50 ms 11716 KB Output isn't correct
65 Incorrect 33 ms 11868 KB Output isn't correct
66 Incorrect 27 ms 11856 KB Output isn't correct
67 Incorrect 22 ms 11864 KB Output isn't correct
68 Incorrect 19 ms 12132 KB Output isn't correct
69 Incorrect 20 ms 12116 KB Output isn't correct
70 Incorrect 21 ms 12124 KB Output isn't correct
71 Incorrect 22 ms 11940 KB Output isn't correct
72 Incorrect 20 ms 12104 KB Output isn't correct
73 Incorrect 23 ms 12380 KB Output isn't correct
74 Incorrect 36 ms 12280 KB Output isn't correct
75 Incorrect 40 ms 12404 KB Output isn't correct
76 Incorrect 42 ms 12272 KB Output isn't correct
77 Incorrect 43 ms 12376 KB Output isn't correct
78 Incorrect 46 ms 12120 KB Output isn't correct
79 Incorrect 40 ms 12636 KB Output isn't correct
80 Incorrect 39 ms 12124 KB Output isn't correct
81 Incorrect 44 ms 12232 KB Output isn't correct
82 Incorrect 38 ms 12124 KB Output isn't correct
83 Incorrect 51 ms 12124 KB Output isn't correct
84 Incorrect 41 ms 12200 KB Output isn't correct
85 Incorrect 49 ms 12124 KB Output isn't correct
86 Incorrect 54 ms 12280 KB Output isn't correct
87 Incorrect 47 ms 12120 KB Output isn't correct
88 Incorrect 50 ms 12172 KB Output isn't correct
89 Incorrect 51 ms 12116 KB Output isn't correct
90 Incorrect 49 ms 12156 KB Output isn't correct
91 Incorrect 52 ms 12116 KB Output isn't correct
92 Incorrect 50 ms 12120 KB Output isn't correct