Submission #597559

# Submission time Handle Problem Language Result Execution time Memory
597559 2022-07-16T10:25:05 Z l_reho Mecho (IOI09_mecho) C++14
37 / 100
338 ms 65536 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;
		
		visited[r][c] = true;
		
		// cout<<"DEBUG-->"<<l<<" "<<r<<" "<<c<<endl;
		
		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;
		
			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:117:12: warning: 'dr' may be used uninitialized in this function [-Wmaybe-uninitialized]
  117 |   if(solver(sr, sc, dr, dc, mid)){
      |      ~~~~~~^~~~~~~~~~~~~~~~~~~~~
mecho.cpp:117:12: warning: 'dc' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:117:12: warning: 'sr' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:117:12: warning: 'sc' may be used uninitialized in this function [-Wmaybe-uninitialized]
# 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 0 ms 212 KB Output is correct
7 Runtime error 206 ms 65536 KB Execution killed with signal 9
8 Correct 0 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 Runtime error 338 ms 65536 KB Execution killed with signal 9
14 Runtime error 183 ms 65536 KB Execution killed with signal 9
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 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 336 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 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 8 ms 1008 KB Output is correct
35 Runtime error 225 ms 65536 KB Execution killed with signal 9
36 Correct 9 ms 1084 KB Output is correct
37 Correct 10 ms 1108 KB Output is correct
38 Runtime error 205 ms 65536 KB Execution killed with signal 9
39 Correct 9 ms 1340 KB Output is correct
40 Correct 9 ms 1364 KB Output is correct
41 Runtime error 224 ms 65536 KB Execution killed with signal 9
42 Correct 12 ms 1748 KB Output is correct
43 Correct 13 ms 1748 KB Output is correct
44 Runtime error 203 ms 65536 KB Execution killed with signal 9
45 Correct 14 ms 2012 KB Output is correct
46 Correct 15 ms 2104 KB Output is correct
47 Runtime error 220 ms 65536 KB Execution killed with signal 9
48 Correct 16 ms 2388 KB Output is correct
49 Correct 17 ms 2408 KB Output is correct
50 Runtime error 218 ms 65536 KB Execution killed with signal 9
51 Correct 23 ms 2644 KB Output is correct
52 Correct 20 ms 2648 KB Output is correct
53 Runtime error 213 ms 65536 KB Execution killed with signal 9
54 Correct 24 ms 2952 KB Output is correct
55 Correct 25 ms 3028 KB Output is correct
56 Runtime error 222 ms 65536 KB Execution killed with signal 9
57 Correct 30 ms 3276 KB Output is correct
58 Correct 31 ms 3356 KB Output is correct
59 Runtime error 218 ms 65536 KB Execution killed with signal 9
60 Correct 27 ms 3660 KB Output is correct
61 Correct 38 ms 3664 KB Output is correct
62 Runtime error 225 ms 65536 KB Execution killed with signal 9
63 Correct 105 ms 3732 KB Output is correct
64 Correct 234 ms 3724 KB Output is correct
65 Correct 159 ms 3732 KB Output is correct
66 Correct 128 ms 3728 KB Output is correct
67 Correct 130 ms 3860 KB Output is correct
68 Correct 69 ms 3788 KB Output is correct
69 Correct 63 ms 3668 KB Output is correct
70 Correct 42 ms 3676 KB Output is correct
71 Correct 45 ms 3680 KB Output is correct
72 Incorrect 40 ms 3664 KB Output isn't correct
73 Runtime error 209 ms 65536 KB Execution killed with signal 9
74 Runtime error 194 ms 65536 KB Execution killed with signal 9
75 Runtime error 197 ms 65536 KB Execution killed with signal 9
76 Runtime error 210 ms 65536 KB Execution killed with signal 9
77 Runtime error 196 ms 65536 KB Execution killed with signal 9
78 Runtime error 236 ms 65536 KB Execution killed with signal 9
79 Runtime error 207 ms 65536 KB Execution killed with signal 9
80 Runtime error 196 ms 65536 KB Execution killed with signal 9
81 Runtime error 204 ms 65536 KB Execution killed with signal 9
82 Runtime error 214 ms 65536 KB Execution killed with signal 9
83 Runtime error 225 ms 65536 KB Execution killed with signal 9
84 Runtime error 255 ms 65536 KB Execution killed with signal 9
85 Runtime error 225 ms 65536 KB Execution killed with signal 9
86 Runtime error 215 ms 65536 KB Execution killed with signal 9
87 Runtime error 226 ms 65536 KB Execution killed with signal 9
88 Runtime error 209 ms 65536 KB Execution killed with signal 9
89 Runtime error 208 ms 65536 KB Execution killed with signal 9
90 Runtime error 217 ms 65536 KB Execution killed with signal 9
91 Runtime error 222 ms 65536 KB Execution killed with signal 9
92 Runtime error 251 ms 65536 KB Execution killed with signal 9