oj.uz

답안 #815665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
815665 2023-08-08T17:59:22 Z Mustela_Erminea Mecho (IOI09_mecho) C++14
29 / 100
 166 ms 6556 KB 
#include <iostream>
#include <vector>
#include <queue>
#define pii pair<int, int>

using namespace std;

int N, S;
int mR, mC, dR, dC;
char grid[801][801];
int minHiveDist[801][801], minBearDist[801][801];

const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, -1, 1 };
bool isValid(int r, int c) { return 0 <= r && r < N && 0 <= c && c < N; }

void bfs(vector<pii> initialCoords, int minDist[801][801]) {
	queue<pair<pii, int>> q; 
	vector<vector<bool>> visited(801, vector<bool>(801));
	for (pii p : initialCoords) {
		q.push({ p, 0 }); visited[p.first][p.second] = true;
	}
	while (!q.empty()) {
		pii loc = q.front().first; int dist = q.front().second; q.pop();
		minDist[loc.first][loc.second] = dist;
		for (int i = 0; i < 4; i++) {
			int r = loc.first + dx[i], c = loc.second + dy[i];
			if (isValid(r, c) && !visited[r][c] && grid[r][c] != 'T') {
				visited[r][c] = true;
				q.push({ {r, c}, dist + 1 });
			}
		}
	}
}

vector<vector<bool>> visited;
void bfs2(int startR, int startC, int wait) {
	visited.clear(); visited.resize(N, vector<bool>(N));
	queue<pair<pii, int>> q; q.push({ {startR, startC}, 0 });
	visited[startR][startC] = true;
	while (!q.empty()) {
		pii loc = q.front().first; int dist = q.front().second; q.pop();
		minBearDist[loc.first][loc.second] = dist;
		for (int i = 0; i < 4; i++) {
			int r = loc.first + dx[i], c = loc.second + dy[i];
			if (isValid(r, c) && !visited[r][c] && grid[r][c] != 'T') {
				if (dist / S + 1 + wait <= minHiveDist[r][c]) {
					visited[r][c] = true;
					q.push({ {r, c}, dist + 1 });
				}
			}
		}
	}
}
bool works(int wait) {
	bfs2(mR, mC, wait);
	return visited[dR][dC];
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);

	cin >> N >> S;
	for (int i = 0; i < N; i++)
		for (int j = 0; j < N; j++)
			cin >> grid[i][j];
	
	vector<pii> hives;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (grid[i][j] == 'H') hives.push_back({ i, j });
			if (grid[i][j] == 'M') { mR = i; mC = j; }
			if (grid[i][j] == 'D') { dR = i; dC = j; }
		}
	}

	bfs(hives, minHiveDist); minHiveDist[dR][dC] = (int)1e9;

	int low = 0, high = N * N;
	while (low < high) {
		int mid = (low + high + 1) / 2;
		if (works(mid)) low = mid;
		else high = mid - 1;
	} cout << low << endl;
}

Subtask #1
29.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 468 KB Output isn't correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Incorrect 0 ms 468 KB Output isn't correct
4 Incorrect 0 ms 468 KB Output isn't correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 65 ms 5144 KB Output is correct
8 Incorrect 0 ms 468 KB Output isn't correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Incorrect 1 ms 596 KB Output isn't correct
13 Incorrect 1 ms 724 KB Output isn't correct
14 Incorrect 1 ms 724 KB Output isn't correct
15 Incorrect 0 ms 468 KB Output isn't correct
16 Correct 1 ms 468 KB Output is correct
17 Incorrect 1 ms 468 KB Output isn't correct
18 Correct 0 ms 596 KB Output is correct
19 Incorrect 0 ms 468 KB Output isn't correct
20 Correct 1 ms 596 KB Output is correct
21 Incorrect 1 ms 596 KB Output isn't correct
22 Correct 1 ms 596 KB Output is correct
23 Incorrect 1 ms 596 KB Output isn't correct
24 Correct 1 ms 724 KB Output is correct
25 Incorrect 1 ms 724 KB Output isn't correct
26 Correct 1 ms 724 KB Output is correct
27 Incorrect 1 ms 724 KB Output isn't correct
28 Correct 1 ms 724 KB Output is correct
29 Incorrect 1 ms 724 KB Output isn't correct
30 Correct 1 ms 852 KB Output is correct
31 Incorrect 1 ms 724 KB Output isn't correct
32 Correct 1 ms 852 KB Output is correct
33 Incorrect 4 ms 2004 KB Output isn't correct
34 Correct 5 ms 2260 KB Output is correct
35 Correct 17 ms 2932 KB Output is correct
36 Incorrect 5 ms 2260 KB Output isn't correct
37 Correct 6 ms 2644 KB Output is correct
38 Correct 22 ms 3284 KB Output is correct
39 Incorrect 6 ms 2516 KB Output isn't correct
40 Correct 7 ms 2936 KB Output is correct
41 Correct 30 ms 3620 KB Output is correct
42 Incorrect 8 ms 2772 KB Output isn't correct
43 Correct 9 ms 3136 KB Output is correct
44 Correct 39 ms 3972 KB Output is correct
45 Incorrect 9 ms 3028 KB Output isn't correct
46 Correct 11 ms 3480 KB Output is correct
47 Correct 42 ms 4324 KB Output is correct
48 Incorrect 11 ms 3220 KB Output isn't correct
49 Correct 12 ms 3736 KB Output is correct
50 Correct 54 ms 4600 KB Output is correct
51 Incorrect 12 ms 3412 KB Output isn't correct
52 Correct 13 ms 3960 KB Output is correct
53 Correct 64 ms 4940 KB Output is correct
54 Incorrect 15 ms 3668 KB Output isn't correct
55 Correct 16 ms 4192 KB Output is correct
56 Correct 73 ms 5388 KB Output is correct
57 Incorrect 16 ms 3976 KB Output isn't correct
58 Correct 18 ms 4576 KB Output is correct
59 Correct 83 ms 5736 KB Output is correct
60 Incorrect 22 ms 4236 KB Output isn't correct
61 Correct 20 ms 4820 KB Output is correct
62 Correct 95 ms 6088 KB Output is correct
63 Correct 78 ms 6032 KB Output is correct
64 Correct 166 ms 6088 KB Output is correct
65 Correct 120 ms 6060 KB Output is correct
66 Incorrect 98 ms 6092 KB Output isn't correct
67 Incorrect 91 ms 6088 KB Output isn't correct
68 Correct 38 ms 5820 KB Output is correct
69 Correct 33 ms 6100 KB Output is correct
70 Correct 33 ms 6092 KB Output is correct
71 Correct 32 ms 6068 KB Output is correct
72 Incorrect 24 ms 4180 KB Output isn't correct
73 Incorrect 27 ms 6456 KB Output isn't correct
74 Correct 51 ms 6556 KB Output is correct
75 Correct 53 ms 6548 KB Output is correct
76 Correct 51 ms 6544 KB Output is correct
77 Correct 62 ms 6536 KB Output is correct
78 Incorrect 58 ms 5132 KB Output isn't correct
79 Correct 39 ms 4712 KB Output is correct
80 Correct 47 ms 4836 KB Output is correct
81 Correct 52 ms 5048 KB Output is correct
82 Correct 47 ms 4920 KB Output is correct
83 Correct 61 ms 5124 KB Output is correct
84 Correct 58 ms 4928 KB Output is correct
85 Correct 58 ms 5076 KB Output is correct
86 Correct 62 ms 5084 KB Output is correct
87 Correct 56 ms 5092 KB Output is correct
88 Correct 59 ms 5196 KB Output is correct
89 Correct 69 ms 5076 KB Output is correct
90 Correct 68 ms 4984 KB Output is correct
91 Correct 62 ms 5076 KB Output is correct
92 Correct 64 ms 5136 KB Output is correct