답안 #815994

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
815994	2023-08-09T03:28:14 Z	powervic08	Mecho (IOI09_mecho)	C++17	84 / 100	157 ms	6544 KB

mecho

#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; }
 
vector<vector<bool>> visited;
void bfs(vector<pii> initialCoords) {
	queue<pair<pii, int>> q; 
	visited.clear(); visited.resize(N, vector<bool>(N));
	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();
		minHiveDist[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 + S });
			}
		}
	}
}
 
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}, wait * S });
	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 + 1 < 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[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 << (works(low) ? low : low - 1) << endl;
}

Subtask #1

84.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	328 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	68 ms	5260 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Incorrect	1 ms	468 KB	Output isn't correct
13	Incorrect	1 ms	596 KB	Output isn't correct
14	Correct	1 ms	596 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	1 ms	468 KB	Output is correct
20	Correct	1 ms	456 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	468 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	596 KB	Output is correct
25	Correct	1 ms	596 KB	Output is correct
26	Correct	1 ms	596 KB	Output is correct
27	Correct	1 ms	596 KB	Output is correct
28	Correct	1 ms	668 KB	Output is correct
29	Correct	1 ms	596 KB	Output is correct
30	Correct	1 ms	724 KB	Output is correct
31	Correct	1 ms	596 KB	Output is correct
32	Correct	1 ms	724 KB	Output is correct
33	Correct	5 ms	2132 KB	Output is correct
34	Correct	5 ms	2388 KB	Output is correct
35	Correct	19 ms	2896 KB	Output is correct
36	Correct	6 ms	2388 KB	Output is correct
37	Correct	6 ms	2644 KB	Output is correct
38	Correct	24 ms	3284 KB	Output is correct
39	Correct	7 ms	2576 KB	Output is correct
40	Correct	8 ms	2900 KB	Output is correct
41	Correct	33 ms	3876 KB	Output is correct
42	Correct	8 ms	2880 KB	Output is correct
43	Correct	9 ms	3276 KB	Output is correct
44	Correct	41 ms	4052 KB	Output is correct
45	Correct	10 ms	3028 KB	Output is correct
46	Correct	10 ms	3540 KB	Output is correct
47	Correct	45 ms	4312 KB	Output is correct
48	Correct	11 ms	3284 KB	Output is correct
49	Correct	12 ms	3744 KB	Output is correct
50	Correct	59 ms	4716 KB	Output is correct
51	Correct	13 ms	3540 KB	Output is correct
52	Correct	14 ms	4084 KB	Output is correct
53	Correct	74 ms	5196 KB	Output is correct
54	Correct	15 ms	3792 KB	Output is correct
55	Correct	16 ms	4300 KB	Output is correct
56	Correct	78 ms	5384 KB	Output is correct
57	Correct	17 ms	4052 KB	Output is correct
58	Correct	19 ms	4684 KB	Output is correct
59	Correct	93 ms	5852 KB	Output is correct
60	Correct	19 ms	4340 KB	Output is correct
61	Correct	20 ms	4912 KB	Output is correct
62	Correct	108 ms	6336 KB	Output is correct
63	Correct	87 ms	6092 KB	Output is correct
64	Correct	157 ms	6140 KB	Output is correct
65	Correct	121 ms	6188 KB	Output is correct
66	Correct	115 ms	6212 KB	Output is correct
67	Correct	97 ms	6196 KB	Output is correct
68	Correct	41 ms	6180 KB	Output is correct
69	Correct	37 ms	6256 KB	Output is correct
70	Correct	36 ms	6152 KB	Output is correct
71	Correct	33 ms	6028 KB	Output is correct
72	Incorrect	25 ms	4160 KB	Output isn't correct
73	Incorrect	32 ms	6456 KB	Output isn't correct
74	Correct	46 ms	6528 KB	Output is correct
75	Correct	59 ms	6460 KB	Output is correct
76	Correct	54 ms	6528 KB	Output is correct
77	Correct	56 ms	6544 KB	Output is correct
78	Correct	62 ms	5136 KB	Output is correct
79	Correct	40 ms	4740 KB	Output is correct
80	Correct	48 ms	4912 KB	Output is correct
81	Correct	58 ms	4976 KB	Output is correct
82	Correct	56 ms	5068 KB	Output is correct
83	Correct	63 ms	5068 KB	Output is correct
84	Correct	60 ms	4980 KB	Output is correct
85	Correct	63 ms	5020 KB	Output is correct
86	Correct	69 ms	5084 KB	Output is correct
87	Correct	60 ms	5052 KB	Output is correct
88	Correct	96 ms	5216 KB	Output is correct
89	Correct	111 ms	4964 KB	Output is correct
90	Correct	92 ms	5052 KB	Output is correct
91	Correct	70 ms	5176 KB	Output is correct
92	Correct	88 ms	5072 KB	Output is correct