oj.uz

답안 #516280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516280 2022-01-21T02:22:40 Z Tizariox Mecho (IOI09_mecho) C++14
95 / 100
 495 ms 52948 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define F0R1(i, a) for (int i = 1; i <= (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define F0Rd1(i, a) for (int i = a; i > 0; i--)
#define SORT(vec) sort(vec.begin(), vec.end())
#define S0RT(arr, n) sort(arr, arr + n)

#define pA first
#define pB second
#define MOD 1000000007
#define nl "\n"
#define pb push_back

int n, steps, rootX, rootY, homeX, homeY;

vector<pii> adj[800][800];
bool vis[800][800];
int dist[800][800];
bool visBee[800][800];
int distBee[800][800];
bool blocked[800][800];
bool blocked1[800][800];
vector<pii> hives;

void bfsBees() {
	queue<pii> bfsQueue;
	for (pii root : hives) {
		visBee[root.pA][root.pB] = true;
		bfsQueue.push(root);
		distBee[root.pA][root.pB] = 0;
	}
	while (!bfsQueue.empty()) {
		pii node = bfsQueue.front();
		bfsQueue.pop();
		for (pii neighbor : adj[node.pA][node.pB]) {
			if (!visBee[neighbor.pA][neighbor.pB] && !(neighbor.pA == homeX && neighbor.pB == homeY)) {
				visBee[neighbor.pA][neighbor.pB] = true;
				bfsQueue.push(neighbor);
				distBee[neighbor.pA][neighbor.pB] = distBee[node.pA][node.pB] + 1;
			}
		}
	}
}

bool bfs(int eatHoney) {
	FOR(i, 0, n) {
		FOR(j, 0, n) {
			vis[i][j] = false;
		}
	}
	queue<pii> bfsQueue;
	vis[rootX][rootY] = true;
	bfsQueue.push(pii(rootX, rootY));
	dist[rootX][rootY] = 0;
	if (distBee[rootX][rootY] <= eatHoney) {
		bfsQueue.pop();
	}
	while (!bfsQueue.empty()) {
		pii node = bfsQueue.front();
		bfsQueue.pop();
		for (pii neighbor : adj[node.pA][node.pB]) {
			int dist1 = dist[node.pA][node.pB] + 1;
			if (!vis[neighbor.pA][neighbor.pB] && dist1/steps < distBee[neighbor.pA][neighbor.pB] - eatHoney) {
				vis[neighbor.pA][neighbor.pB] = true;
				if (neighbor.pA == homeX && neighbor.pB == homeY) {
					return true;
				}
				bfsQueue.push(neighbor);
				dist[neighbor.pA][neighbor.pB] = dist1;
			}
		}
	}
	for (pii i : adj[homeX][homeY]) {
		if (vis[i.pA][i.pB]) {
			return true;
		}
	}
	return false;
}

void gridAdj() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (!blocked[i][j]) {
				if (i > 0 && !blocked[i - 1][j]) {
					adj[i][j].pb(pii(i - 1, j));
				}
				if (i < n - 1 && !blocked[i + 1][j]) {
					adj[i][j].pb(pii(i + 1, j));
				}
				if (j > 0 && !blocked[i][j - 1]) {
					adj[i][j].pb(pii(i, j - 1));
				}
				if (j < n - 1 && !blocked[i][j + 1]) {
					adj[i][j].pb(pii(i, j + 1));
				}
			}
		}
	}
}

int main() {
	// freopen("!.in", "r", stdin);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> steps;
	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;
		FOR(j, 0, n) {
			if (s[j] == 'T') {
				blocked[i][j] = true;
			} else if (s[j] == 'M') {
				rootX = i;
				rootY = j;
			} else if (s[j] == 'D') {
				homeX = i;
				homeY = j;
			} else if (s[j] == 'H') {
				hives.pb(pii(i, j));
			}
		}
	}
	FOR(i, 0, n) {
		FOR(j, 0, n) {
			vis[i][j] = false;
			visBee[i][j] = false;
			dist[i][j] = 1e9;
			distBee[i][j] = 1e9;
			blocked1[i][j] = false;
		}
	}
	gridAdj();
	bfsBees();
	int l = 0;
	int r = 1e6;
	int ans = l - 1;
	while (l <= r) {
		ll mid = (r + l) / 2;
		if (bfs(mid)) {
			ans = mid;
			l = mid + 1;
		} else {
			r = mid - 1;
		}
	}
	cout << ans << nl;
}

Subtask #1
95.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15328 KB Output is correct
2 Correct 7 ms 15276 KB Output is correct
3 Correct 7 ms 15308 KB Output is correct
4 Correct 8 ms 15356 KB Output is correct
5 Correct 8 ms 15436 KB Output is correct
6 Correct 10 ms 15436 KB Output is correct
7 Correct 409 ms 52864 KB Output is correct
8 Correct 10 ms 15436 KB Output is correct
9 Correct 7 ms 15436 KB Output is correct
10 Correct 8 ms 15520 KB Output is correct
11 Correct 10 ms 15424 KB Output is correct
12 Incorrect 8 ms 15948 KB Output isn't correct
13 Correct 8 ms 15940 KB Output is correct
14 Correct 10 ms 15972 KB Output is correct
15 Correct 8 ms 15436 KB Output is correct
16 Correct 11 ms 15436 KB Output is correct
17 Correct 8 ms 15564 KB Output is correct
18 Correct 8 ms 15528 KB Output is correct
19 Correct 7 ms 15564 KB Output is correct
20 Correct 8 ms 15664 KB Output is correct
21 Correct 8 ms 15692 KB Output is correct
22 Correct 8 ms 15692 KB Output is correct
23 Correct 11 ms 15760 KB Output is correct
24 Correct 9 ms 15880 KB Output is correct
25 Correct 9 ms 15976 KB Output is correct
26 Correct 9 ms 15948 KB Output is correct
27 Correct 8 ms 16036 KB Output is correct
28 Correct 9 ms 15948 KB Output is correct
29 Correct 10 ms 16076 KB Output is correct
30 Correct 8 ms 16076 KB Output is correct
31 Correct 8 ms 16076 KB Output is correct
32 Correct 8 ms 16076 KB Output is correct
33 Correct 15 ms 20484 KB Output is correct
34 Correct 15 ms 20496 KB Output is correct
35 Correct 58 ms 22448 KB Output is correct
36 Correct 18 ms 21600 KB Output is correct
37 Correct 19 ms 21512 KB Output is correct
38 Correct 93 ms 24100 KB Output is correct
39 Correct 28 ms 22692 KB Output is correct
40 Correct 22 ms 22904 KB Output is correct
41 Correct 124 ms 25832 KB Output is correct
42 Correct 23 ms 23884 KB Output is correct
43 Correct 25 ms 23996 KB Output is correct
44 Correct 172 ms 27844 KB Output is correct
45 Correct 25 ms 25172 KB Output is correct
46 Correct 27 ms 25264 KB Output is correct
47 Correct 217 ms 29948 KB Output is correct
48 Correct 31 ms 26620 KB Output is correct
49 Correct 31 ms 26640 KB Output is correct
50 Correct 254 ms 32220 KB Output is correct
51 Correct 32 ms 28012 KB Output is correct
52 Correct 42 ms 28088 KB Output is correct
53 Correct 305 ms 34520 KB Output is correct
54 Correct 37 ms 29516 KB Output is correct
55 Correct 37 ms 29552 KB Output is correct
56 Correct 364 ms 37220 KB Output is correct
57 Correct 42 ms 31152 KB Output is correct
58 Correct 42 ms 31220 KB Output is correct
59 Correct 427 ms 39860 KB Output is correct
60 Correct 48 ms 32896 KB Output is correct
61 Correct 46 ms 32868 KB Output is correct
62 Correct 495 ms 42816 KB Output is correct
63 Correct 224 ms 36396 KB Output is correct
64 Correct 324 ms 36416 KB Output is correct
65 Correct 306 ms 36324 KB Output is correct
66 Correct 268 ms 36356 KB Output is correct
67 Correct 218 ms 36396 KB Output is correct
68 Correct 121 ms 36348 KB Output is correct
69 Correct 117 ms 36356 KB Output is correct
70 Correct 111 ms 36424 KB Output is correct
71 Correct 97 ms 36348 KB Output is correct
72 Correct 91 ms 36432 KB Output is correct
73 Correct 229 ms 52924 KB Output is correct
74 Correct 274 ms 52948 KB Output is correct
75 Correct 295 ms 52924 KB Output is correct
76 Correct 284 ms 52916 KB Output is correct
77 Correct 309 ms 52920 KB Output is correct
78 Correct 291 ms 52840 KB Output is correct
79 Correct 235 ms 52796 KB Output is correct
80 Correct 272 ms 52812 KB Output is correct
81 Correct 279 ms 52872 KB Output is correct
82 Correct 225 ms 52896 KB Output is correct
83 Correct 403 ms 52892 KB Output is correct
84 Correct 341 ms 52780 KB Output is correct
85 Correct 354 ms 52840 KB Output is correct
86 Correct 383 ms 52768 KB Output is correct
87 Correct 359 ms 52800 KB Output is correct
88 Correct 381 ms 52736 KB Output is correct
89 Correct 405 ms 52880 KB Output is correct
90 Correct 405 ms 52804 KB Output is correct
91 Correct 384 ms 52848 KB Output is correct
92 Correct 394 ms 52804 KB Output is correct