oj.uz

Submission #815668

# Submission time Handle Problem Language Result Execution time Memory
815668 2023-08-08T18:00:55 Z Mustela_Erminea Mecho (IOI09_mecho) C++14
29 / 100
 153 ms 6540 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 + 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

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 468 KB Output isn't correct
2 Incorrect 0 ms 468 KB Output isn't correct
3 Incorrect 1 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 63 ms 5120 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 1 ms 468 KB Output isn't correct
16 Correct 0 ms 468 KB Output is correct
17 Incorrect 1 ms 468 KB Output isn't correct
18 Correct 1 ms 596 KB Output is correct
19 Incorrect 1 ms 596 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 724 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 5 ms 2004 KB Output isn't correct
34 Correct 4 ms 2260 KB Output is correct
35 Correct 17 ms 2928 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 3280 KB Output is correct
39 Incorrect 6 ms 2516 KB Output isn't correct
40 Correct 7 ms 2900 KB Output is correct
41 Correct 30 ms 3636 KB Output is correct
42 Incorrect 8 ms 2772 KB Output isn't correct
43 Correct 9 ms 3208 KB Output is correct
44 Correct 39 ms 3988 KB Output is correct
45 Incorrect 9 ms 2964 KB Output isn't correct
46 Correct 10 ms 3488 KB Output is correct
47 Correct 41 ms 4336 KB Output is correct
48 Incorrect 14 ms 3284 KB Output isn't correct
49 Correct 12 ms 3752 KB Output is correct
50 Correct 58 ms 4564 KB Output is correct
51 Incorrect 13 ms 3452 KB Output isn't correct
52 Correct 15 ms 3924 KB Output is correct
53 Correct 64 ms 5032 KB Output is correct
54 Incorrect 15 ms 3676 KB Output isn't correct
55 Correct 16 ms 4180 KB Output is correct
56 Correct 73 ms 5388 KB Output is correct
57 Incorrect 17 ms 3988 KB Output isn't correct
58 Correct 20 ms 4520 KB Output is correct
59 Correct 84 ms 5716 KB Output is correct
60 Incorrect 18 ms 4096 KB Output isn't correct
61 Correct 21 ms 4828 KB Output is correct
62 Correct 95 ms 6084 KB Output is correct
63 Correct 77 ms 5968 KB Output is correct
64 Correct 153 ms 6072 KB Output is correct
65 Correct 118 ms 6200 KB Output is correct
66 Incorrect 96 ms 6036 KB Output isn't correct
67 Incorrect 90 ms 5980 KB Output isn't correct
68 Correct 38 ms 5844 KB Output is correct
69 Correct 34 ms 6068 KB Output is correct
70 Correct 34 ms 6080 KB Output is correct
71 Correct 31 ms 6100 KB Output is correct
72 Incorrect 24 ms 4284 KB Output isn't correct
73 Incorrect 26 ms 6472 KB Output isn't correct
74 Correct 52 ms 6476 KB Output is correct
75 Correct 55 ms 6480 KB Output is correct
76 Correct 50 ms 6476 KB Output is correct
77 Correct 55 ms 6540 KB Output is correct
78 Incorrect 57 ms 5176 KB Output isn't correct
79 Correct 39 ms 4744 KB Output is correct
80 Correct 50 ms 4900 KB Output is correct
81 Correct 52 ms 4948 KB Output is correct
82 Correct 56 ms 5008 KB Output is correct
83 Correct 59 ms 5032 KB Output is correct
84 Correct 59 ms 4940 KB Output is correct
85 Correct 58 ms 5076 KB Output is correct
86 Correct 61 ms 5108 KB Output is correct
87 Correct 56 ms 4984 KB Output is correct
88 Correct 59 ms 5136 KB Output is correct
89 Correct 82 ms 4964 KB Output is correct
90 Correct 70 ms 5056 KB Output is correct
91 Correct 61 ms 5116 KB Output is correct
92 Correct 62 ms 5188 KB Output is correct