oj.uz

답안 #341023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341023 2020-12-28T22:23:51 Z peuch Mecho (IOI09_mecho) C++17
38 / 100
 735 ms 10988 KB 
#include<bits/stdc++.h>
using namespace std;
 
const int MAXN = 1010;
 
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
 
int n, s;
int hx, hy;
int mx, my;
char grid[MAXN][MAXN];
int beeDist[MAXN][MAXN];
int marc[MAXN][MAXN];
int dist[MAXN][MAXN];
 
void preCalc();
bool test(int temp);
int bb();
 
int main(){
	scanf("%d %d", &n, &s);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			scanf(" %c", &grid[i][j]);
			if(grid[i][j] == 'D') hx = i, hy = j;
			if(grid[i][j] == 'M') mx = i, my = j;
		}
	}
	preCalc();
	printf("%d\n", bb());
}
 
void preCalc(){
	queue<int> fila;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			if(grid[i][j] != 'H') beeDist[i][j] = 1e8;
			else{
				marc[i][j] = 1;
				fila.push(i);
				fila.push(j);
			}
		}
	}
	while(!fila.empty()){
		int curx = fila.front();
		fila.pop();
		int cury = fila.front();
		fila.pop();
		for(int i = 0; i < 4; i++){
			int vizx = curx + dx[i];
			int vizy = cury + dy[i];
			if(vizx <= 0 || vizx > n) continue;
			if(vizy <= 0 || vizy > n) continue;
			if(grid[vizx][vizy] == 'T') continue;
			if(grid[vizx][vizy] == 'D') continue;
			if(marc[vizx][vizy]) continue;
			marc[vizx][vizy] = 1;
			beeDist[vizx][vizy] = beeDist[curx][cury] + 1;
			fila.push(vizx);
			fila.push(vizy);
		}
	}
}
 
bool test(int temp){
	queue<int> fila;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			marc[i][j] = 0;
			dist[i][j] = 0;
		}
	}
	fila.push(mx);
	fila.push(my);
	marc[mx][my] = 1;
	dist[mx][my] = temp * s;
	while(!fila.empty()){
		int curx = fila.front();
		fila.pop();
		int cury = fila.front();
		fila.pop();
		for(int i = 0; i < 4; i++){
			int vizx = curx + dx[i];
			int vizy = cury + dy[i];
			if(vizx <= 0 || vizx > n) continue;
			if(vizy <= 0 || vizy > n) continue;
			if(grid[vizx][vizy] == 'T') continue;
			if((dist[curx][cury] + 1) / s >= beeDist[vizx][vizy]) continue;
			if(marc[vizx][vizy]) continue;
			marc[vizx][vizy] = 1;
			dist[vizx][vizy] = dist[curx][cury] + 1;
			fila.push(vizx);
			fila.push(vizy);
		}
	}
	return marc[hx][hy];
}
 
int bb(){
	int ini = 0, fim = 1e8 + 10;
	if(!test(ini)) return -1;
	while(ini != fim){
		int mid = (ini + fim) >> 1;
		if(ini == fim - 1) mid = fim;
		if(test(mid)) ini = mid;
		else fim = mid - 1;
	}
	return ini;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   22 |  scanf("%d %d", &n, &s);
      |  ~~~~~^~~~~~~~~~~~~~~~~
mecho.cpp:25:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |    scanf(" %c", &grid[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Incorrect 735 ms 10860 KB Output isn't correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Incorrect 1 ms 1132 KB Output isn't correct
13 Incorrect 2 ms 1004 KB Output isn't correct
14 Correct 1 ms 1132 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 1 ms 620 KB Output is correct
18 Correct 1 ms 620 KB Output is correct
19 Correct 1 ms 748 KB Output is correct
20 Correct 1 ms 748 KB Output is correct
21 Correct 1 ms 876 KB Output is correct
22 Correct 1 ms 876 KB Output is correct
23 Correct 1 ms 1004 KB Output is correct
24 Correct 1 ms 1004 KB Output is correct
25 Correct 2 ms 1132 KB Output is correct
26 Correct 1 ms 1132 KB Output is correct
27 Correct 1 ms 1132 KB Output is correct
28 Correct 1 ms 1132 KB Output is correct
29 Correct 2 ms 1260 KB Output is correct
30 Correct 2 ms 1260 KB Output is correct
31 Correct 2 ms 1260 KB Output is correct
32 Correct 2 ms 1260 KB Output is correct
33 Correct 16 ms 4844 KB Output is correct
34 Incorrect 24 ms 4844 KB Output isn't correct
35 Incorrect 70 ms 4844 KB Output isn't correct
36 Correct 20 ms 5484 KB Output is correct
37 Incorrect 32 ms 5484 KB Output isn't correct
38 Incorrect 109 ms 5616 KB Output isn't correct
39 Correct 25 ms 6124 KB Output is correct
40 Incorrect 43 ms 6124 KB Output isn't correct
41 Incorrect 116 ms 6252 KB Output isn't correct
42 Correct 31 ms 6764 KB Output is correct
43 Incorrect 51 ms 6764 KB Output isn't correct
44 Incorrect 163 ms 6892 KB Output isn't correct
45 Correct 36 ms 7404 KB Output is correct
46 Incorrect 62 ms 7404 KB Output isn't correct
47 Incorrect 233 ms 7404 KB Output isn't correct
48 Correct 44 ms 8044 KB Output is correct
49 Incorrect 62 ms 8044 KB Output isn't correct
50 Incorrect 246 ms 8044 KB Output isn't correct
51 Correct 50 ms 8684 KB Output is correct
52 Incorrect 79 ms 8684 KB Output isn't correct
53 Incorrect 281 ms 8812 KB Output isn't correct
54 Correct 59 ms 9324 KB Output is correct
55 Incorrect 90 ms 9324 KB Output isn't correct
56 Incorrect 320 ms 9324 KB Output isn't correct
57 Correct 69 ms 9964 KB Output is correct
58 Incorrect 96 ms 10092 KB Output isn't correct
59 Incorrect 380 ms 10092 KB Output isn't correct
60 Correct 75 ms 10604 KB Output is correct
61 Incorrect 123 ms 10604 KB Output isn't correct
62 Incorrect 503 ms 10732 KB Output isn't correct
63 Correct 160 ms 10732 KB Output is correct
64 Incorrect 465 ms 10732 KB Output isn't correct
65 Correct 248 ms 10732 KB Output is correct
66 Correct 208 ms 10604 KB Output is correct
67 Correct 75 ms 10604 KB Output is correct
68 Correct 107 ms 10604 KB Output is correct
69 Incorrect 358 ms 10732 KB Output isn't correct
70 Correct 102 ms 10604 KB Output is correct
71 Correct 100 ms 10604 KB Output is correct
72 Incorrect 248 ms 10604 KB Output isn't correct
73 Incorrect 122 ms 10860 KB Output isn't correct
74 Incorrect 424 ms 10988 KB Output isn't correct
75 Correct 152 ms 10860 KB Output is correct
76 Correct 149 ms 10860 KB Output is correct
77 Correct 162 ms 10860 KB Output is correct
78 Correct 73 ms 10988 KB Output is correct
79 Incorrect 438 ms 10988 KB Output isn't correct
80 Correct 156 ms 10860 KB Output is correct
81 Correct 165 ms 10860 KB Output is correct
82 Correct 144 ms 10832 KB Output is correct
83 Correct 156 ms 10860 KB Output is correct
84 Incorrect 567 ms 10860 KB Output isn't correct
85 Correct 156 ms 10860 KB Output is correct
86 Correct 166 ms 10988 KB Output is correct
87 Incorrect 483 ms 10916 KB Output isn't correct
88 Correct 171 ms 10860 KB Output is correct
89 Incorrect 492 ms 10836 KB Output isn't correct
90 Incorrect 473 ms 10836 KB Output isn't correct
91 Incorrect 505 ms 10940 KB Output isn't correct
92 Correct 190 ms 10732 KB Output is correct