oj.uz

Submission #597568

# Submission time Handle Problem Language Result Execution time Memory
597568 2022-07-16T10:33:45 Z l_reho Mecho (IOI09_mecho) C++14
84 / 100
 216 ms 4704 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 + (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 = 0;
	int high = N*N;
	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-1;
		
	}
	
	
	cout<<ans<<endl;
	
}

int main(){
	solve();
}

Compilation message

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

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory 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 1 ms 212 KB Output is correct
7 Correct 96 ms 4408 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 2 ms 300 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 1 ms 212 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 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 7 ms 1012 KB Output is correct
34 Correct 7 ms 980 KB Output is correct
35 Correct 23 ms 1108 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 8 ms 1108 KB Output is correct
38 Correct 36 ms 1336 KB Output is correct
39 Correct 11 ms 1364 KB Output is correct
40 Correct 10 ms 1364 KB Output is correct
41 Correct 40 ms 1492 KB Output is correct
42 Correct 13 ms 1792 KB Output is correct
43 Correct 13 ms 1748 KB Output is correct
44 Correct 54 ms 2092 KB Output is correct
45 Correct 15 ms 2040 KB Output is correct
46 Correct 15 ms 2104 KB Output is correct
47 Correct 70 ms 2392 KB Output is correct
48 Correct 17 ms 2388 KB Output is correct
49 Correct 20 ms 2284 KB Output is correct
50 Correct 80 ms 2748 KB Output is correct
51 Correct 19 ms 2644 KB Output is correct
52 Correct 20 ms 2592 KB Output is correct
53 Correct 88 ms 3156 KB Output is correct
54 Correct 24 ms 3020 KB Output is correct
55 Correct 26 ms 2932 KB Output is correct
56 Correct 111 ms 3496 KB Output is correct
57 Correct 29 ms 3276 KB Output is correct
58 Correct 29 ms 3264 KB Output is correct
59 Correct 120 ms 3820 KB Output is correct
60 Correct 28 ms 3724 KB Output is correct
61 Correct 29 ms 3692 KB Output is correct
62 Correct 126 ms 4372 KB Output is correct
63 Correct 121 ms 3724 KB Output is correct
64 Correct 216 ms 3648 KB Output is correct
65 Correct 153 ms 3732 KB Output is correct
66 Correct 133 ms 3736 KB Output is correct
67 Correct 141 ms 3732 KB Output is correct
68 Correct 53 ms 3632 KB Output is correct
69 Correct 54 ms 3696 KB Output is correct
70 Correct 43 ms 3668 KB Output is correct
71 Correct 49 ms 3656 KB Output is correct
72 Incorrect 45 ms 3736 KB Output isn't correct
73 Incorrect 77 ms 4692 KB Output isn't correct
74 Correct 66 ms 4672 KB Output is correct
75 Correct 78 ms 4704 KB Output is correct
76 Correct 67 ms 4588 KB Output is correct
77 Correct 67 ms 4692 KB Output is correct
78 Correct 109 ms 4640 KB Output is correct
79 Correct 56 ms 4640 KB Output is correct
80 Correct 71 ms 4564 KB Output is correct
81 Correct 72 ms 4564 KB Output is correct
82 Correct 74 ms 4644 KB Output is correct
83 Correct 90 ms 4560 KB Output is correct
84 Correct 86 ms 4548 KB Output is correct
85 Correct 93 ms 4572 KB Output is correct
86 Correct 83 ms 4676 KB Output is correct
87 Correct 82 ms 4576 KB Output is correct
88 Correct 92 ms 4432 KB Output is correct
89 Correct 105 ms 4484 KB Output is correct
90 Correct 91 ms 4496 KB Output is correct
91 Correct 89 ms 4488 KB Output is correct
92 Correct 97 ms 4492 KB Output is correct