oj.uz

Submission #103673

# Submission time Handle Problem Language Result Execution time Memory
103673 2019-04-02T04:00:47 Z tugushka Mecho (IOI09_mecho) C++14
44 / 100
 371 ms 66560 KB 
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
using namespace std;

using pii = pair < int, int >;
const int N = 1005;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};

char a[N][N];
pii mecho, home;
int n, s, hive[N][N];
bool used[N][N];

void hive_bfs(){
	memset( hive, 11, sizeof(hive) );
	queue < pii > q;
	for(int i = 0 ; i < n ; i++) for(int j = 0 ; j < n ; j++){
		if( a[i][j] == 'H' ){
			q.push( mp( i, j ) );
			hive[i][j] = 0;
		}
	}

	int dis = 0;
	while( !q.empty() ){
		dis += s;
		int sz = q.size();
		while( sz-- ){
			int x, y;
			tie(x, y) = q.front();
			q.pop();
			for(int i = 0 ; i < 4 ; i++){
				int tx = x+dx[i], ty = y+dy[i];
				if( tx < 0 || ty < 0 || tx >= n || ty >= n ) continue;
				if( a[tx][ty] == 'G' && hive[tx][ty] > 2e6 ){
					hive[tx][ty] = dis;
					q.push( mp( tx, ty ) );
				}
			}
		}
	}

	/*
	for(int i = 0 ; i < n ; i++){
		for(int j = 0 ; j < n ; j++){
			if( hive[i][j] > 2e6 ) printf("@@ ");
			else printf("%2d ", hive[i][j]);
		}
		printf("\n");
	}
	*/
}

bool mecho_bfs(int start_time){
	memset( used, 0, sizeof(used) );

	queue < pii > q;
	q.push( mecho );

	int dis = start_time;
	while( !q.empty() ){
		dis++;
		// cout << "dis " << dis << " : ";

		int sz = q.size();
		while( sz-- ){
			int x, y;
			tie(x, y) = q.front();
			q.pop();
			for(int i = 0 ; i < 4 ; i++){
				int tx = x+dx[i], ty = y+dy[i];
				if( tx < 0 || ty < 0 || tx >= n || ty >= n ) continue;
				if( !used[tx][ty] && a[tx][ty] == 'G' && hive[tx][ty] > dis ){
					used[tx][ty] = 1;
					// cout << "( " << tx << ',' << ty << " ), ";
					q.push( mp( tx, ty ) );
				}
			}
		}
		// cout << endl;
	}

	return used[ home.first ][ home.second ];
}

int main(){
	scanf("%d %d", &n, &s);
	for(int i = 0 ; i < n ; i++){
		scanf("%s", a[i]);
	}
	hive_bfs();
	for(int i = 0 ; i < n ; i++) for(int j = 0 ; j < n ; j++){
		if( a[i][j] == 'D' ){
			home = mp( i, j );
			a[i][j] = 'G';
		}
		if( a[i][j] == 'M' ){
			mecho = mp( i, j );
		}
	}

	if( !mecho_bfs( 0 ) ){
		printf("-1\n");
		return 0;
	}

	int l = 0, r = 10*n, res;
	while( l <= r ){
		int mid = (l+r)/2;

		if( mecho_bfs( s*(mid) ) ){
			res = mid;
			l = mid+1;
		} else {
			r = mid-1;
		}
	}

	/*
	int res = 0;
	while( mecho_bfs( s*(res+1) ) ) res++;
	*/
	cout << res << endl;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:88: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:90:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", a[i]);
   ~~~~~^~~~~~~~~~~~
mecho.cpp:124:10: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
  cout << res << endl;
          ^~~

Subtask #1
44.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5348 KB Output is correct
2 Correct 8 ms 5248 KB Output is correct
3 Correct 3 ms 5248 KB Output is correct
4 Correct 7 ms 5248 KB Output is correct
5 Correct 8 ms 5248 KB Output is correct
6 Correct 7 ms 5248 KB Output is correct
7 Correct 118 ms 6212 KB Output is correct
8 Correct 5 ms 5248 KB Output is correct
9 Correct 6 ms 5248 KB Output is correct
10 Correct 6 ms 5248 KB Output is correct
11 Correct 7 ms 5248 KB Output is correct
12 Incorrect 6 ms 5248 KB Output isn't correct
13 Incorrect 6 ms 5376 KB Output isn't correct
14 Correct 6 ms 5376 KB Output is correct
15 Correct 6 ms 5220 KB Output is correct
16 Correct 6 ms 5248 KB Output is correct
17 Incorrect 5 ms 5248 KB Output isn't correct
18 Correct 6 ms 5248 KB Output is correct
19 Incorrect 6 ms 5248 KB Output isn't correct
20 Correct 7 ms 5376 KB Output is correct
21 Incorrect 7 ms 5248 KB Output isn't correct
22 Correct 6 ms 5376 KB Output is correct
23 Incorrect 6 ms 5248 KB Output isn't correct
24 Incorrect 6 ms 5376 KB Output isn't correct
25 Incorrect 7 ms 5376 KB Output isn't correct
26 Incorrect 7 ms 5376 KB Output isn't correct
27 Incorrect 7 ms 5376 KB Output isn't correct
28 Incorrect 7 ms 5376 KB Output isn't correct
29 Incorrect 7 ms 5376 KB Output isn't correct
30 Incorrect 7 ms 5376 KB Output isn't correct
31 Incorrect 7 ms 5376 KB Output isn't correct
32 Incorrect 8 ms 5376 KB Output isn't correct
33 Incorrect 18 ms 5652 KB Output isn't correct
34 Runtime error 299 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
35 Correct 28 ms 5632 KB Output is correct
36 Incorrect 23 ms 5632 KB Output isn't correct
37 Runtime error 278 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
38 Correct 40 ms 5632 KB Output is correct
39 Incorrect 28 ms 5760 KB Output isn't correct
40 Runtime error 282 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
41 Correct 51 ms 5760 KB Output is correct
42 Incorrect 33 ms 5760 KB Output isn't correct
43 Runtime error 289 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
44 Correct 50 ms 5760 KB Output is correct
45 Incorrect 37 ms 5760 KB Output isn't correct
46 Runtime error 309 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
47 Correct 75 ms 5880 KB Output is correct
48 Incorrect 46 ms 5888 KB Output isn't correct
49 Runtime error 287 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
50 Correct 96 ms 5888 KB Output is correct
51 Incorrect 52 ms 5888 KB Output isn't correct
52 Runtime error 371 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
53 Correct 113 ms 5880 KB Output is correct
54 Incorrect 64 ms 6016 KB Output isn't correct
55 Runtime error 277 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
56 Correct 131 ms 5888 KB Output is correct
57 Incorrect 62 ms 6016 KB Output isn't correct
58 Runtime error 274 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
59 Correct 132 ms 6008 KB Output is correct
60 Incorrect 78 ms 6012 KB Output isn't correct
61 Runtime error 280 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
62 Correct 166 ms 6108 KB Output is correct
63 Correct 140 ms 6136 KB Output is correct
64 Runtime error 263 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
65 Correct 190 ms 6136 KB Output is correct
66 Correct 162 ms 6108 KB Output is correct
67 Correct 40 ms 6008 KB Output is correct
68 Correct 60 ms 6136 KB Output is correct
69 Correct 59 ms 6136 KB Output is correct
70 Correct 62 ms 6048 KB Output is correct
71 Correct 55 ms 6008 KB Output is correct
72 Incorrect 52 ms 6136 KB Output isn't correct
73 Incorrect 88 ms 6248 KB Output isn't correct
74 Correct 90 ms 6248 KB Output is correct
75 Correct 91 ms 6248 KB Output is correct
76 Correct 85 ms 6240 KB Output is correct
77 Correct 83 ms 6240 KB Output is correct
78 Correct 35 ms 6148 KB Output is correct
79 Correct 70 ms 6140 KB Output is correct
80 Correct 80 ms 6380 KB Output is correct
81 Correct 79 ms 6244 KB Output is correct
82 Correct 80 ms 6140 KB Output is correct
83 Correct 113 ms 6176 KB Output is correct
84 Correct 114 ms 6176 KB Output is correct
85 Correct 91 ms 6176 KB Output is correct
86 Correct 119 ms 6208 KB Output is correct
87 Correct 128 ms 6148 KB Output is correct
88 Correct 107 ms 6212 KB Output is correct
89 Correct 108 ms 6100 KB Output is correct
90 Correct 101 ms 6248 KB Output is correct
91 Correct 99 ms 6228 KB Output is correct
92 Correct 112 ms 6228 KB Output is correct