oj.uz

답안 #597577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
597577 2022-07-16T10:44:55 Z l_reho Mecho (IOI09_mecho) C++14
84 / 100
 194 ms 4072 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

int N, S;

vector<string> V;
vector<vector<int>> P;

int dirs[4][2] = {{1, 0},{0, 1},{-1, 0},{0, -1}};

struct info{
	int r, c, d;
	info(){}
	
	info(int _r, int _c, int _d): r(_r), c(_c), d(_d) {}
};

void precompute(vector<pair<int, int>> starts){
	
	queue<info> q;
	
	for(int i = 0; i < (int)starts.size(); i++){
		q.push(info(starts[i].first, starts[i].second, 0));
		P[starts[i].first][starts[i].second] = 0;
	}
	
	while(!q.empty()){
		info curr = q.front();
		q.pop();
		
		int r = curr.r;
		int c = curr.c;
		int depth = curr.d;
		
		for(int i = 0; i < 4; i++){
			int nr = r + dirs[i][0];
			int nc = c + dirs[i][1];
			
			if(nr < 0 || nr >= N || nc < 0 || nc >= N || V[nr][nc] != 'G' || P[nr][nc] != INT_MAX) continue;
			 
			P[nr][nc] = depth+1;
			
			q.push(info(nr, nc, depth+1));
			
		}
		
	}
	
	
}

bool solver(int r, int c, int dr, int dc, int l){
	
	queue<info> q;
	
	q.push(info(r, c, l+1));	
	vector<vector<bool>> visited(N, vector<bool>(N, false));
	
	while(!q.empty()){
		info curr = q.front();
		q.pop();
		
		int r = curr.r;
		int c = curr.c;
		int depth = curr.d;
			
		// cout<<"DEBUG-->"<<l<<" "<<r<<" "<<c<<endl;
		visited[r][c] = true;
		
		for(int i = 0; i < 4; i++){
			int nr = r + dirs[i][0];
			int nc = c + dirs[i][1];
			
			if(nr < 0 || nr >= N || nc < 0 || nc >= N || (V[nr][nc] != 'G' && V[nr][nc] != 'D') || visited[nr][nc] || P[nr][nc] <= (l + (int)((depth-l)/S))) continue;
	
			visited[nr][nc] = true;
	
			q.push(info(nr, nc, depth+1));
				
		}
		
	}
	
		
	return visited[dr][dc];
}

void solve(){
	cin>>N>>S;
	
	V.assign(N, "");
	P.assign(N, vector<int>(N, INT_MAX));
	
	vector<pair<int, int>> starts;
	int sr, sc, dr, dc;
	for(int i = 0; i < N; i++){
		cin>>V[i];
		for(int j = 0; j < N; j++) 
			if(V[i][j] == 'H') starts.push_back({i, j});
			else if(V[i][j] == 'M') sr = i, sc = j;
			else if(V[i][j] == 'D') dr = i, dc = j;
			
	}
	
	precompute(starts);

	int low = -1;
	int high = N*N+1;
	int ans = -1;

	while(low < high){
		int mid = low + (high - low)/2;

		if(solver(sr, sc, dr, dc, mid)){
			ans = mid;
			low = mid+1;
		}else high = mid;
		
	}
	
	cout<<ans<<endl;
	
}

int main(){
	solve();
}

Compilation message

mecho.cpp: In function 'void solve()':
mecho.cpp:116:12: warning: 'sr' may be used uninitialized in this function [-Wmaybe-uninitialized]
  116 |   if(solver(sr, sc, dr, dc, mid)){
      |      ~~~~~~^~~~~~~~~~~~~~~~~~~~~
mecho.cpp:116:12: warning: 'dc' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:116:12: warning: 'dr' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:116:12: warning: 'sc' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 92 ms 3880 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 6 ms 980 KB Output is correct
34 Correct 7 ms 932 KB Output is correct
35 Correct 24 ms 980 KB Output is correct
36 Correct 8 ms 1108 KB Output is correct
37 Correct 8 ms 1184 KB Output is correct
38 Correct 36 ms 1108 KB Output is correct
39 Correct 11 ms 1364 KB Output is correct
40 Correct 11 ms 1388 KB Output is correct
41 Correct 37 ms 1376 KB Output is correct
42 Correct 12 ms 1748 KB Output is correct
43 Correct 13 ms 1800 KB Output is correct
44 Correct 51 ms 1828 KB Output is correct
45 Correct 14 ms 2004 KB Output is correct
46 Correct 15 ms 2004 KB Output is correct
47 Correct 62 ms 2092 KB Output is correct
48 Correct 16 ms 2404 KB Output is correct
49 Correct 17 ms 2516 KB Output is correct
50 Correct 73 ms 2408 KB Output is correct
51 Correct 20 ms 2644 KB Output is correct
52 Correct 22 ms 2588 KB Output is correct
53 Correct 79 ms 2684 KB Output is correct
54 Correct 24 ms 2900 KB Output is correct
55 Correct 25 ms 2944 KB Output is correct
56 Correct 108 ms 2900 KB Output is correct
57 Correct 25 ms 3284 KB Output is correct
58 Correct 28 ms 3324 KB Output is correct
59 Correct 137 ms 3364 KB Output is correct
60 Correct 29 ms 3728 KB Output is correct
61 Correct 30 ms 3736 KB Output is correct
62 Correct 165 ms 3736 KB Output is correct
63 Correct 113 ms 3728 KB Output is correct
64 Correct 194 ms 3616 KB Output is correct
65 Correct 158 ms 3736 KB Output is correct
66 Correct 141 ms 3660 KB Output is correct
67 Correct 134 ms 3732 KB Output is correct
68 Correct 62 ms 3660 KB Output is correct
69 Correct 50 ms 3664 KB Output is correct
70 Correct 46 ms 3732 KB Output is correct
71 Correct 48 ms 3652 KB Output is correct
72 Incorrect 39 ms 3668 KB Output isn't correct
73 Incorrect 69 ms 4048 KB Output isn't correct
74 Correct 74 ms 4068 KB Output is correct
75 Correct 70 ms 4072 KB Output is correct
76 Correct 80 ms 4052 KB Output is correct
77 Correct 70 ms 4068 KB Output is correct
78 Correct 86 ms 3924 KB Output is correct
79 Correct 57 ms 3924 KB Output is correct
80 Correct 73 ms 4016 KB Output is correct
81 Correct 81 ms 3956 KB Output is correct
82 Correct 69 ms 4012 KB Output is correct
83 Correct 84 ms 3956 KB Output is correct
84 Correct 82 ms 3920 KB Output is correct
85 Correct 86 ms 3944 KB Output is correct
86 Correct 88 ms 3912 KB Output is correct
87 Correct 88 ms 3892 KB Output is correct
88 Correct 84 ms 3796 KB Output is correct
89 Correct 92 ms 3856 KB Output is correct
90 Correct 101 ms 3868 KB Output is correct
91 Correct 88 ms 3860 KB Output is correct
92 Correct 91 ms 3772 KB Output is correct