Submission #53462

# Submission time Handle Problem Language Result Execution time Memory
53462 2018-06-30T05:27:30 Z 장홍준(#2017) Mecho (IOI09_mecho) C++11
23 / 100
746 ms 3588 KB
#include<stdio.h>
#include<deque>
#include<vector>
using namespace std;
int n, S;
char M[818][818], NM[818][818];
int D[818][818];
int dx[4] = { 1,-1,0,0 };
int dy[4] = { 0,0,1,-1 };
vector<int>Qhx, Qhy;
void spread() {
	int i, j;
	vector<int>Qnx, Qny;
	for(i=0;i<Qhx.size();i++){
		int nowx = Qhx[i], nowy = Qhy[i];
		for (int k = 0; k < 4; k++) {
			int nx = nowx + dx[k], ny = nowy + dy[k];
			if (nx <= 0 || ny <= 0 || nx > n || ny > n)continue;
			if (NM[nx][ny] != 'T'&&NM[nx][ny] != 'H') {
				NM[nx][ny] = 'H';
				Qnx.push_back(nx); Qny.push_back(ny);
			}
		}
	}
	Qhx.clear(); Qhy.clear();
	for (i = 0; i < Qnx.size(); i++) {
		Qhx.push_back(Qnx[i]);
		Qhy.push_back(Qny[i]);
	}
}
bool is_gone[818][818];
void printnm() { for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++)printf("%c", NM[i][j]); printf("\n"); }printf("\n"); }
int f(int x) {
	Qhx.clear(); Qhy.clear();
	int i, j, sx, sy, ex, ey, nxt;
	deque<int>qx, qy, qd;
	for (i = 1; i <= n; i++)for (j = 1; j <= n; j++) {
		if (M[i][j] == 'M')sx = i, sy = j;
		if (M[i][j] == 'D')ex = i, ey = j;
		if (M[i][j] == 'H')Qhx.push_back(i), Qhy.push_back(j);
		NM[i][j] = M[i][j];
		is_gone[i][j] = 0;
	}
	for (i = 0; i < x; i++)spread();
	qx.push_back(sx); qy.push_back(sy); qd.push_back(0);
	nxt = S;
	while (!qx.empty()) {
		int nowx = qx.front(); qx.pop_front();
		int nowy = qy.front(); qy.pop_front();
		int nowd = qd.front(); qd.pop_front();
		if (nowx == ex && nowy == ey)return 1;
		if (nowd == nxt)
			spread(), nxt += S;
		if (NM[nowx][nowy] == 'H')continue;
		for (i = 0; i < 4; i++) {
			int nx = nowx + dx[i], ny = nowy + dy[i];
			if (nx <= 0 || ny <= 0 || nx > n || ny > n)continue;
			if (is_gone[nx][ny])continue;
			if (NM[nx][ny] == 'H')continue;
			qx.push_back(nx); qy.push_back(ny); qd.push_back(nowd + 1);
			is_gone[nx][ny] = 1;
		}
	}
	return 0;
}
int main() {
	int i, j, s, e, ans = -1;
	scanf("%d%d", &n, &S);
	for (i = 1; i <= n; i++)for (j = 1; j <= n; j++)scanf(" %c", &M[i][j]);
	s = 0, e = n * n;
	while (s <= e) {
		int m = (s + e) / 2;
		int k = f(m);
		if (k)s = m + 1, ans = m;
		else e = m - 1;
	}
	printf("%d", ans);
	return 0;
}

Compilation message

mecho.cpp: In function 'void spread()':
mecho.cpp:14:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<Qhx.size();i++){
          ~^~~~~~~~~~~
mecho.cpp:26:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (i = 0; i < Qnx.size(); i++) {
              ~~^~~~~~~~~~~~
mecho.cpp:12:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
mecho.cpp: In function 'int main()':
mecho.cpp:68: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:69:55: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i = 1; i <= n; i++)for (j = 1; j <= n; j++)scanf(" %c", &M[i][j]);
                                                  ~~~~~^~~~~~~~~~~~~~~~~
mecho.cpp: In function 'int f(int)':
mecho.cpp:51:26: warning: 'ey' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if (nowx == ex && nowy == ey)return 1;
                     ~~~~~^~~~~
mecho.cpp:51:12: warning: 'ex' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if (nowx == ex && nowy == ey)return 1;
       ~~~~~^~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 2 ms 484 KB Output isn't correct
3 Correct 2 ms 484 KB Output is correct
4 Incorrect 2 ms 504 KB Output isn't correct
5 Incorrect 2 ms 504 KB Output isn't correct
6 Incorrect 2 ms 536 KB Output isn't correct
7 Incorrect 363 ms 2840 KB Output isn't correct
8 Correct 2 ms 2840 KB Output is correct
9 Correct 2 ms 2840 KB Output is correct
10 Correct 2 ms 2840 KB Output is correct
11 Correct 2 ms 2840 KB Output is correct
12 Incorrect 3 ms 2840 KB Output isn't correct
13 Correct 3 ms 2840 KB Output is correct
14 Correct 4 ms 2840 KB Output is correct
15 Correct 2 ms 2840 KB Output is correct
16 Incorrect 2 ms 2840 KB Output isn't correct
17 Correct 2 ms 2840 KB Output is correct
18 Incorrect 3 ms 2840 KB Output isn't correct
19 Correct 2 ms 2840 KB Output is correct
20 Incorrect 3 ms 2840 KB Output isn't correct
21 Correct 3 ms 2840 KB Output is correct
22 Incorrect 3 ms 2840 KB Output isn't correct
23 Correct 3 ms 2840 KB Output is correct
24 Incorrect 4 ms 2840 KB Output isn't correct
25 Correct 4 ms 2840 KB Output is correct
26 Incorrect 4 ms 2840 KB Output isn't correct
27 Correct 5 ms 2840 KB Output is correct
28 Incorrect 5 ms 2840 KB Output isn't correct
29 Correct 5 ms 2840 KB Output is correct
30 Incorrect 5 ms 2840 KB Output isn't correct
31 Correct 5 ms 2840 KB Output is correct
32 Incorrect 6 ms 2840 KB Output isn't correct
33 Correct 114 ms 2840 KB Output is correct
34 Incorrect 128 ms 2840 KB Output isn't correct
35 Incorrect 56 ms 2840 KB Output isn't correct
36 Correct 147 ms 2840 KB Output is correct
37 Incorrect 152 ms 2840 KB Output isn't correct
38 Incorrect 83 ms 2840 KB Output isn't correct
39 Correct 186 ms 2840 KB Output is correct
40 Incorrect 203 ms 2840 KB Output isn't correct
41 Incorrect 105 ms 2840 KB Output isn't correct
42 Correct 278 ms 2840 KB Output is correct
43 Incorrect 258 ms 2840 KB Output isn't correct
44 Incorrect 134 ms 2840 KB Output isn't correct
45 Correct 334 ms 2840 KB Output is correct
46 Incorrect 336 ms 2840 KB Output isn't correct
47 Incorrect 190 ms 2840 KB Output isn't correct
48 Correct 365 ms 2840 KB Output is correct
49 Incorrect 444 ms 2840 KB Output isn't correct
50 Incorrect 184 ms 2840 KB Output isn't correct
51 Correct 442 ms 2840 KB Output is correct
52 Incorrect 450 ms 2840 KB Output isn't correct
53 Incorrect 221 ms 2840 KB Output isn't correct
54 Correct 536 ms 2840 KB Output is correct
55 Incorrect 522 ms 2840 KB Output isn't correct
56 Incorrect 241 ms 2840 KB Output isn't correct
57 Correct 580 ms 2840 KB Output is correct
58 Incorrect 637 ms 2840 KB Output isn't correct
59 Incorrect 309 ms 2840 KB Output isn't correct
60 Correct 721 ms 2840 KB Output is correct
61 Incorrect 746 ms 2840 KB Output isn't correct
62 Incorrect 478 ms 2840 KB Output isn't correct
63 Incorrect 452 ms 2840 KB Output isn't correct
64 Incorrect 454 ms 2840 KB Output isn't correct
65 Incorrect 436 ms 2840 KB Output isn't correct
66 Incorrect 457 ms 2840 KB Output isn't correct
67 Incorrect 445 ms 2840 KB Output isn't correct
68 Incorrect 482 ms 2840 KB Output isn't correct
69 Incorrect 444 ms 2840 KB Output isn't correct
70 Incorrect 465 ms 2840 KB Output isn't correct
71 Incorrect 424 ms 2840 KB Output isn't correct
72 Correct 437 ms 2840 KB Output is correct
73 Correct 309 ms 3492 KB Output is correct
74 Incorrect 374 ms 3528 KB Output isn't correct
75 Incorrect 497 ms 3560 KB Output isn't correct
76 Incorrect 471 ms 3560 KB Output isn't correct
77 Incorrect 428 ms 3588 KB Output isn't correct
78 Correct 418 ms 3588 KB Output is correct
79 Incorrect 452 ms 3588 KB Output isn't correct
80 Incorrect 405 ms 3588 KB Output isn't correct
81 Incorrect 472 ms 3588 KB Output isn't correct
82 Incorrect 409 ms 3588 KB Output isn't correct
83 Incorrect 442 ms 3588 KB Output isn't correct
84 Incorrect 449 ms 3588 KB Output isn't correct
85 Incorrect 392 ms 3588 KB Output isn't correct
86 Incorrect 387 ms 3588 KB Output isn't correct
87 Incorrect 407 ms 3588 KB Output isn't correct
88 Incorrect 444 ms 3588 KB Output isn't correct
89 Incorrect 400 ms 3588 KB Output isn't correct
90 Incorrect 402 ms 3588 KB Output isn't correct
91 Incorrect 420 ms 3588 KB Output isn't correct
92 Incorrect 455 ms 3588 KB Output isn't correct