oj.uz

답안 #876673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876673 2023-11-22T08:02:30 Z MisterReaper Mecho (IOI09_mecho) C++17
84 / 100
 117 ms 8016 KB 
#pragma optimize("unroll-loops,O3")

#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] == '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;
}

Compilation message

mecho.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("unroll-loops,O3")
      |

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 5468 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 1 ms 5468 KB Output is correct
4 Correct 1 ms 5468 KB Output is correct
5 Correct 1 ms 5468 KB Output is correct
6 Correct 1 ms 5464 KB Output is correct
7 Correct 99 ms 6632 KB Output is correct
8 Correct 2 ms 5468 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 1 ms 5468 KB Output is correct
11 Correct 1 ms 5468 KB Output is correct
12 Incorrect 2 ms 5468 KB Output isn't correct
13 Incorrect 2 ms 5584 KB Output isn't correct
14 Correct 2 ms 5468 KB Output is correct
15 Correct 1 ms 5468 KB Output is correct
16 Correct 2 ms 5468 KB Output is correct
17 Correct 2 ms 5468 KB Output is correct
18 Correct 1 ms 5468 KB Output is correct
19 Correct 1 ms 5468 KB Output is correct
20 Correct 1 ms 5468 KB Output is correct
21 Correct 2 ms 5468 KB Output is correct
22 Correct 2 ms 5468 KB Output is correct
23 Correct 2 ms 5468 KB Output is correct
24 Correct 2 ms 5464 KB Output is correct
25 Correct 2 ms 5468 KB Output is correct
26 Correct 2 ms 5468 KB Output is correct
27 Correct 2 ms 5468 KB Output is correct
28 Correct 3 ms 5580 KB Output is correct
29 Correct 2 ms 5468 KB Output is correct
30 Correct 2 ms 5468 KB Output is correct
31 Correct 2 ms 5468 KB Output is correct
32 Correct 2 ms 5468 KB Output is correct
33 Correct 5 ms 5720 KB Output is correct
34 Correct 5 ms 5628 KB Output is correct
35 Correct 23 ms 5720 KB Output is correct
36 Correct 6 ms 5724 KB Output is correct
37 Correct 6 ms 5724 KB Output is correct
38 Correct 25 ms 5720 KB Output is correct
39 Correct 9 ms 5980 KB Output is correct
40 Correct 7 ms 5724 KB Output is correct
41 Correct 32 ms 5724 KB Output is correct
42 Correct 8 ms 5720 KB Output is correct
43 Correct 8 ms 5724 KB Output is correct
44 Correct 43 ms 5724 KB Output is correct
45 Correct 9 ms 5724 KB Output is correct
46 Correct 10 ms 5724 KB Output is correct
47 Correct 47 ms 5976 KB Output is correct
48 Correct 11 ms 5976 KB Output is correct
49 Correct 12 ms 5868 KB Output is correct
50 Correct 59 ms 5980 KB Output is correct
51 Correct 12 ms 5976 KB Output is correct
52 Correct 13 ms 5980 KB Output is correct
53 Correct 70 ms 6044 KB Output is correct
54 Correct 13 ms 5976 KB Output is correct
55 Correct 15 ms 5968 KB Output is correct
56 Correct 84 ms 6100 KB Output is correct
57 Correct 15 ms 5980 KB Output is correct
58 Correct 21 ms 5944 KB Output is correct
59 Correct 97 ms 5980 KB Output is correct
60 Correct 17 ms 5976 KB Output is correct
61 Correct 20 ms 5980 KB Output is correct
62 Correct 109 ms 5980 KB Output is correct
63 Correct 81 ms 6148 KB Output is correct
64 Correct 117 ms 6148 KB Output is correct
65 Correct 114 ms 6152 KB Output is correct
66 Correct 101 ms 5972 KB Output is correct
67 Correct 91 ms 6148 KB Output is correct
68 Correct 41 ms 6232 KB Output is correct
69 Correct 44 ms 6236 KB Output is correct
70 Correct 34 ms 6236 KB Output is correct
71 Correct 29 ms 6236 KB Output is correct
72 Incorrect 31 ms 6184 KB Output isn't correct
73 Incorrect 76 ms 7756 KB Output isn't correct
74 Correct 63 ms 7736 KB Output is correct
75 Correct 73 ms 8016 KB Output is correct
76 Correct 67 ms 7736 KB Output is correct
77 Correct 67 ms 7728 KB Output is correct
78 Correct 84 ms 7616 KB Output is correct
79 Correct 57 ms 7516 KB Output is correct
80 Correct 68 ms 7760 KB Output is correct
81 Correct 80 ms 7504 KB Output is correct
82 Correct 64 ms 7624 KB Output is correct
83 Correct 81 ms 7148 KB Output is correct
84 Correct 73 ms 7208 KB Output is correct
85 Correct 77 ms 7252 KB Output is correct
86 Correct 81 ms 7368 KB Output is correct
87 Correct 78 ms 7260 KB Output is correct
88 Correct 81 ms 6892 KB Output is correct
89 Correct 82 ms 6992 KB Output is correct
90 Correct 85 ms 7004 KB Output is correct
91 Correct 91 ms 6992 KB Output is correct
92 Correct 90 ms 7004 KB Output is correct