oj.uz

Submission #516277

# Submission time Handle Problem Language Result Execution time Memory
516277 2022-01-21T02:17:09 Z Tizariox Mecho (IOI09_mecho) C++14
84 / 100
 495 ms 53616 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) {
			vis[i][j] = false;
		}
	}
	queue<pii> bfsQueue;
	vis[rootX][rootY] = true;
	bfsQueue.push(pii(rootX, rootY));
	dist[rootX][rootY] = 0;
	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] && ((double)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;
			}
		}
	}
	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
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15308 KB Output is correct
2 Correct 8 ms 15352 KB Output is correct
3 Correct 9 ms 15348 KB Output is correct
4 Correct 7 ms 15308 KB Output is correct
5 Correct 8 ms 15376 KB Output is correct
6 Correct 8 ms 15436 KB Output is correct
7 Correct 445 ms 53616 KB Output is correct
8 Correct 8 ms 15436 KB Output is correct
9 Correct 9 ms 15480 KB Output is correct
10 Correct 8 ms 15420 KB Output is correct
11 Correct 7 ms 15476 KB Output is correct
12 Incorrect 8 ms 15876 KB Output isn't correct
13 Incorrect 8 ms 15860 KB Output isn't correct
14 Correct 8 ms 16076 KB Output is correct
15 Correct 8 ms 15476 KB Output is correct
16 Correct 7 ms 15476 KB Output is correct
17 Correct 8 ms 15564 KB Output is correct
18 Correct 8 ms 15600 KB Output is correct
19 Correct 10 ms 15564 KB Output is correct
20 Correct 7 ms 15564 KB Output is correct
21 Correct 10 ms 15728 KB Output is correct
22 Correct 8 ms 15692 KB Output is correct
23 Correct 8 ms 15860 KB Output is correct
24 Correct 8 ms 15820 KB Output is correct
25 Correct 8 ms 15940 KB Output is correct
26 Correct 8 ms 15920 KB Output is correct
27 Correct 8 ms 15988 KB Output is correct
28 Correct 8 ms 15948 KB Output is correct
29 Correct 10 ms 16076 KB Output is correct
30 Correct 8 ms 16016 KB Output is correct
31 Correct 8 ms 16120 KB Output is correct
32 Correct 9 ms 16076 KB Output is correct
33 Correct 16 ms 20600 KB Output is correct
34 Correct 17 ms 20584 KB Output is correct
35 Correct 79 ms 22476 KB Output is correct
36 Correct 19 ms 21680 KB Output is correct
37 Correct 18 ms 21752 KB Output is correct
38 Correct 90 ms 24248 KB Output is correct
39 Correct 21 ms 22908 KB Output is correct
40 Correct 21 ms 22956 KB Output is correct
41 Correct 132 ms 26088 KB Output is correct
42 Correct 33 ms 24260 KB Output is correct
43 Correct 32 ms 24192 KB Output is correct
44 Correct 183 ms 28036 KB Output is correct
45 Correct 25 ms 25548 KB Output is correct
46 Correct 27 ms 25508 KB Output is correct
47 Correct 221 ms 30276 KB Output is correct
48 Correct 29 ms 26976 KB Output is correct
49 Correct 29 ms 26956 KB Output is correct
50 Correct 255 ms 32704 KB Output is correct
51 Correct 34 ms 28484 KB Output is correct
52 Correct 34 ms 28416 KB Output is correct
53 Correct 300 ms 35108 KB Output is correct
54 Correct 38 ms 30104 KB Output is correct
55 Correct 38 ms 30020 KB Output is correct
56 Correct 337 ms 37700 KB Output is correct
57 Correct 40 ms 31760 KB Output is correct
58 Correct 46 ms 31776 KB Output is correct
59 Correct 396 ms 40508 KB Output is correct
60 Correct 46 ms 33448 KB Output is correct
61 Correct 50 ms 33604 KB Output is correct
62 Correct 495 ms 43460 KB Output is correct
63 Correct 212 ms 36928 KB Output is correct
64 Correct 315 ms 37020 KB Output is correct
65 Correct 298 ms 37024 KB Output is correct
66 Correct 266 ms 37128 KB Output is correct
67 Correct 213 ms 36984 KB Output is correct
68 Correct 139 ms 36928 KB Output is correct
69 Correct 121 ms 36972 KB Output is correct
70 Correct 120 ms 37116 KB Output is correct
71 Correct 104 ms 36972 KB Output is correct
72 Incorrect 96 ms 36980 KB Output isn't correct
73 Incorrect 201 ms 53500 KB Output isn't correct
74 Correct 264 ms 53496 KB Output is correct
75 Correct 286 ms 53476 KB Output is correct
76 Correct 277 ms 53516 KB Output is correct
77 Correct 276 ms 53444 KB Output is correct
78 Correct 295 ms 53520 KB Output is correct
79 Correct 229 ms 53532 KB Output is correct
80 Correct 253 ms 53528 KB Output is correct
81 Correct 296 ms 53608 KB Output is correct
82 Correct 221 ms 53460 KB Output is correct
83 Correct 391 ms 53452 KB Output is correct
84 Correct 340 ms 53412 KB Output is correct
85 Correct 357 ms 53408 KB Output is correct
86 Correct 374 ms 53540 KB Output is correct
87 Correct 376 ms 53316 KB Output is correct
88 Correct 393 ms 53520 KB Output is correct
89 Correct 401 ms 53364 KB Output is correct
90 Correct 420 ms 53364 KB Output is correct
91 Correct 394 ms 53440 KB Output is correct
92 Correct 415 ms 53432 KB Output is correct