oj.uz

답안 #104012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104012 2019-04-03T16:56:26 Z Erkhemkhuu Mecho (IOI09_mecho) C++17
23 / 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) {
	memset(meStep, -1, sizeof(meStep));
	me.push(mp(Mx * 1000 + My, mid));
	while(!me.empty()) {
		int curx = me.front().F / 1000;
		int cury = me.front().F % 1000;
		int curstep = me.front().S;
		me.pop();
		if(meStep[curx][cury] != -1) continue;
		meStep[curx][cury] = curstep;
		for(int i = 0; i < 4; i++) {
			for(int i1 = 1; i1 <= s; i1++) {
				int movexx = movex[i] * i1 + curx;
				int 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;
			}
		}
	}
	//cout << meStep[Dx][Dy] << " " << beeStep[Dx][Dy] << "\n";
	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;
	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()) {
		int curx = bee.front().F / 1000;
		int cury = bee.front().F % 1000;
		int curstep = bee.front().S;
		bee.pop();
		if(beeStep[curx][cury] != -1) continue;
		beeStep[curx][cury] = curstep;
		for(int i = 0; i < 4; i++) {
			int movexx = movex[i] + curx;
			int moveyy = movey[i] + cury;
			if(check(movexx, moveyy) && maps[movexx][moveyy] != 'T' && beeStep[movexx][moveyy] == -1)
				bee.push(mp(movexx * 1000 + moveyy, curstep + 1));
		}
	}
	l = 0; r = n * n;
	while(l != r) {
		int mid = (l + r + 1) / 2;
		if(can(mid)) l = mid ;
		else r = mid - 1;
	}
	printf("%d\n", l);
	return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:46: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:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", maps[i]);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
23.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5376 KB Output is correct
2 Incorrect 7 ms 5376 KB Output isn't correct
3 Correct 7 ms 5376 KB Output is correct
4 Incorrect 9 ms 5344 KB Output isn't correct
5 Correct 7 ms 5376 KB Output is correct
6 Incorrect 8 ms 5376 KB Output isn't correct
7 Execution timed out 1063 ms 15944 KB Time limit exceeded
8 Incorrect 8 ms 5376 KB Output isn't correct
9 Correct 8 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 8 ms 5476 KB Output isn't correct
13 Incorrect 7 ms 5376 KB Output isn't correct
14 Incorrect 9 ms 5632 KB Output isn't correct
15 Correct 8 ms 5376 KB Output is correct
16 Correct 8 ms 5504 KB Output is correct
17 Correct 7 ms 5504 KB Output is correct
18 Correct 8 ms 5504 KB Output is correct
19 Correct 8 ms 5504 KB Output is correct
20 Correct 8 ms 5504 KB Output is correct
21 Correct 9 ms 5476 KB Output is correct
22 Correct 9 ms 5504 KB Output is correct
23 Correct 9 ms 5504 KB Output is correct
24 Correct 8 ms 5504 KB Output is correct
25 Correct 7 ms 5504 KB Output is correct
26 Correct 9 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 9 ms 5504 KB Output is correct
30 Correct 9 ms 5504 KB Output is correct
31 Correct 9 ms 5476 KB Output is correct
32 Correct 9 ms 5504 KB Output is correct
33 Correct 12 ms 5760 KB Output is correct
34 Correct 106 ms 6272 KB Output is correct
35 Runtime error 577 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 154 ms 6400 KB Output is correct
38 Runtime error 740 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
39 Correct 14 ms 5760 KB Output is correct
40 Correct 204 ms 6528 KB Output is correct
41 Runtime error 337 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Correct 17 ms 5888 KB Output is correct
43 Correct 299 ms 6904 KB Output is correct
44 Runtime error 374 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
45 Correct 18 ms 5760 KB Output is correct
46 Correct 394 ms 7144 KB Output is correct
47 Runtime error 343 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
48 Correct 21 ms 5888 KB Output is correct
49 Correct 517 ms 7460 KB Output is correct
50 Runtime error 170 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
51 Correct 21 ms 5888 KB Output is correct
52 Correct 655 ms 7756 KB Output is correct
53 Runtime error 169 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
54 Correct 24 ms 6016 KB Output is correct
55 Correct 797 ms 8080 KB Output is correct
56 Runtime error 187 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Correct 23 ms 6016 KB Output is correct
58 Correct 950 ms 8392 KB Output is correct
59 Runtime error 166 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Correct 24 ms 6016 KB Output is correct
61 Execution timed out 1077 ms 8824 KB Time limit exceeded
62 Runtime error 184 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
63 Correct 141 ms 6136 KB Output is correct
64 Incorrect 280 ms 6092 KB Output isn't correct
65 Incorrect 269 ms 6136 KB Output isn't correct
66 Incorrect 171 ms 6108 KB Output isn't correct
67 Incorrect 201 ms 6136 KB Output isn't correct
68 Correct 36 ms 6008 KB Output is correct
69 Incorrect 36 ms 6008 KB Output isn't correct
70 Incorrect 34 ms 6008 KB Output isn't correct
71 Incorrect 45 ms 6008 KB Output isn't correct
72 Incorrect 39 ms 6032 KB Output isn't correct
73 Incorrect 166 ms 6700 KB Output isn't correct
74 Runtime error 254 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
75 Incorrect 526 ms 6600 KB Output isn't correct
76 Incorrect 381 ms 6468 KB Output isn't correct
77 Execution timed out 1037 ms 8008 KB Time limit exceeded
78 Incorrect 831 ms 7248 KB Output isn't correct
79 Runtime error 196 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
80 Incorrect 632 ms 6900 KB Output isn't correct
81 Incorrect 596 ms 6648 KB Output isn't correct
82 Execution timed out 1078 ms 9148 KB Time limit exceeded
83 Correct 822 ms 7076 KB Output is correct
84 Runtime error 224 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
85 Execution timed out 1072 ms 9080 KB Time limit exceeded
86 Execution timed out 1063 ms 7748 KB Time limit exceeded
87 Execution timed out 1068 ms 14804 KB Time limit exceeded
88 Execution timed out 1062 ms 9736 KB Time limit exceeded
89 Runtime error 272 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
90 Execution timed out 1064 ms 15912 KB Time limit exceeded
91 Execution timed out 1064 ms 29968 KB Time limit exceeded
92 Execution timed out 1047 ms 11432 KB Time limit exceeded