Submission #1066054

# Submission time Handle Problem Language Result Execution time Memory
1066054 2024-08-19T14:29:01 Z belgianbot Mecho (IOI09_mecho) C++17
42 / 100
244 ms 65540 KB
#include <bits/stdc++.h>
#define se second
#define fi first

using namespace std;

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int N, S; cin >> N >> S;
	vector<string> grid(N);
	
	for (int i = 0; i < N; i++) {
		cin >> grid[i];
	}
	
	int start, end;
	vector<int> dist(N * N, INT_MAX);
	vector<vector<int>> adj(N * N);
	queue<pair<int,int>> hives;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (grid[i][j] == 'H') {
				hives.push({i * N + j, 1});
				dist[i * N + j] = 0;
			}
			else if (grid[i][j] == 'M') start = i * N + j;
			else if (grid[i][j] == 'D') end = i * N + j;
			if (grid[i][j] == 'H' || grid[i][j] == 'T') continue;
			if (i && (grid[i - 1][j] == 'D' || grid[i - 1][j] == 'H' || grid[i - 1][j] == 'M' || grid[i - 1][j] == 'G')) adj[i * N - N + j].push_back(i * N + j);
			if (j && (grid[i][j-1] == 'D' || grid[i][j-1] == 'H' || grid[i][j-1] == 'M' || grid[i][j-1] == 'G')) adj[i * N + j-1].push_back(i * N + j);
			if (i != N - 1 && (grid[i + 1][j] == 'D' || grid[i + 1][j] == 'H' || grid[i + 1][j] == 'M' || grid[i + 1][j] == 'G')) adj[i * N + N + j].push_back(i * N + j);
			if (j != N - 1 && (grid[i][j+1] == 'D' || grid[i][j+1] == 'H' || grid[i][j+1] == 'M' || grid[i][j+1] == 'G')) adj[i * N + j+1].push_back(i * N + j);
		}
	}
	
	
	while (!hives.empty()) {
		auto x = hives.front(); hives.pop();
		for (int y : adj[x.fi]) {
			if (dist[y] == INT_MAX && grid[y / N][y % N] != 'D'){
				hives.push({y, x.se + 1});
				dist[y] = x.se;
			}
		}
	}
	int maxi = 0;
	for (int x : adj[end]) maxi = max(maxi, dist[x] != INT_MAX ? dist[x] : 0);
	vector<bool> pro;
	int l = 0, r = N * N / 2 + N;
	while (l <= r) {
		int mid = l + (r - l) / 2;
		pro.clear(); pro.resize(N * N, false);
		queue<pair<int,int>> q;
		q.push({mid * S, start});
		bool won = false;
		while (!q.empty() && !won && q.front().fi / S < maxi) {
			auto u = q.front(); q.pop();
			pro[u.se] = true;
			for (int x : adj[u.se]) {
				if (x == end) {won = true; break;}
				if (!pro[x] && (u.fi + 1) / S < dist[x]) q.push({u.fi + 1, x});
			}
		}

		if (won) l = mid + 1;
		else r = mid - 1;
	}
	
	cout << l - 1 << '\n';
	return 0;
}
		
	
	
	

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:48:22: warning: 'end' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |  for (int x : adj[end]) maxi = max(maxi, dist[x] != INT_MAX ? dist[x] : 0);
      |                      ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Runtime error 164 ms 65536 KB Execution killed with signal 9
8 Correct 1 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 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Runtime error 244 ms 65536 KB Execution killed with signal 9
14 Runtime error 193 ms 65536 KB Execution killed with signal 9
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 6 ms 5724 KB Output is correct
34 Correct 6 ms 5724 KB Output is correct
35 Runtime error 189 ms 65536 KB Execution killed with signal 9
36 Correct 9 ms 7512 KB Output is correct
37 Correct 10 ms 7320 KB Output is correct
38 Runtime error 175 ms 65536 KB Execution killed with signal 9
39 Correct 11 ms 9308 KB Output is correct
40 Correct 9 ms 9420 KB Output is correct
41 Runtime error 178 ms 65536 KB Execution killed with signal 9
42 Correct 16 ms 11352 KB Output is correct
43 Correct 12 ms 11356 KB Output is correct
44 Runtime error 178 ms 65536 KB Execution killed with signal 9
45 Correct 17 ms 13656 KB Output is correct
46 Correct 15 ms 13824 KB Output is correct
47 Runtime error 178 ms 65536 KB Execution killed with signal 9
48 Correct 19 ms 16216 KB Output is correct
49 Correct 17 ms 16232 KB Output is correct
50 Runtime error 178 ms 65536 KB Execution killed with signal 9
51 Correct 30 ms 19032 KB Output is correct
52 Correct 21 ms 19036 KB Output is correct
53 Runtime error 177 ms 65536 KB Execution killed with signal 9
54 Correct 26 ms 22108 KB Output is correct
55 Correct 25 ms 22108 KB Output is correct
56 Runtime error 190 ms 65536 KB Execution killed with signal 9
57 Correct 32 ms 25176 KB Output is correct
58 Correct 31 ms 25176 KB Output is correct
59 Runtime error 177 ms 65536 KB Execution killed with signal 9
60 Correct 34 ms 28720 KB Output is correct
61 Correct 30 ms 28668 KB Output is correct
62 Runtime error 184 ms 65536 KB Execution killed with signal 9
63 Correct 98 ms 30544 KB Output is correct
64 Correct 158 ms 30548 KB Output is correct
65 Correct 142 ms 30544 KB Output is correct
66 Correct 116 ms 30556 KB Output is correct
67 Correct 118 ms 30544 KB Output is correct
68 Correct 76 ms 30552 KB Output is correct
69 Correct 86 ms 30544 KB Output is correct
70 Correct 78 ms 30544 KB Output is correct
71 Correct 71 ms 30672 KB Output is correct
72 Incorrect 65 ms 30636 KB Output isn't correct
73 Runtime error 168 ms 65536 KB Execution killed with signal 9
74 Runtime error 167 ms 65536 KB Execution killed with signal 9
75 Runtime error 222 ms 65540 KB Execution killed with signal 9
76 Runtime error 179 ms 65536 KB Execution killed with signal 9
77 Runtime error 161 ms 65536 KB Execution killed with signal 9
78 Runtime error 162 ms 65536 KB Execution killed with signal 9
79 Runtime error 154 ms 65536 KB Execution killed with signal 9
80 Runtime error 160 ms 65536 KB Execution killed with signal 9
81 Runtime error 155 ms 65536 KB Execution killed with signal 9
82 Runtime error 166 ms 65536 KB Execution killed with signal 9
83 Runtime error 165 ms 65536 KB Execution killed with signal 9
84 Runtime error 168 ms 65536 KB Execution killed with signal 9
85 Runtime error 167 ms 65536 KB Execution killed with signal 9
86 Runtime error 165 ms 65536 KB Execution killed with signal 9
87 Runtime error 159 ms 65536 KB Execution killed with signal 9
88 Runtime error 156 ms 65536 KB Execution killed with signal 9
89 Runtime error 153 ms 65536 KB Execution killed with signal 9
90 Runtime error 162 ms 65536 KB Execution killed with signal 9
91 Runtime error 158 ms 65536 KB Execution killed with signal 9
92 Runtime error 151 ms 65536 KB Execution killed with signal 9