oj.uz

Submission #104021

# Submission time Handle Problem Language Result Execution time Memory
104021 2019-04-03T17:15:10 Z Erkhemkhuu Mecho (IOI09_mecho) C++17
31 / 100
 1000 ms 66560 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
int movex[4] = {-1, 0, 1, 0};
int movey[4] = {0, 1, 0, -1};
string maps[805];
int beeStep[805][805], meStep[805][805], n, Mx, My, s, Dx, Dy;
queue <pair <int, int> > bee, me;
inline bool check(int x, int y) {
	if(x >= 0 && x < n && y >= 0 && y < n) return true;
	return false;
}
inline bool can(int mid) {
	int curx, cury, curstep, i, i1, movexx, moveyy;
	memset(meStep, -1, sizeof(meStep));
	me.push(mp(Mx * 1000 + My, mid));
	while(!me.empty()) {
		curx = me.front().F / 1000;
		cury = me.front().F % 1000;
		curstep = me.front().S;
		me.pop();
		if(meStep[curx][cury] == -1) {
			meStep[curx][cury] = curstep;
			if(maps[curx][cury] == 'D') break;
			for(i = 0; i < 4; i++) {
				for(i1 = 1; i1 <= s; i1++) {
					movexx = movex[i] * i1 + curx;
					moveyy = movey[i] * i1 + cury;
					if(check(movexx, moveyy) && maps[movexx][moveyy] != 'T' && meStep[movexx][moveyy] == -1) {
						if(beeStep[movexx][moveyy] != -1 && beeStep[movexx][moveyy] <= curstep) break;
						me.push(mp(movexx * 1000 + moveyy, curstep + 1));
					}
					else break;
				}
			}
		}
	}
	while(!me.empty())
		me.pop();
	if(beeStep[Dx][Dy] == -1) beeStep[Dx][Dy] = 1e9;
	if(meStep[Dx][Dy] == -1) return false;
	return meStep[Dx][Dy] < beeStep[Dx][Dy];
}
int main() {
	cin.tie(NULL);
	cout.tie(NULL);
	ios_base::sync_with_stdio;
	int i, j, l, r, curx, cury, curstep, movexx, moveyy, mid;
	cin >> n >> s;
	for(i = 0; i < n; i++) {
		cin >> maps[i];
		for(j = 0; j < n; j++) {
			if(maps[i][j] == 'H')
				bee.push(mp(i * 1000 + j, 0));
			if(maps[i][j] == 'M') {
				Mx = i; My = j;
			}
			if(maps[i][j] == 'D') {
				Dx = i; Dy = j;
			}
		}
	}
	memset(beeStep, -1, sizeof(beeStep));
	while(!bee.empty()) {
		curx = bee.front().F / 1000;
		cury = bee.front().F % 1000;
		curstep = bee.front().S;
		bee.pop();
		if(beeStep[curx][cury] == -1) {
			beeStep[curx][cury] = curstep;
			for(i = 0; i < 4; i++) {
				movexx = movex[i] + curx;
				moveyy = movey[i] + cury;
				if(check(movexx, moveyy) && maps[movexx][moveyy] != 'T' && beeStep[movexx][moveyy] == -1)
					bee.push(mp(movexx * 1000 + moveyy, curstep + 1));
			}
		}
	}
	if(!can(0)) {
		cout << "-1\n";
		return 0;
	}
	l = 0; r = n * n;
	while(l + 1 < r) {
		mid = (l + r) / 2;
		if(can(mid)) l = mid;
		else r = mid;
	}
	cout << l << "\n";
	return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:51:27: warning: statement is a reference, not call, to function 'std::ios_base::sync_with_stdio' [-Waddress]
  ios_base::sync_with_stdio;
                           ^
mecho.cpp:51:27: warning: statement has no effect [-Wunused-value]

Subtask #1
31.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5376 KB Output is correct
2 Incorrect 6 ms 5504 KB Output isn't correct
3 Correct 7 ms 5376 KB Output is correct
4 Incorrect 7 ms 5504 KB Output isn't correct
5 Correct 8 ms 5476 KB Output is correct
6 Incorrect 8 ms 5376 KB Output isn't correct
7 Execution timed out 1074 ms 19332 KB Time limit exceeded
8 Correct 6 ms 5376 KB Output is correct
9 Correct 7 ms 5504 KB Output is correct
10 Correct 8 ms 5504 KB Output is correct
11 Correct 7 ms 5504 KB Output is correct
12 Incorrect 7 ms 5504 KB Output isn't correct
13 Incorrect 8 ms 5376 KB Output isn't correct
14 Correct 7 ms 5504 KB Output is correct
15 Correct 8 ms 5372 KB Output is correct
16 Correct 8 ms 5504 KB Output is correct
17 Correct 7 ms 5376 KB Output is correct
18 Correct 7 ms 5376 KB Output is correct
19 Correct 9 ms 5504 KB Output is correct
20 Correct 9 ms 5376 KB Output is correct
21 Correct 8 ms 5376 KB Output is correct
22 Correct 7 ms 5376 KB Output is correct
23 Correct 8 ms 5504 KB Output is correct
24 Correct 8 ms 5376 KB Output is correct
25 Correct 9 ms 5376 KB Output is correct
26 Correct 10 ms 5504 KB Output is correct
27 Correct 9 ms 5504 KB Output is correct
28 Correct 9 ms 5504 KB Output is correct
29 Correct 8 ms 5376 KB Output is correct
30 Correct 8 ms 5376 KB Output is correct
31 Correct 8 ms 5504 KB Output is correct
32 Correct 8 ms 5504 KB Output is correct
33 Correct 14 ms 5632 KB Output is correct
34 Correct 22 ms 5888 KB Output is correct
35 Runtime error 186 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
36 Correct 20 ms 5632 KB Output is correct
37 Correct 33 ms 6016 KB Output is correct
38 Runtime error 204 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
39 Correct 19 ms 5632 KB Output is correct
40 Correct 31 ms 6144 KB Output is correct
41 Runtime error 170 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Correct 20 ms 5860 KB Output is correct
43 Correct 48 ms 6392 KB Output is correct
44 Runtime error 188 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
45 Correct 24 ms 5888 KB Output is correct
46 Correct 50 ms 6656 KB Output is correct
47 Runtime error 184 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
48 Correct 25 ms 6008 KB Output is correct
49 Correct 51 ms 6776 KB Output is correct
50 Runtime error 167 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
51 Correct 32 ms 5988 KB Output is correct
52 Correct 106 ms 7004 KB Output is correct
53 Runtime error 184 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
54 Correct 43 ms 6008 KB Output is correct
55 Correct 67 ms 7168 KB Output is correct
56 Runtime error 181 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Correct 52 ms 6136 KB Output is correct
58 Correct 89 ms 7352 KB Output is correct
59 Runtime error 260 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Correct 40 ms 6136 KB Output is correct
61 Correct 136 ms 7680 KB Output is correct
62 Runtime error 197 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
63 Incorrect 63 ms 6180 KB Output isn't correct
64 Incorrect 349 ms 6264 KB Output isn't correct
65 Incorrect 316 ms 6264 KB Output isn't correct
66 Incorrect 68 ms 6264 KB Output isn't correct
67 Correct 73 ms 6236 KB Output is correct
68 Incorrect 57 ms 6268 KB Output isn't correct
69 Incorrect 55 ms 6264 KB Output isn't correct
70 Incorrect 59 ms 6264 KB Output isn't correct
71 Incorrect 57 ms 6136 KB Output isn't correct
72 Incorrect 71 ms 6264 KB Output isn't correct
73 Incorrect 238 ms 6984 KB Output isn't correct
74 Runtime error 250 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
75 Incorrect 751 ms 6908 KB Output isn't correct
76 Incorrect 599 ms 6852 KB Output isn't correct
77 Execution timed out 1063 ms 8520 KB Time limit exceeded
78 Correct 175 ms 7160 KB Output is correct
79 Runtime error 252 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
80 Incorrect 760 ms 7160 KB Output isn't correct
81 Incorrect 710 ms 6776 KB Output isn't correct
82 Execution timed out 1071 ms 10236 KB Time limit exceeded
83 Incorrect 191 ms 7244 KB Output isn't correct
84 Runtime error 228 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
85 Execution timed out 1063 ms 9552 KB Time limit exceeded
86 Execution timed out 1067 ms 7800 KB Time limit exceeded
87 Execution timed out 1056 ms 15740 KB Time limit exceeded
88 Incorrect 332 ms 9732 KB Output isn't correct
89 Runtime error 230 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
90 Execution timed out 1074 ms 17632 KB Time limit exceeded
91 Execution timed out 1075 ms 38176 KB Time limit exceeded
92 Execution timed out 1056 ms 11644 KB Time limit exceeded