oj.uz

Submission #104020

# Submission time Handle Problem Language Result Execution time Memory
104020 2019-04-03T17:14:05 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};
char maps[805][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 6 ms 5376 KB Output is correct
2 Incorrect 6 ms 5376 KB Output isn't correct
3 Correct 6 ms 5376 KB Output is correct
4 Incorrect 7 ms 5376 KB Output isn't correct
5 Correct 7 ms 5376 KB Output is correct
6 Incorrect 6 ms 5376 KB Output isn't correct
7 Execution timed out 1074 ms 18924 KB Time limit exceeded
8 Correct 7 ms 5376 KB Output is correct
9 Correct 9 ms 5504 KB Output is correct
10 Correct 8 ms 5376 KB Output is correct
11 Correct 8 ms 5376 KB Output is correct
12 Incorrect 7 ms 5504 KB Output isn't correct
13 Incorrect 9 ms 5376 KB Output isn't correct
14 Correct 6 ms 5504 KB Output is correct
15 Correct 8 ms 5376 KB Output is correct
16 Correct 8 ms 5504 KB Output is correct
17 Correct 8 ms 5504 KB Output is correct
18 Correct 8 ms 5504 KB Output is correct
19 Correct 7 ms 5376 KB Output is correct
20 Correct 8 ms 5504 KB Output is correct
21 Correct 9 ms 5504 KB Output is correct
22 Correct 8 ms 5504 KB Output is correct
23 Correct 8 ms 5504 KB Output is correct
24 Correct 10 ms 5504 KB Output is correct
25 Correct 8 ms 5504 KB Output is correct
26 Correct 10 ms 5504 KB Output is correct
27 Correct 8 ms 5504 KB Output is correct
28 Correct 9 ms 5504 KB Output is correct
29 Correct 10 ms 5504 KB Output is correct
30 Correct 11 ms 5504 KB Output is correct
31 Correct 9 ms 5504 KB Output is correct
32 Correct 8 ms 5504 KB Output is correct
33 Correct 15 ms 5760 KB Output is correct
34 Correct 26 ms 5992 KB Output is correct
35 Runtime error 175 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
36 Correct 16 ms 5760 KB Output is correct
37 Correct 41 ms 6008 KB Output is correct
38 Runtime error 183 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
39 Correct 17 ms 5760 KB Output is correct
40 Correct 38 ms 6144 KB Output is correct
41 Runtime error 181 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Correct 20 ms 5760 KB Output is correct
43 Correct 44 ms 6520 KB Output is correct
44 Runtime error 169 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
45 Correct 27 ms 5752 KB Output is correct
46 Correct 47 ms 6536 KB Output is correct
47 Runtime error 166 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
48 Correct 23 ms 5860 KB Output is correct
49 Correct 49 ms 6656 KB Output is correct
50 Runtime error 166 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
51 Correct 27 ms 5888 KB Output is correct
52 Correct 78 ms 6776 KB Output is correct
53 Runtime error 181 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
54 Correct 32 ms 6016 KB Output is correct
55 Correct 78 ms 7040 KB Output is correct
56 Runtime error 201 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Correct 32 ms 6008 KB Output is correct
58 Correct 99 ms 7268 KB Output is correct
59 Runtime error 192 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Correct 47 ms 6136 KB Output is correct
61 Correct 116 ms 7428 KB Output is correct
62 Runtime error 184 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
63 Incorrect 67 ms 6008 KB Output isn't correct
64 Incorrect 293 ms 6008 KB Output isn't correct
65 Incorrect 281 ms 6136 KB Output isn't correct
66 Incorrect 58 ms 6008 KB Output isn't correct
67 Correct 56 ms 6012 KB Output is correct
68 Incorrect 47 ms 6076 KB Output isn't correct
69 Incorrect 47 ms 6136 KB Output isn't correct
70 Incorrect 64 ms 6136 KB Output isn't correct
71 Incorrect 45 ms 6136 KB Output isn't correct
72 Incorrect 56 ms 6136 KB Output isn't correct
73 Incorrect 202 ms 6600 KB Output isn't correct
74 Runtime error 246 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
75 Incorrect 697 ms 6728 KB Output isn't correct
76 Incorrect 509 ms 6596 KB Output isn't correct
77 Execution timed out 1080 ms 8264 KB Time limit exceeded
78 Correct 208 ms 7064 KB Output is correct
79 Runtime error 247 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
80 Incorrect 786 ms 7032 KB Output isn't correct
81 Incorrect 657 ms 6520 KB Output isn't correct
82 Execution timed out 1074 ms 9968 KB Time limit exceeded
83 Incorrect 174 ms 7076 KB Output isn't correct
84 Runtime error 207 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
85 Execution timed out 1083 ms 9284 KB Time limit exceeded
86 Execution timed out 1084 ms 7544 KB Time limit exceeded
87 Execution timed out 1065 ms 15556 KB Time limit exceeded
88 Incorrect 336 ms 9464 KB Output isn't correct
89 Runtime error 224 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
90 Execution timed out 1077 ms 17416 KB Time limit exceeded
91 Execution timed out 1077 ms 38068 KB Time limit exceeded
92 Execution timed out 1076 ms 11772 KB Time limit exceeded