oj.uz

답안 #281912

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
281912 2020-08-23T15:38:13 Z Plurm Mecho (IOI09_mecho) C++11
39 / 100
 415 ms 5804 KB 
#include <bits/stdc++.h>
using namespace std;
char t[1024][1024];
char test[1024][1024];
int dist[1024][1024];
int n, s;
class state{
public:
	int x,y,cw;
	state(int a, int b, int c): x(a), y(b), cw(c) {}
};
void propagateBees(queue<state>& q, int limit){
	while(!q.empty() && q.front().cw < limit){
		state cur = q.front();
		q.pop();
		int x = cur.x;
		int y = cur.y;
		int w = cur.cw+1;
		if(x > 1 && (test[x-1][y] == 'G' || test[x-1][y] == 'M') && dist[x-1][y] > w){
			dist[x-1][y] = w;
			test[x-1][y] = 'H';
			q.emplace(x-1, y, w);
		}
		if(x < n && (test[x+1][y] == 'G' || test[x+1][y] == 'M') && dist[x+1][y] > w){
			dist[x+1][y] = w;
			test[x+1][y] = 'H';
			q.emplace(x+1, y, w);
		}
		if(y > 1 && (test[x][y-1] == 'G' || test[x][y-1] == 'M') && dist[x][y-1] > w){
			dist[x][y-1] = w;
			test[x][y-1] = 'H';
			q.emplace(x, y-1, w);
		}
		if(y < n && (test[x][y+1] == 'G' || test[x][y+1] == 'M') && dist[x][y+1] > w){
			dist[x][y+1] = w;
			test[x][y+1] = 'H';
			q.emplace(x, y+1, w);
		}
	}
}
void propagateMecho(queue<state>& q, int limit){
	while(!q.empty() && q.front().cw <= limit){
		state cur = q.front();
		q.pop();
		int x = cur.x;
		int y = cur.y;
		if(test[x][y] != 'M') continue;
		int w = cur.cw+1;
		if(x > 1 && (test[x-1][y] == 'G' || test[x-1][y] == 'D') && dist[x-1][y] > w){
			dist[x-1][y] = w;
			test[x-1][y] = 'M';
			q.emplace(x-1, y, w);
		}
		if(x < n && (test[x+1][y] == 'G' || test[x+1][y] == 'D') && dist[x+1][y] > w){
			dist[x+1][y] = w;
			test[x+1][y] = 'M';
			q.emplace(x+1, y, w);
		}
		if(y > 1 && (test[x][y-1] == 'G' || test[x][y-1] == 'D') && dist[x][y-1] > w){
			dist[x][y-1] = w;
			test[x][y-1] = 'M';
			q.emplace(x, y-1, w);
		}
		if(y < n && (test[x][y+1] == 'G' || test[x][y+1] == 'D') && dist[x][y+1] > w){
			dist[x][y+1] = w;
			test[x][y+1] = 'M';
			q.emplace(x, y+1, w);
		}
	}
}
bool escapePossible(int days){
	if(days == -1) return true;
	queue<state> q, mq;
	int dx, dy;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			test[i][j] = t[i][j];
			dist[i][j] = 1e9;
			if(t[i][j] == 'H'){
				q.emplace(i,j,0);
				dist[i][j] = 0;
			}else if(t[i][j] == 'D'){
				dx = i;
				dy = j;
			}else if(t[i][j] == 'M'){
				mq.emplace(i,j,0);
				dist[i][j] = 0;
			}
		}
	}
	propagateBees(q, days);
	int lm = 0;
	int oldDays = days;
	while(!mq.empty() && !q.empty() && test[dx][dy] != 'M'){
		lm += s;
		propagateMecho(mq, lm);
		days++;
		propagateBees(q, days);
	}
	return test[dx][dy] == 'M';
}
int main(){
	scanf("%d%d",&n,&s);
	for(int i = 1; i <= n; i++){
		scanf("%s", t[i]+1);
	}
	int lo = -1;
	int hi = n*n;
	int mid;
	while(lo < hi){
		mid = (lo+hi+1)/2;
		if(escapePossible(mid)){
			lo = mid;
		}else{
			hi = mid-1;
		}
	}
	printf("%d\n", lo);
	return 0;
}

Compilation message

mecho.cpp: In function 'bool escapePossible(int)':
mecho.cpp:93:6: warning: unused variable 'oldDays' [-Wunused-variable]
   93 |  int oldDays = days;
      |      ^~~~~~~
mecho.cpp: In function 'int main()':
mecho.cpp:103:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  103 |  scanf("%d%d",&n,&s);
      |  ~~~~~^~~~~~~~~~~~~~
mecho.cpp:105:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  105 |   scanf("%s", t[i]+1);
      |   ~~~~~^~~~~~~~~~~~~~
mecho.cpp: In function 'bool escapePossible(int)':
mecho.cpp:74:10: warning: 'dy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   74 |  int dx, dy;
      |          ^~
mecho.cpp:74:6: warning: 'dx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   74 |  int dx, dy;
      |      ^~

Subtask #1
39.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Incorrect 0 ms 384 KB Output isn't correct
4 Incorrect 1 ms 384 KB Output isn't correct
5 Correct 0 ms 384 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Correct 321 ms 5340 KB Output is correct
8 Incorrect 1 ms 384 KB Output isn't correct
9 Correct 1 ms 384 KB Output is correct
10 Incorrect 1 ms 384 KB Output isn't correct
11 Incorrect 1 ms 384 KB Output isn't correct
12 Correct 1 ms 640 KB Output is correct
13 Incorrect 1 ms 640 KB Output isn't correct
14 Correct 2 ms 640 KB Output is correct
15 Incorrect 1 ms 384 KB Output isn't correct
16 Correct 1 ms 384 KB Output is correct
17 Incorrect 1 ms 512 KB Output isn't correct
18 Correct 1 ms 512 KB Output is correct
19 Incorrect 1 ms 512 KB Output isn't correct
20 Correct 1 ms 512 KB Output is correct
21 Incorrect 1 ms 512 KB Output isn't correct
22 Correct 1 ms 512 KB Output is correct
23 Incorrect 1 ms 640 KB Output isn't correct
24 Correct 1 ms 640 KB Output is correct
25 Incorrect 1 ms 640 KB Output isn't correct
26 Correct 1 ms 640 KB Output is correct
27 Incorrect 1 ms 768 KB Output isn't correct
28 Correct 1 ms 768 KB Output is correct
29 Incorrect 1 ms 768 KB Output isn't correct
30 Correct 1 ms 768 KB Output is correct
31 Incorrect 1 ms 768 KB Output isn't correct
32 Correct 2 ms 768 KB Output is correct
33 Incorrect 24 ms 2432 KB Output isn't correct
34 Correct 25 ms 2432 KB Output is correct
35 Correct 36 ms 2432 KB Output is correct
36 Incorrect 35 ms 2688 KB Output isn't correct
37 Correct 34 ms 2688 KB Output is correct
38 Correct 48 ms 2688 KB Output is correct
39 Incorrect 42 ms 3072 KB Output isn't correct
40 Correct 42 ms 3072 KB Output is correct
41 Correct 65 ms 3092 KB Output is correct
42 Incorrect 52 ms 3328 KB Output isn't correct
43 Correct 54 ms 3328 KB Output is correct
44 Correct 80 ms 3388 KB Output is correct
45 Incorrect 67 ms 3584 KB Output isn't correct
46 Correct 67 ms 3696 KB Output is correct
47 Correct 104 ms 3584 KB Output is correct
48 Incorrect 78 ms 4096 KB Output isn't correct
49 Correct 80 ms 4088 KB Output is correct
50 Correct 112 ms 3968 KB Output is correct
51 Incorrect 93 ms 4224 KB Output isn't correct
52 Correct 95 ms 4224 KB Output is correct
53 Correct 146 ms 4224 KB Output is correct
54 Incorrect 107 ms 4480 KB Output isn't correct
55 Correct 107 ms 4588 KB Output is correct
56 Correct 164 ms 4480 KB Output is correct
57 Incorrect 123 ms 4864 KB Output isn't correct
58 Correct 121 ms 4992 KB Output is correct
59 Correct 196 ms 4864 KB Output is correct
60 Incorrect 145 ms 5120 KB Output isn't correct
61 Correct 138 ms 5240 KB Output is correct
62 Correct 225 ms 5120 KB Output is correct
63 Correct 253 ms 5244 KB Output is correct
64 Correct 297 ms 5196 KB Output is correct
65 Correct 247 ms 5120 KB Output is correct
66 Incorrect 289 ms 5240 KB Output isn't correct
67 Correct 250 ms 5248 KB Output is correct
68 Correct 268 ms 5236 KB Output is correct
69 Correct 249 ms 5240 KB Output is correct
70 Correct 255 ms 5240 KB Output is correct
71 Correct 284 ms 5368 KB Output is correct
72 Incorrect 307 ms 5240 KB Output isn't correct
73 Incorrect 363 ms 5724 KB Output isn't correct
74 Correct 336 ms 5688 KB Output is correct
75 Correct 364 ms 5704 KB Output is correct
76 Correct 358 ms 5624 KB Output is correct
77 Correct 346 ms 5648 KB Output is correct
78 Correct 323 ms 5720 KB Output is correct
79 Correct 318 ms 5540 KB Output is correct
80 Correct 332 ms 5680 KB Output is correct
81 Correct 327 ms 5552 KB Output is correct
82 Correct 351 ms 5804 KB Output is correct
83 Correct 415 ms 5580 KB Output is correct
84 Correct 344 ms 5712 KB Output is correct
85 Correct 345 ms 5504 KB Output is correct
86 Correct 329 ms 5496 KB Output is correct
87 Correct 335 ms 5600 KB Output is correct
88 Correct 317 ms 5444 KB Output is correct
89 Correct 317 ms 5588 KB Output is correct
90 Correct 316 ms 5540 KB Output is correct
91 Correct 327 ms 5428 KB Output is correct
92 Correct 346 ms 5420 KB Output is correct