oj.uz

답안 #876677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876677 2023-11-22T08:06:45 Z MisterReaper Mecho (IOI09_mecho) C++17
30 / 100
 114 ms 7784 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

const int MAXN = 800 + 5;

char matrix[MAXN][MAXN];
int distBee[MAXN][MAXN];
int distBear[MAXN][MAXN];

int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};

#define ONLINE_JUDGE
void solve() {
	memset(distBee, -1, sizeof(distBee));

	int n, s;
	cin >> n >> s;

	pair <int, int> initial;
	pair <int, int> home;

	queue <array <int, 3>> q;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			cin >> matrix[i][j];
			if(matrix[i][j] == 'H') {
				q.push({0, i, j});
			} else if(matrix[i][j] == 'M') {
				initial = {i, j};
			} else if(matrix[i][j] == 'D') {
				home = {i, j};
			}
		}
	}

	auto in = [&](int x, int y) -> bool {
		return 1 <= min(x, y) && max(x, y) <= n;
	};

	while(!q.empty()) {
		auto [d, x, y] = q.front();
		q.pop();
		if(distBee[x][y] != -1) {
			continue;
		}

		distBee[x][y] = d;
		for(int dir = 0; dir < 4; dir++) {
			int _x = x + dx[dir], _y = y + dy[dir];
			if(in(_x, _y) && (matrix[_x][_y] == 'D' || matrix[_x][_y] == 'G')) {
				q.push({d +1, _x, _y});
			}
		}
	}

	auto check = [&](int k) -> bool {
		memset(distBear, -1, sizeof(distBear));

		q.push({s * k, initial.first, initial.second});
		while(!q.empty()) {
			auto [d, x, y] = q.front();
			q.pop();
			if(distBear[x][y] != -1 || (distBee[x][y] != -1 && d > distBee[x][y] * s)) {
				continue;
			}

			//cerr << d << " :: " << x << " " << y << " | " << distBee[x][y] << "\n";
			distBear[x][y] = d;
			for(int dir = 0; dir < 4; dir++) {
				int _x = x + dx[dir], _y = y + dy[dir];
				if(in(_x, _y) && (matrix[_x][_y] == 'G' || matrix[_x][_y] == 'D') && distBear[_x][_y] == -1) {
					q.push({d +1, _x, _y});
				}
			}
		}

		if(distBear[home.first][home.second] == -1) {
			return false;
		}

		return true;
	};
	
	int l = 0, r = n * n + 2, ans = 0;
	while(l <= r) {
		int mid = (l + r) / 2;
		if(check(mid -1)) {
			ans = mid;
			l = mid +1;
		} else {
			r = mid -1;
		}
	}

	cout << ans -1;

	return;
}

signed main() {
	#ifndef ONLINE_JUDGE
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif

	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);

	int t = 1; //cin >> t;
	for(int i = 1; i <= t; i++) {
		solve();
	}

	return 0;
}

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 5464 KB Output isn't correct
2 Incorrect 1 ms 5976 KB Output isn't correct
3 Incorrect 1 ms 5468 KB Output isn't correct
4 Incorrect 1 ms 5468 KB Output isn't correct
5 Correct 1 ms 5468 KB Output is correct
6 Incorrect 2 ms 5468 KB Output isn't correct
7 Incorrect 96 ms 6652 KB Output isn't correct
8 Incorrect 1 ms 5468 KB Output isn't correct
9 Correct 1 ms 5468 KB Output is correct
10 Correct 1 ms 5468 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Incorrect 2 ms 5468 KB Output isn't correct
13 Incorrect 2 ms 5468 KB Output isn't correct
14 Correct 2 ms 5468 KB Output is correct
15 Incorrect 2 ms 5464 KB Output isn't correct
16 Correct 2 ms 5544 KB Output is correct
17 Incorrect 1 ms 5468 KB Output isn't correct
18 Correct 1 ms 5468 KB Output is correct
19 Incorrect 2 ms 5468 KB Output isn't correct
20 Correct 1 ms 5464 KB Output is correct
21 Incorrect 2 ms 5468 KB Output isn't correct
22 Correct 2 ms 5468 KB Output is correct
23 Incorrect 2 ms 5468 KB Output isn't correct
24 Correct 1 ms 5468 KB Output is correct
25 Incorrect 2 ms 5468 KB Output isn't correct
26 Correct 2 ms 5468 KB Output is correct
27 Incorrect 2 ms 5468 KB Output isn't correct
28 Correct 2 ms 5464 KB Output is correct
29 Incorrect 2 ms 5468 KB Output isn't correct
30 Correct 2 ms 5468 KB Output is correct
31 Incorrect 2 ms 5468 KB Output isn't correct
32 Correct 2 ms 5468 KB Output is correct
33 Incorrect 5 ms 5724 KB Output isn't correct
34 Correct 5 ms 5724 KB Output is correct
35 Correct 21 ms 5724 KB Output is correct
36 Incorrect 6 ms 5724 KB Output isn't correct
37 Correct 6 ms 5724 KB Output is correct
38 Correct 27 ms 5684 KB Output is correct
39 Incorrect 7 ms 5724 KB Output isn't correct
40 Correct 7 ms 5724 KB Output is correct
41 Correct 35 ms 5724 KB Output is correct
42 Incorrect 8 ms 5720 KB Output isn't correct
43 Correct 9 ms 5720 KB Output is correct
44 Correct 50 ms 5920 KB Output is correct
45 Incorrect 9 ms 5724 KB Output isn't correct
46 Correct 10 ms 5788 KB Output is correct
47 Correct 48 ms 5980 KB Output is correct
48 Incorrect 11 ms 5980 KB Output isn't correct
49 Correct 14 ms 5980 KB Output is correct
50 Correct 57 ms 5980 KB Output is correct
51 Incorrect 12 ms 5980 KB Output isn't correct
52 Correct 13 ms 5976 KB Output is correct
53 Correct 73 ms 6052 KB Output is correct
54 Incorrect 14 ms 5980 KB Output isn't correct
55 Correct 17 ms 5944 KB Output is correct
56 Correct 84 ms 6100 KB Output is correct
57 Incorrect 17 ms 5980 KB Output isn't correct
58 Correct 17 ms 5980 KB Output is correct
59 Correct 100 ms 5984 KB Output is correct
60 Incorrect 20 ms 6488 KB Output isn't correct
61 Correct 19 ms 5980 KB Output is correct
62 Correct 110 ms 6180 KB Output is correct
63 Correct 82 ms 5980 KB Output is correct
64 Correct 109 ms 5980 KB Output is correct
65 Correct 114 ms 6152 KB Output is correct
66 Incorrect 103 ms 5972 KB Output isn't correct
67 Correct 87 ms 5980 KB Output is correct
68 Correct 43 ms 6056 KB Output is correct
69 Correct 47 ms 6236 KB Output is correct
70 Correct 34 ms 6072 KB Output is correct
71 Correct 30 ms 6488 KB Output is correct
72 Incorrect 33 ms 6236 KB Output isn't correct
73 Incorrect 75 ms 7724 KB Output isn't correct
74 Correct 65 ms 7776 KB Output is correct
75 Correct 68 ms 7784 KB Output is correct
76 Correct 67 ms 7772 KB Output is correct
77 Correct 69 ms 7620 KB Output is correct
78 Correct 81 ms 7620 KB Output is correct
79 Correct 52 ms 7508 KB Output is correct
80 Correct 66 ms 7508 KB Output is correct
81 Correct 78 ms 7508 KB Output is correct
82 Correct 84 ms 7396 KB Output is correct
83 Correct 81 ms 7380 KB Output is correct
84 Correct 73 ms 7228 KB Output is correct
85 Correct 72 ms 7252 KB Output is correct
86 Correct 83 ms 7204 KB Output is correct
87 Correct 78 ms 7260 KB Output is correct
88 Correct 81 ms 6896 KB Output is correct
89 Correct 89 ms 7096 KB Output is correct
90 Correct 87 ms 7004 KB Output is correct
91 Correct 93 ms 6908 KB Output is correct
92 Correct 95 ms 7148 KB Output is correct