oj.uz

Submission #1065625

# Submission time Handle Problem Language Result Execution time Memory
1065625 2024-08-19T10:06:47 Z belgianbot Mecho (IOI09_mecho) C++17
30 / 100
 1000 ms 65536 KB 
#include <bits/stdc++.h>
#define int long long
#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<vector<char>> grid(N, vector<char>(N));
	
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) cin >> grid[i][j];
	}
	
	int start, end;
	vector<vector<int>> adj(N * N);
	vector<int> hives;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (grid[i][j] == 'H') hives.push_back(i * N + j);
			else if (grid[i][j] == 'M') start = i * N + j;
			else if (grid[i][j] == 'D') end = i * N + j;
			if (grid[i][j] != 'G') 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);
		}
	}
	
	map<int,int> dist;
	for (int x : hives) {
		priority_queue<pair<int,int>> q;
		q.push({0,x});
		set<int> processed;
		dist[x] = 0;
		
		while(!q.empty()) {
			auto u = q.top(); q.pop();
			if (processed.find(u.se) != processed.end()) continue;
			processed.insert(u.se);
			
			for (int y : adj[u.se]) {
				if (!dist.count(y)  || -u.fi + 1 < dist[y]) {
					dist[y] = -u.fi + 1;
					q.push({-dist[y], y});
				}
			}
		}
	}
	
	int l = 1, r = N * N;
	while (l <= r) {
		int mid = l + (r - l) / 2;
		
		map<int, double> mecho;
		mecho[start] = mid;
		priority_queue<pair<double,int>> q;
		q.push({double(-mid), start});
		set<int> processed;
		
		while(!q.empty()) {
			auto u = q.top(); q.pop();
			if (processed.find(u.se) != processed.end()) continue;
			processed.insert(u.se);
			
			for (int y : adj[u.se]) {
				if (-u.fi + 1.0 / double(S) < dist[y] && (!mecho.count(y) || -u.fi + 1.0 / double(S) < mecho[y]) ) {
					mecho[y] = -u.fi + 1.0 / double(S);
					q.push({-mecho[y], y});
				}
			}
		}
		bool won = false;
		for (int y : adj[end]) if (mecho.count(y)) won = true;
		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:78:23: warning: 'end' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |   for (int y : adj[end]) if (mecho.count(y)) won = true;
      |                       ^

Subtask #1
30.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 348 KB Output is correct
7 Runtime error 262 ms 65536 KB Execution killed with signal 9
8 Incorrect 1 ms 344 KB Output isn't correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 1 ms 604 KB Output isn't correct
13 Incorrect 15 ms 816 KB Output isn't correct
14 Incorrect 26 ms 1044 KB Output isn't correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 52 ms 12884 KB Output is correct
34 Correct 75 ms 13908 KB Output is correct
35 Execution timed out 1062 ms 22868 KB Time limit exceeded
36 Correct 57 ms 16976 KB Output is correct
37 Correct 96 ms 17988 KB Output is correct
38 Execution timed out 1072 ms 29780 KB Time limit exceeded
39 Correct 71 ms 21136 KB Output is correct
40 Correct 122 ms 22808 KB Output is correct
41 Execution timed out 1006 ms 36944 KB Time limit exceeded
42 Correct 102 ms 26196 KB Output is correct
43 Correct 161 ms 28028 KB Output is correct
44 Execution timed out 1068 ms 45396 KB Time limit exceeded
45 Correct 122 ms 31412 KB Output is correct
46 Correct 195 ms 33872 KB Output is correct
47 Execution timed out 1070 ms 54720 KB Time limit exceeded
48 Correct 136 ms 37452 KB Output is correct
49 Correct 243 ms 40016 KB Output is correct
50 Execution timed out 1037 ms 61520 KB Time limit exceeded
51 Correct 158 ms 43860 KB Output is correct
52 Correct 278 ms 46924 KB Output is correct
53 Runtime error 940 ms 65536 KB Execution killed with signal 9
54 Correct 200 ms 50772 KB Output is correct
55 Correct 357 ms 54612 KB Output is correct
56 Runtime error 448 ms 65536 KB Execution killed with signal 9
57 Correct 238 ms 58196 KB Output is correct
58 Correct 415 ms 62468 KB Output is correct
59 Runtime error 432 ms 65536 KB Execution killed with signal 9
60 Runtime error 184 ms 65536 KB Execution killed with signal 9
61 Runtime error 299 ms 65536 KB Execution killed with signal 9
62 Runtime error 343 ms 65536 KB Execution killed with signal 9
63 Runtime error 428 ms 65536 KB Execution killed with signal 9
64 Runtime error 415 ms 65536 KB Execution killed with signal 9
65 Runtime error 421 ms 65536 KB Execution killed with signal 9
66 Runtime error 416 ms 65536 KB Execution killed with signal 9
67 Runtime error 416 ms 65536 KB Execution killed with signal 9
68 Runtime error 402 ms 65536 KB Execution killed with signal 9
69 Runtime error 410 ms 65536 KB Execution killed with signal 9
70 Runtime error 420 ms 65536 KB Execution killed with signal 9
71 Runtime error 426 ms 65536 KB Execution killed with signal 9
72 Runtime error 394 ms 65536 KB Execution killed with signal 9
73 Runtime error 279 ms 65536 KB Execution killed with signal 9
74 Runtime error 286 ms 65536 KB Execution killed with signal 9
75 Runtime error 289 ms 65536 KB Execution killed with signal 9
76 Runtime error 279 ms 65536 KB Execution killed with signal 9
77 Runtime error 289 ms 65536 KB Execution killed with signal 9
78 Runtime error 286 ms 65536 KB Execution killed with signal 9
79 Runtime error 300 ms 65536 KB Execution killed with signal 9
80 Runtime error 287 ms 65536 KB Execution killed with signal 9
81 Runtime error 309 ms 65536 KB Execution killed with signal 9
82 Runtime error 286 ms 65536 KB Execution killed with signal 9
83 Runtime error 279 ms 65536 KB Execution killed with signal 9
84 Runtime error 306 ms 65536 KB Execution killed with signal 9
85 Runtime error 316 ms 65536 KB Execution killed with signal 9
86 Runtime error 309 ms 65536 KB Execution killed with signal 9
87 Runtime error 288 ms 65536 KB Execution killed with signal 9
88 Runtime error 290 ms 65536 KB Execution killed with signal 9
89 Runtime error 287 ms 65536 KB Execution killed with signal 9
90 Runtime error 302 ms 65536 KB Execution killed with signal 9
91 Runtime error 271 ms 65536 KB Execution killed with signal 9
92 Runtime error 283 ms 65536 KB Execution killed with signal 9