oj.uz

답안 #341025

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341025 2020-12-28T22:24:49 Z peuch Mecho (IOI09_mecho) C++17
84 / 100
 256 ms 11048 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] = 0;
	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(temp + (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
84.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 Correct 218 ms 10832 KB Output is 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 2 ms 1004 KB Output is correct
24 Correct 1 ms 1004 KB Output is correct
25 Correct 1 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 2 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 Correct 19 ms 4844 KB Output is correct
35 Correct 40 ms 4844 KB Output is correct
36 Correct 20 ms 5484 KB Output is correct
37 Correct 21 ms 5484 KB Output is correct
38 Correct 55 ms 5540 KB Output is correct
39 Correct 27 ms 6124 KB Output is correct
40 Correct 26 ms 6124 KB Output is correct
41 Correct 71 ms 6252 KB Output is correct
42 Correct 31 ms 6764 KB Output is correct
43 Correct 34 ms 6764 KB Output is correct
44 Correct 83 ms 6764 KB Output is correct
45 Correct 39 ms 7404 KB Output is correct
46 Correct 39 ms 7404 KB Output is correct
47 Correct 109 ms 7532 KB Output is correct
48 Correct 48 ms 8044 KB Output is correct
49 Correct 46 ms 8044 KB Output is correct
50 Correct 139 ms 8044 KB Output is correct
51 Correct 58 ms 8684 KB Output is correct
52 Correct 53 ms 8684 KB Output is correct
53 Correct 158 ms 8940 KB Output is correct
54 Correct 60 ms 9324 KB Output is correct
55 Correct 66 ms 9452 KB Output is correct
56 Correct 236 ms 9324 KB Output is correct
57 Correct 69 ms 9964 KB Output is correct
58 Correct 71 ms 9964 KB Output is correct
59 Correct 211 ms 9964 KB Output is correct
60 Correct 76 ms 10604 KB Output is correct
61 Correct 81 ms 10732 KB Output is correct
62 Correct 256 ms 10604 KB Output is correct
63 Correct 164 ms 10604 KB Output is correct
64 Correct 228 ms 10604 KB Output is correct
65 Correct 252 ms 10696 KB Output is correct
66 Correct 209 ms 10628 KB Output is correct
67 Correct 72 ms 10604 KB Output is correct
68 Correct 107 ms 10604 KB Output is correct
69 Correct 120 ms 10604 KB Output is correct
70 Correct 106 ms 10732 KB Output is correct
71 Correct 105 ms 10700 KB Output is correct
72 Incorrect 102 ms 10604 KB Output isn't correct
73 Incorrect 120 ms 10952 KB Output isn't correct
74 Correct 162 ms 10860 KB Output is correct
75 Correct 161 ms 10860 KB Output is correct
76 Correct 156 ms 10988 KB Output is correct
77 Correct 167 ms 10860 KB Output is correct
78 Correct 73 ms 10860 KB Output is correct
79 Correct 161 ms 10988 KB Output is correct
80 Correct 163 ms 10860 KB Output is correct
81 Correct 168 ms 10860 KB Output is correct
82 Correct 144 ms 10860 KB Output is correct
83 Correct 166 ms 10860 KB Output is correct
84 Correct 193 ms 10888 KB Output is correct
85 Correct 158 ms 10860 KB Output is correct
86 Correct 177 ms 11048 KB Output is correct
87 Correct 190 ms 10888 KB Output is correct
88 Correct 165 ms 10988 KB Output is correct
89 Correct 201 ms 10732 KB Output is correct
90 Correct 192 ms 10860 KB Output is correct
91 Correct 195 ms 10732 KB Output is correct
92 Correct 192 ms 10732 KB Output is correct