oj.uz

Submission #153025

# Submission time Handle Problem Language Result Execution time Memory
153025 2019-09-11T13:51:12 Z tselmegkh Mecho (IOI09_mecho) C++14
26 / 100
 1000 ms 7040 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 805, inf = 1e9;
string a[N];
int d[N][N], dis[N][N], n, s;
bool vis[N][N];
pair<int, int> st, en;
int mx = 0;
int movex[] = {1, 0, -1, 0};
int movey[] = {0, 1, 0, -1};

void fill(){
	for(int i = 0; i < 801; i++){
		for(int j = 0; j < 801; j++){
			d[i][j] = inf;
		}
	}
}

bool check(int i, int j, bool which){
	if(which == 1)
		{
		if(i >= 0 && i < n && j >= 0 && j < n && (a[i][j] == 'G' || a[i][j] == 'D') && !vis[i][j]){
			return 1;
		}
		return 0;
	}
	else{
		if(i >= 0 && i < n && j >= 0 && j < n && a[i][j] == 'G' && !vis[i][j]){
			return 1;
		}
		return 0;
	}
}

void bfs(int i, int j){
	memset(vis, 0, sizeof vis);
	memset(dis, 0, sizeof dis);
	queue<pair<int, int>> q;
	dis[i][j] = 0;
	vis[i][j] = 1;
	q.push({i, j});

	while(!q.empty()){
		pair<int, int> u = q.front(); q.pop();

		for(int i1 = 0; i1 < 4; i1++){
			int x = movex[i1], y = movey[i1];
			if(check(u.first + x, u.second + y, 0)){
				vis[u.first + x][u.second + y] = 1;
				dis[u.first + x][u.second + y] = dis[u.first][u.second] + 1;
				d[u.first + x][u.second + y] = min(d[u.first + x][u.second + y], dis[u.first + x][u.second + y]);
				q.push({u.first + x, u.second + y});
				mx = max(mx, d[u.first + x][u.second + y]);
			}
		}
	}
}

bool possible(int x){
	int cur = x + 1;
	memset(vis, 0, sizeof vis);
	queue<pair<pair<int, int>, pair<int,int>>> q;

	q.push({{st.first, st.second}, {cur, s}});
	vis[st.first][st.second] = 1;

	while(!q.empty()){
		auto k = q.front(); q.pop();
		int u = k.first.first, v = k.first.second, chargesleft = k.second.second;
		int now = k.second.first;

		for(int i = 0; i < 4; i++){
			if(check(u + movex[i], v + movey[i], 1)){
				if(d[u + movex[i]][v + movey[i]] >= now){
					if(chargesleft > 1){
						q.push({{u + movex[i], v + movey[i]}, {now, chargesleft - 1}});
					}else{
						q.push({{u + movex[i], v + movey[i]}, {now + 1, s}});
					}
					vis[u + movex[i]][v + movey[i]] = 1;
				}
			}
		}
	}
	/*cout << "x : " << x << '\n';
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			cout << vis[i][j];
		}
		cout << '\n';
	}*/
	if(vis[en.first][en.second])return 1;
	return 0;
}
int main(){
	cin >> n >> s;
	fill();

	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(a[i][j] == 'H'){
				bfs(i, j);
			}
			if(a[i][j] == 'M'){
				st.first = i;
				st.second = j;
			}
			if(a[i][j] == 'D'){
				en.first = i;
				en.second = j;
			}
		}
	}
	/*for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(d[i][j] != inf)cout << d[i][j];
			else cout << 0;
		}
		cout << '\n';
	}*/

	int l = 0, r = mx;
	int ans = -1;
	while(l != r){
		int mid = l + (r - l + 1) / 2;
		if(possible(mid)){
			l = mid;
			ans = mid;
		}else{
			r = mid - 1;
		}
	}
	cout << ans << '\n';
}

Subtask #1
26.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 6008 KB Output isn't correct
2 Incorrect 7 ms 6008 KB Output isn't correct
3 Incorrect 9 ms 6008 KB Output isn't correct
4 Incorrect 7 ms 6008 KB Output isn't correct
5 Incorrect 8 ms 6008 KB Output isn't correct
6 Correct 9 ms 6008 KB Output is correct
7 Execution timed out 1075 ms 6776 KB Time limit exceeded
8 Correct 9 ms 6008 KB Output is correct
9 Correct 8 ms 6136 KB Output is correct
10 Correct 8 ms 6008 KB Output is correct
11 Correct 8 ms 6008 KB Output is correct
12 Correct 9 ms 6008 KB Output is correct
13 Incorrect 41 ms 6008 KB Output isn't correct
14 Correct 40 ms 6008 KB Output is correct
15 Incorrect 7 ms 6008 KB Output isn't correct
16 Correct 7 ms 6008 KB Output is correct
17 Incorrect 9 ms 6008 KB Output isn't correct
18 Correct 9 ms 6008 KB Output is correct
19 Incorrect 8 ms 6008 KB Output isn't correct
20 Correct 9 ms 6008 KB Output is correct
21 Incorrect 8 ms 6008 KB Output isn't correct
22 Correct 10 ms 6008 KB Output is correct
23 Incorrect 8 ms 6008 KB Output isn't correct
24 Correct 10 ms 6108 KB Output is correct
25 Incorrect 9 ms 6012 KB Output isn't correct
26 Correct 9 ms 6012 KB Output is correct
27 Incorrect 9 ms 6008 KB Output isn't correct
28 Correct 10 ms 6012 KB Output is correct
29 Incorrect 9 ms 6008 KB Output isn't correct
30 Correct 9 ms 6008 KB Output is correct
31 Incorrect 8 ms 6008 KB Output isn't correct
32 Correct 10 ms 6008 KB Output is correct
33 Incorrect 18 ms 6236 KB Output isn't correct
34 Correct 23 ms 6136 KB Output is correct
35 Correct 47 ms 6392 KB Output is correct
36 Incorrect 20 ms 6264 KB Output isn't correct
37 Correct 27 ms 6264 KB Output is correct
38 Correct 81 ms 6264 KB Output is correct
39 Incorrect 25 ms 6264 KB Output isn't correct
40 Correct 30 ms 6264 KB Output is correct
41 Correct 76 ms 6264 KB Output is correct
42 Incorrect 29 ms 6520 KB Output isn't correct
43 Correct 41 ms 6524 KB Output is correct
44 Correct 109 ms 6520 KB Output is correct
45 Incorrect 34 ms 6492 KB Output isn't correct
46 Correct 41 ms 6608 KB Output is correct
47 Correct 142 ms 6648 KB Output is correct
48 Incorrect 41 ms 6648 KB Output isn't correct
49 Correct 50 ms 6648 KB Output is correct
50 Correct 176 ms 6780 KB Output is correct
51 Incorrect 47 ms 6776 KB Output isn't correct
52 Correct 59 ms 6648 KB Output is correct
53 Correct 206 ms 6704 KB Output is correct
54 Incorrect 51 ms 6776 KB Output isn't correct
55 Correct 62 ms 6776 KB Output is correct
56 Correct 208 ms 6752 KB Output is correct
57 Incorrect 56 ms 6776 KB Output isn't correct
58 Correct 70 ms 6692 KB Output is correct
59 Correct 238 ms 6776 KB Output is correct
60 Incorrect 62 ms 6780 KB Output isn't correct
61 Correct 79 ms 6840 KB Output is correct
62 Correct 272 ms 7040 KB Output is correct
63 Execution timed out 1091 ms 6776 KB Time limit exceeded
64 Execution timed out 1074 ms 6776 KB Time limit exceeded
65 Execution timed out 1091 ms 6776 KB Time limit exceeded
66 Execution timed out 1082 ms 6776 KB Time limit exceeded
67 Execution timed out 1092 ms 6776 KB Time limit exceeded
68 Execution timed out 1059 ms 6776 KB Time limit exceeded
69 Execution timed out 1089 ms 6776 KB Time limit exceeded
70 Execution timed out 1078 ms 6776 KB Time limit exceeded
71 Execution timed out 1090 ms 6776 KB Time limit exceeded
72 Execution timed out 1082 ms 6776 KB Time limit exceeded
73 Execution timed out 1089 ms 6776 KB Time limit exceeded
74 Execution timed out 1080 ms 6776 KB Time limit exceeded
75 Execution timed out 1080 ms 6776 KB Time limit exceeded
76 Execution timed out 1078 ms 6776 KB Time limit exceeded
77 Execution timed out 1071 ms 6776 KB Time limit exceeded
78 Execution timed out 1058 ms 6776 KB Time limit exceeded
79 Execution timed out 1060 ms 6776 KB Time limit exceeded
80 Execution timed out 1070 ms 6776 KB Time limit exceeded
81 Execution timed out 1081 ms 6776 KB Time limit exceeded
82 Execution timed out 1071 ms 6776 KB Time limit exceeded
83 Execution timed out 1054 ms 6908 KB Time limit exceeded
84 Execution timed out 1082 ms 6776 KB Time limit exceeded
85 Execution timed out 1091 ms 6752 KB Time limit exceeded
86 Execution timed out 1080 ms 6904 KB Time limit exceeded
87 Execution timed out 1069 ms 6904 KB Time limit exceeded
88 Execution timed out 1071 ms 6776 KB Time limit exceeded
89 Execution timed out 1083 ms 6776 KB Time limit exceeded
90 Execution timed out 1082 ms 6776 KB Time limit exceeded
91 Execution timed out 1067 ms 6776 KB Time limit exceeded
92 Execution timed out 1080 ms 6776 KB Time limit exceeded