oj.uz

Submission #281930

# Submission time Handle Problem Language Result Execution time Memory
281930 2020-08-23T15:55:48 Z Plurm Mecho (IOI09_mecho) C++11
41 / 100
 429 ms 5992 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;
	while((!mq.empty() || !q.empty()) && test[dx][dy] != 'M'){
		lm += s;
		propagateMecho(mq, lm);
		if(test[dx][dy] == 'M') return true;
		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 '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:93:50: warning: 'dy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   93 |  while((!mq.empty() || !q.empty()) && test[dx][dy] != 'M'){
      |                                       ~~~~~~~~~~~^
mecho.cpp:93:50: warning: 'dx' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
41.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Incorrect 1 ms 384 KB Output isn't correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 351 ms 5632 KB Output is correct
8 Incorrect 1 ms 416 KB Output isn't correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Incorrect 1 ms 640 KB Output isn't 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 512 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 2 ms 768 KB Output isn't correct
30 Correct 2 ms 768 KB Output is correct
31 Incorrect 2 ms 768 KB Output isn't correct
32 Correct 2 ms 768 KB Output is correct
33 Incorrect 24 ms 2560 KB Output isn't correct
34 Correct 25 ms 2560 KB Output is correct
35 Correct 46 ms 2560 KB Output is correct
36 Incorrect 36 ms 2888 KB Output isn't correct
37 Correct 35 ms 2816 KB Output is correct
38 Correct 61 ms 2816 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 76 ms 3072 KB Output is correct
42 Incorrect 51 ms 3456 KB Output isn't correct
43 Correct 52 ms 3456 KB Output is correct
44 Correct 105 ms 3456 KB Output is correct
45 Incorrect 68 ms 3712 KB Output isn't correct
46 Correct 63 ms 3832 KB Output is correct
47 Correct 117 ms 3712 KB Output is correct
48 Incorrect 87 ms 4088 KB Output isn't correct
49 Correct 78 ms 3968 KB Output is correct
50 Correct 144 ms 4060 KB Output is correct
51 Incorrect 91 ms 4352 KB Output isn't correct
52 Correct 92 ms 4352 KB Output is correct
53 Correct 170 ms 4352 KB Output is correct
54 Incorrect 106 ms 4608 KB Output isn't correct
55 Correct 106 ms 4608 KB Output is correct
56 Correct 200 ms 4608 KB Output is correct
57 Incorrect 121 ms 5112 KB Output isn't correct
58 Correct 121 ms 4992 KB Output is correct
59 Correct 237 ms 5240 KB Output is correct
60 Incorrect 149 ms 5376 KB Output isn't correct
61 Correct 140 ms 5368 KB Output is correct
62 Correct 274 ms 5376 KB Output is correct
63 Correct 313 ms 5528 KB Output is correct
64 Correct 304 ms 5376 KB Output is correct
65 Correct 306 ms 5376 KB Output is correct
66 Correct 324 ms 5496 KB Output is correct
67 Correct 303 ms 5372 KB Output is correct
68 Correct 338 ms 5496 KB Output is correct
69 Correct 288 ms 5412 KB Output is correct
70 Correct 307 ms 5496 KB Output is correct
71 Correct 328 ms 5496 KB Output is correct
72 Incorrect 320 ms 5500 KB Output isn't correct
73 Incorrect 394 ms 5788 KB Output isn't correct
74 Correct 362 ms 5992 KB Output is correct
75 Correct 398 ms 5844 KB Output is correct
76 Correct 373 ms 5852 KB Output is correct
77 Correct 377 ms 5908 KB Output is correct
78 Correct 365 ms 5888 KB Output is correct
79 Correct 357 ms 5808 KB Output is correct
80 Correct 345 ms 5736 KB Output is correct
81 Correct 357 ms 5736 KB Output is correct
82 Correct 355 ms 5736 KB Output is correct
83 Correct 385 ms 5960 KB Output is correct
84 Correct 355 ms 5892 KB Output is correct
85 Correct 386 ms 5876 KB Output is correct
86 Correct 402 ms 5924 KB Output is correct
87 Correct 370 ms 5932 KB Output is correct
88 Correct 429 ms 5844 KB Output is correct
89 Correct 346 ms 5872 KB Output is correct
90 Correct 342 ms 5896 KB Output is correct
91 Correct 336 ms 5824 KB Output is correct
92 Correct 373 ms 5960 KB Output is correct