oj.uz

답안 #516242

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516242 2022-01-20T19:00:23 Z Tizariox Mecho (IOI09_mecho) C++14
76 / 100
 546 ms 53132 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;
			}
		}
	}
}

void bfsBear() {
	queue<pii> bfsQueue;
	vis[rootX][rootY] = true;
	dist[rootX][rootY] = 0;
	bfsQueue.push(pii(rootX, rootY));
	while (!bfsQueue.empty()) {
		pii node = bfsQueue.front();
		bfsQueue.pop();
		for (pii neighbor : adj[node.pA][node.pB]) {
			if (!vis[neighbor.pA][neighbor.pB]) {
				vis[neighbor.pA][neighbor.pB] = true;
				bfsQueue.push(neighbor);
				dist[neighbor.pA][neighbor.pB] = dist[node.pA][node.pB] + 1;
			}
		}
	}
}

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

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();
	bfsBear();
	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
76.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15352 KB Output is correct
2 Correct 8 ms 15308 KB Output is correct
3 Correct 8 ms 15308 KB Output is correct
4 Correct 8 ms 15396 KB Output is correct
5 Correct 9 ms 15384 KB Output is correct
6 Correct 9 ms 15436 KB Output is correct
7 Correct 495 ms 53108 KB Output is correct
8 Correct 7 ms 15436 KB Output is correct
9 Correct 8 ms 15476 KB Output is correct
10 Correct 8 ms 15436 KB Output is correct
11 Correct 8 ms 15452 KB Output is correct
12 Correct 8 ms 15948 KB Output is correct
13 Correct 8 ms 15948 KB Output is correct
14 Correct 9 ms 16032 KB Output is correct
15 Correct 7 ms 15480 KB Output is correct
16 Correct 7 ms 15564 KB Output is correct
17 Correct 8 ms 15608 KB Output is correct
18 Correct 10 ms 15584 KB Output is correct
19 Correct 8 ms 15564 KB Output is correct
20 Correct 8 ms 15564 KB Output is correct
21 Correct 8 ms 15820 KB Output is correct
22 Correct 9 ms 15692 KB Output is correct
23 Correct 8 ms 15860 KB Output is correct
24 Correct 8 ms 15856 KB Output is correct
25 Correct 9 ms 15924 KB Output is correct
26 Correct 8 ms 15932 KB Output is correct
27 Correct 8 ms 15976 KB Output is correct
28 Correct 8 ms 15948 KB Output is correct
29 Correct 9 ms 16044 KB Output is correct
30 Correct 8 ms 16076 KB Output is correct
31 Correct 9 ms 16112 KB Output is correct
32 Correct 9 ms 16116 KB Output is correct
33 Correct 25 ms 20608 KB Output is correct
34 Correct 23 ms 20584 KB Output is correct
35 Incorrect 77 ms 22564 KB Output isn't correct
36 Correct 23 ms 21688 KB Output is correct
37 Correct 27 ms 21828 KB Output is correct
38 Incorrect 110 ms 24212 KB Output isn't correct
39 Correct 28 ms 22788 KB Output is correct
40 Correct 31 ms 22812 KB Output is correct
41 Incorrect 165 ms 26012 KB Output isn't correct
42 Correct 34 ms 24124 KB Output is correct
43 Correct 35 ms 24104 KB Output is correct
44 Incorrect 207 ms 27964 KB Output isn't correct
45 Correct 37 ms 25420 KB Output is correct
46 Correct 38 ms 25328 KB Output is correct
47 Incorrect 234 ms 29980 KB Output isn't correct
48 Correct 44 ms 26700 KB Output is correct
49 Correct 45 ms 26772 KB Output is correct
50 Incorrect 305 ms 32348 KB Output isn't correct
51 Correct 49 ms 28128 KB Output is correct
52 Correct 50 ms 28208 KB Output is correct
53 Incorrect 352 ms 34780 KB Output isn't correct
54 Correct 55 ms 29756 KB Output is correct
55 Correct 57 ms 29744 KB Output is correct
56 Incorrect 416 ms 37348 KB Output isn't correct
57 Correct 62 ms 31344 KB Output is correct
58 Correct 74 ms 31344 KB Output is correct
59 Incorrect 463 ms 40088 KB Output isn't correct
60 Correct 66 ms 33064 KB Output is correct
61 Correct 72 ms 32956 KB Output is correct
62 Incorrect 546 ms 42956 KB Output isn't correct
63 Correct 245 ms 36476 KB Output is correct
64 Correct 336 ms 36508 KB Output is correct
65 Correct 323 ms 36644 KB Output is correct
66 Correct 292 ms 36520 KB Output is correct
67 Correct 249 ms 36492 KB Output is correct
68 Correct 169 ms 36488 KB Output is correct
69 Correct 166 ms 36556 KB Output is correct
70 Correct 160 ms 36440 KB Output is correct
71 Correct 150 ms 36676 KB Output is correct
72 Correct 140 ms 36564 KB Output is correct
73 Correct 275 ms 53040 KB Output is correct
74 Correct 343 ms 53120 KB Output is correct
75 Correct 359 ms 52936 KB Output is correct
76 Correct 339 ms 53132 KB Output is correct
77 Correct 363 ms 53040 KB Output is correct
78 Correct 360 ms 53024 KB Output is correct
79 Correct 288 ms 53012 KB Output is correct
80 Correct 324 ms 53028 KB Output is correct
81 Correct 328 ms 53016 KB Output is correct
82 Correct 292 ms 53024 KB Output is correct
83 Correct 444 ms 52896 KB Output is correct
84 Correct 431 ms 52940 KB Output is correct
85 Correct 409 ms 52804 KB Output is correct
86 Correct 467 ms 52932 KB Output is correct
87 Correct 439 ms 52908 KB Output is correct
88 Correct 460 ms 52864 KB Output is correct
89 Correct 485 ms 52940 KB Output is correct
90 Correct 466 ms 52936 KB Output is correct
91 Correct 472 ms 53020 KB Output is correct
92 Correct 488 ms 52900 KB Output is correct