oj.uz

답안 #104016

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104016 2019-04-03T17:04:33 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;
bool check(int x, int y) {
	if(x >= 0 && x < n && y >= 0 && y < n) return true;
	return false;
}
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;
			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;
				}
			}
		}
	}
	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() { 
	int i, j, l, r, curx, cury, curstep, movexx, moveyy, mid;
	scanf("%d%d", &n, &s);
	for(i = 0; i < n; i++) {
		scanf("%s", 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) continue;
		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)) {
		printf("-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;
	}
	printf("%d\n", l);
	return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &s);
  ~~~~~^~~~~~~~~~~~~~~~
mecho.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", maps[i]);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
31.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5376 KB Output is correct
2 Incorrect 6 ms 5376 KB Output isn't correct
3 Correct 7 ms 5376 KB Output is correct
4 Incorrect 8 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 1071 ms 19076 KB Time limit exceeded
8 Correct 8 ms 5376 KB Output is correct
9 Correct 7 ms 5376 KB Output is correct
10 Correct 8 ms 5376 KB Output is correct
11 Correct 7 ms 5376 KB Output is correct
12 Incorrect 6 ms 5376 KB Output isn't correct
13 Incorrect 9 ms 5376 KB Output isn't correct
14 Correct 19 ms 5416 KB Output is correct
15 Correct 7 ms 5504 KB Output is correct
16 Correct 7 ms 5376 KB Output is correct
17 Correct 7 ms 5476 KB Output is correct
18 Correct 7 ms 5504 KB Output is correct
19 Correct 8 ms 5504 KB Output is correct
20 Correct 8 ms 5376 KB Output is correct
21 Correct 9 ms 5504 KB Output is correct
22 Correct 8 ms 5376 KB Output is correct
23 Correct 8 ms 5504 KB Output is correct
24 Correct 8 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 5376 KB Output is correct
28 Correct 10 ms 5504 KB Output is correct
29 Correct 22 ms 5632 KB Output is correct
30 Correct 11 ms 5504 KB Output is correct
31 Correct 8 ms 5504 KB Output is correct
32 Correct 13 ms 5504 KB Output is correct
33 Correct 17 ms 5760 KB Output is correct
34 Correct 224 ms 6144 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 14 ms 5760 KB Output is correct
37 Correct 310 ms 6528 KB Output is correct
38 Runtime error 159 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
39 Correct 14 ms 5840 KB Output is correct
40 Correct 397 ms 6748 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 23 ms 5760 KB Output is correct
43 Correct 544 ms 7092 KB Output is correct
44 Runtime error 170 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
45 Correct 18 ms 5888 KB Output is correct
46 Correct 686 ms 7168 KB Output is correct
47 Runtime error 163 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
48 Correct 24 ms 5888 KB Output is correct
49 Correct 885 ms 7492 KB Output is correct
50 Runtime error 184 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
51 Correct 25 ms 5888 KB Output is correct
52 Execution timed out 1068 ms 7728 KB Time limit exceeded
53 Runtime error 174 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
54 Correct 28 ms 5888 KB Output is correct
55 Execution timed out 1074 ms 7936 KB Time limit exceeded
56 Runtime error 201 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Correct 38 ms 6016 KB Output is correct
58 Execution timed out 1058 ms 8312 KB Time limit exceeded
59 Runtime error 173 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Correct 28 ms 6016 KB Output is correct
61 Execution timed out 1082 ms 8696 KB Time limit exceeded
62 Runtime error 180 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
63 Incorrect 44 ms 6008 KB Output isn't correct
64 Incorrect 282 ms 6008 KB Output isn't correct
65 Incorrect 239 ms 6008 KB Output isn't correct
66 Incorrect 51 ms 6008 KB Output isn't correct
67 Correct 46 ms 6016 KB Output is correct
68 Incorrect 36 ms 6144 KB Output isn't correct
69 Incorrect 41 ms 5984 KB Output isn't correct
70 Incorrect 35 ms 6136 KB Output isn't correct
71 Incorrect 33 ms 6008 KB Output isn't correct
72 Incorrect 40 ms 6136 KB Output isn't correct
73 Incorrect 186 ms 6600 KB Output isn't correct
74 Runtime error 197 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
75 Incorrect 608 ms 6724 KB Output isn't correct
76 Incorrect 453 ms 6724 KB Output isn't correct
77 Execution timed out 1074 ms 8260 KB Time limit exceeded
78 Correct 175 ms 7032 KB Output is correct
79 Runtime error 231 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
80 Incorrect 842 ms 7036 KB Output isn't correct
81 Incorrect 665 ms 6520 KB Output isn't correct
82 Execution timed out 1061 ms 9976 KB Time limit exceeded
83 Incorrect 183 ms 7032 KB Output isn't correct
84 Runtime error 213 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
85 Execution timed out 1051 ms 9332 KB Time limit exceeded
86 Execution timed out 1068 ms 7544 KB Time limit exceeded
87 Execution timed out 1077 ms 15484 KB Time limit exceeded
88 Incorrect 331 ms 9720 KB Output isn't correct
89 Runtime error 208 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
90 Execution timed out 1079 ms 17544 KB Time limit exceeded
91 Execution timed out 1062 ms 37848 KB Time limit exceeded
92 Execution timed out 1069 ms 11752 KB Time limit exceeded