oj.uz

Submission #747791

# Submission time Handle Problem Language Result Execution time Memory
747791 2023-05-24T17:29:41 Z AverageAmogusEnjoyer Mecho (IOI09_mecho) C++17
29 / 100
 717 ms 6656 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(x) x.begin(), x.end() 
#define sz(x) (int) x.size()
#define pb push_back
#define ll long long
#define nl '\n'

/*

Mecho can only walk on grass and cannot go through trees or hives, and he can make at most S steps per minute.
every minute
he eats or 
he leaves immediately and takes up to S steps through the forest as described above

bees spread to grassy cells

trees = no one can go there

m = mecho, grassy cells => i will replace with g

g = grassy

d = mecho home; bees cannot go / pass here

h = hive

*/

const int N = 810;

char grid[N][N];
int stepsMecho[N][N], stepsBee[N][N];
int n, s;
array<int, 2> Mecho, MechoHouse;
vector<array<int, 2>> Bee;
vector<array<int,2>> moves = {{-1,0},{1,0},{0,-1},{0,1}};

struct m{
	bool isMecho;
	int x,y;
};

bool good(int x, int y) {
	return 0 <= x && x < n && 0 <= y && y < n && grid[x][y] != 'T';
}

bool isHome(int x, int y) {
	return x == MechoHouse[0] && y == MechoHouse[1];
}

void debug() {
	cout << "Mecho: " << nl;
	for (int i=0;i<n;i++) {
		for (int j=0;j<n;j++) {
			cout << stepsMecho[i][j] << " ";
		}
		cout << nl;
	}
	cout << "Bees: " << nl;
	for (int i=0;i<n;i++) {
		for (int j=0;j<n;j++) {
			cout << stepsBee[i][j] << " ";
		}
		cout << nl;
	}
}

bool bs(int steps) {
	memset(stepsMecho,-1,sizeof(stepsMecho));
	memset(stepsBee,-1,sizeof(stepsBee));
	queue<m> q, q2;
	q2.push(m{true,Mecho[0],Mecho[1]});
	stepsMecho[Mecho[0]][Mecho[1]] = 0;
	for (auto [x,y]:Bee) {
		q.push(m{false,x,y});
		stepsBee[x][y]=0;
	}
	while(!q.empty()) {
		m v = q.front(); q.pop();
		if (stepsBee[v.x][v.y] == steps) { q2.push(v); continue; }
 		for (auto [addx,addy]: moves) {
			int nx = v.x + addx, ny = v.y + addy;
			if (good(nx,ny) && !isHome(nx,ny) && stepsBee[nx][ny] == -1) {
				q.push(m{false,nx,ny});
				stepsBee[nx][ny] = stepsBee[v.x][v.y]+1;
			}
		}
	}
	for (int i=0;i<n;i++)
		for (int j=0;j<n;j++)
			if (stepsBee[i][j] != -1)
				stepsBee[i][j] = 0;
	while(!q2.empty()) {
		m v = q2.front(); q2.pop();
		if (v.isMecho) {
			if (stepsBee[v.x][v.y] != -1 && stepsBee[v.x][v.y] <= (stepsMecho[v.x][v.y]+s-1)/s) { continue; }
			for (auto [addx,addy]: moves) {
				int nx = v.x + addx, ny = v.y + addy;
				if (good(nx,ny) && stepsMecho[nx][ny] == -1 && (stepsBee[nx][ny] == -1 || stepsBee[nx][ny] > (stepsMecho[v.x][v.y]+s)/s)) {
					if (isHome(nx,ny)) { return 1; }
					stepsMecho[nx][ny] = stepsMecho[v.x][v.y]+1;
					q2.push(m{true,nx,ny});
				}
			}
		} else {
			for (auto [addx,addy]: moves) {
				int nx = v.x + addx, ny = v.y + addy;
				if (good(nx,ny) && !isHome(nx,ny) && stepsBee[nx][ny] == -1) {
					q2.push(m{false,nx,ny});
					stepsBee[nx][ny] = stepsBee[v.x][v.y]+1;
				}
			}
		}
	}
	return 0;
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	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];
			if (grid[i][j]=='M') {
				grid[i][j] = 'G';
				Mecho = {i,j};
			}
			if (grid[i][j]=='H') {
				Bee.pb({i,j});
			}
			if (grid[i][j]=='D') {
				MechoHouse = {i,j};
			}
		}
	int lo = 0, hi = 1e9;
	while(lo<=hi) {
		int mid = (lo+hi)/2;
		if (bs(mid)) {
			lo = mid + 1;
		} else {
			hi = mid - 1;
		}
	}
	cout << (lo >= 1e9 ? -1 : lo);
}

Subtask #1
29.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 5460 KB Output isn't correct
2 Incorrect 7 ms 5460 KB Output isn't correct
3 Incorrect 8 ms 5460 KB Output isn't correct
4 Incorrect 7 ms 5460 KB Output isn't correct
5 Correct 7 ms 5464 KB Output is correct
6 Correct 7 ms 5460 KB Output is correct
7 Correct 572 ms 6376 KB Output is correct
8 Incorrect 8 ms 5460 KB Output isn't correct
9 Correct 7 ms 5460 KB Output is correct
10 Correct 7 ms 5460 KB Output is correct
11 Correct 8 ms 5460 KB Output is correct
12 Incorrect 9 ms 5512 KB Output isn't correct
13 Incorrect 10 ms 5460 KB Output isn't correct
14 Incorrect 10 ms 5460 KB Output isn't correct
15 Incorrect 8 ms 5460 KB Output isn't correct
16 Correct 7 ms 5460 KB Output is correct
17 Incorrect 7 ms 5460 KB Output isn't correct
18 Correct 7 ms 5472 KB Output is correct
19 Incorrect 8 ms 5460 KB Output isn't correct
20 Correct 8 ms 5460 KB Output is correct
21 Incorrect 8 ms 5460 KB Output isn't correct
22 Correct 7 ms 5460 KB Output is correct
23 Incorrect 9 ms 5460 KB Output isn't correct
24 Correct 8 ms 5500 KB Output is correct
25 Incorrect 9 ms 5508 KB Output isn't correct
26 Correct 9 ms 5460 KB Output is correct
27 Incorrect 8 ms 5460 KB Output isn't correct
28 Correct 9 ms 5408 KB Output is correct
29 Incorrect 8 ms 5460 KB Output isn't correct
30 Correct 9 ms 5460 KB Output is correct
31 Incorrect 9 ms 5528 KB Output isn't correct
32 Correct 9 ms 5516 KB Output is correct
33 Incorrect 49 ms 5716 KB Output isn't correct
34 Correct 50 ms 5716 KB Output is correct
35 Correct 99 ms 5716 KB Output is correct
36 Incorrect 65 ms 5768 KB Output isn't correct
37 Correct 62 ms 5676 KB Output is correct
38 Correct 110 ms 5764 KB Output is correct
39 Incorrect 77 ms 5796 KB Output isn't correct
40 Correct 73 ms 5800 KB Output is correct
41 Correct 133 ms 5872 KB Output is correct
42 Incorrect 99 ms 5844 KB Output isn't correct
43 Correct 87 ms 5844 KB Output is correct
44 Correct 162 ms 5844 KB Output is correct
45 Incorrect 122 ms 5872 KB Output isn't correct
46 Correct 101 ms 5872 KB Output is correct
47 Correct 203 ms 5896 KB Output is correct
48 Incorrect 132 ms 5912 KB Output isn't correct
49 Correct 121 ms 5916 KB Output is correct
50 Correct 241 ms 5936 KB Output is correct
51 Incorrect 157 ms 5944 KB Output isn't correct
52 Correct 137 ms 5972 KB Output is correct
53 Correct 285 ms 5980 KB Output is correct
54 Incorrect 180 ms 6000 KB Output isn't correct
55 Correct 153 ms 5992 KB Output is correct
56 Correct 322 ms 5972 KB Output is correct
57 Incorrect 216 ms 6036 KB Output isn't correct
58 Correct 179 ms 6032 KB Output is correct
59 Correct 380 ms 6064 KB Output is correct
60 Incorrect 228 ms 6080 KB Output isn't correct
61 Correct 204 ms 6072 KB Output is correct
62 Correct 425 ms 6100 KB Output is correct
63 Correct 671 ms 6084 KB Output is correct
64 Correct 717 ms 6100 KB Output is correct
65 Correct 712 ms 6100 KB Output is correct
66 Incorrect 693 ms 6100 KB Output isn't correct
67 Incorrect 648 ms 6088 KB Output isn't correct
68 Correct 646 ms 6156 KB Output is correct
69 Correct 666 ms 6220 KB Output is correct
70 Correct 666 ms 6136 KB Output is correct
71 Correct 655 ms 6100 KB Output is correct
72 Incorrect 683 ms 6132 KB Output isn't correct
73 Incorrect 529 ms 6656 KB Output isn't correct
74 Correct 547 ms 6608 KB Output is correct
75 Correct 572 ms 6640 KB Output is correct
76 Correct 559 ms 6524 KB Output is correct
77 Correct 551 ms 6520 KB Output is correct
78 Incorrect 548 ms 6484 KB Output isn't correct
79 Correct 570 ms 6484 KB Output is correct
80 Correct 574 ms 6600 KB Output is correct
81 Correct 551 ms 6484 KB Output is correct
82 Correct 574 ms 6572 KB Output is correct
83 Correct 559 ms 6404 KB Output is correct
84 Correct 589 ms 6412 KB Output is correct
85 Correct 609 ms 6356 KB Output is correct
86 Correct 616 ms 6452 KB Output is correct
87 Correct 606 ms 6408 KB Output is correct
88 Correct 556 ms 6332 KB Output is correct
89 Correct 601 ms 6356 KB Output is correct
90 Correct 609 ms 6336 KB Output is correct
91 Correct 593 ms 6344 KB Output is correct
92 Correct 589 ms 6472 KB Output is correct