oj.uz

답안 #1066075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066075 2024-08-19T14:48:06 Z belgianbot Mecho (IOI09_mecho) C++17
100 / 100
 174 ms 38796 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});
		pro[start] = true;
		bool won = false;
		while (!q.empty()){// && q.front().fi / S < maxi) {
			auto u = q.front(); q.pop();
			if (u.se == end) {
				won = true;
				break;
			}
			if (u.fi / S >= dist[u.se]) continue;
			for (int x : adj[u.se]) if (!pro[x]){ pro[x] = true; 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:60:4: warning: 'end' may be used uninitialized in this function [-Wmaybe-uninitialized]
   60 |    if (u.se == end) {
      |    ^~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 130 ms 38788 KB Output is correct
8 Correct 1 ms 344 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 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 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 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 0 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 10 ms 5816 KB Output is correct
34 Correct 6 ms 5724 KB Output is correct
35 Correct 18 ms 6832 KB Output is correct
36 Correct 8 ms 7516 KB Output is correct
37 Correct 7 ms 7452 KB Output is correct
38 Correct 26 ms 8684 KB Output is correct
39 Correct 10 ms 9308 KB Output is correct
40 Correct 10 ms 9308 KB Output is correct
41 Correct 31 ms 10768 KB Output is correct
42 Correct 13 ms 11352 KB Output is correct
43 Correct 12 ms 11356 KB Output is correct
44 Correct 41 ms 13240 KB Output is correct
45 Correct 16 ms 13660 KB Output is correct
46 Correct 16 ms 13660 KB Output is correct
47 Correct 48 ms 16192 KB Output is correct
48 Correct 19 ms 16220 KB Output is correct
49 Correct 18 ms 16220 KB Output is correct
50 Correct 63 ms 19136 KB Output is correct
51 Correct 21 ms 19036 KB Output is correct
52 Correct 20 ms 19036 KB Output is correct
53 Correct 73 ms 22356 KB Output is correct
54 Correct 24 ms 22108 KB Output is correct
55 Correct 30 ms 22100 KB Output is correct
56 Correct 83 ms 25732 KB Output is correct
57 Correct 33 ms 25180 KB Output is correct
58 Correct 29 ms 25180 KB Output is correct
59 Correct 105 ms 29732 KB Output is correct
60 Correct 42 ms 28756 KB Output is correct
61 Correct 30 ms 28756 KB Output is correct
62 Correct 133 ms 33616 KB Output is correct
63 Correct 98 ms 30712 KB Output is correct
64 Correct 174 ms 30556 KB Output is correct
65 Correct 141 ms 30704 KB Output is correct
66 Correct 118 ms 30652 KB Output is correct
67 Correct 98 ms 30548 KB Output is correct
68 Correct 82 ms 30540 KB Output is correct
69 Correct 73 ms 30552 KB Output is correct
70 Correct 71 ms 30544 KB Output is correct
71 Correct 75 ms 30544 KB Output is correct
72 Correct 65 ms 30548 KB Output is correct
73 Correct 94 ms 38744 KB Output is correct
74 Correct 106 ms 38736 KB Output is correct
75 Correct 128 ms 38736 KB Output is correct
76 Correct 126 ms 38784 KB Output is correct
77 Correct 122 ms 38736 KB Output is correct
78 Correct 127 ms 38780 KB Output is correct
79 Correct 108 ms 38796 KB Output is correct
80 Correct 117 ms 38736 KB Output is correct
81 Correct 114 ms 38740 KB Output is correct
82 Correct 119 ms 38740 KB Output is correct
83 Correct 121 ms 38748 KB Output is correct
84 Correct 112 ms 38500 KB Output is correct
85 Correct 122 ms 38620 KB Output is correct
86 Correct 123 ms 38736 KB Output is correct
87 Correct 130 ms 38560 KB Output is correct
88 Correct 133 ms 38740 KB Output is correct
89 Correct 126 ms 38696 KB Output is correct
90 Correct 130 ms 38752 KB Output is correct
91 Correct 123 ms 38736 KB Output is correct
92 Correct 126 ms 38740 KB Output is correct