oj.uz

답안 #341024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341024 2020-12-28T22:24:37 Z peuch Mecho (IOI09_mecho) C++17
38 / 100
 305 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] = 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] + s) / 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 Incorrect 1 ms 364 KB Output isn't correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 221 ms 10860 KB Output is correct
8 Incorrect 1 ms 492 KB Output isn't 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 1 ms 1004 KB Output isn't correct
14 Correct 1 ms 1132 KB Output is correct
15 Incorrect 1 ms 620 KB Output isn't correct
16 Correct 1 ms 620 KB Output is correct
17 Incorrect 1 ms 620 KB Output isn't correct
18 Correct 1 ms 620 KB Output is correct
19 Incorrect 1 ms 748 KB Output isn't correct
20 Correct 1 ms 748 KB Output is correct
21 Incorrect 1 ms 876 KB Output isn't correct
22 Correct 2 ms 876 KB Output is correct
23 Incorrect 1 ms 1004 KB Output isn't correct
24 Correct 1 ms 1004 KB Output is correct
25 Incorrect 1 ms 1132 KB Output isn't correct
26 Correct 1 ms 1132 KB Output is correct
27 Incorrect 1 ms 1132 KB Output isn't correct
28 Correct 1 ms 1132 KB Output is correct
29 Incorrect 2 ms 1280 KB Output isn't correct
30 Correct 2 ms 1260 KB Output is correct
31 Incorrect 2 ms 1260 KB Output isn't correct
32 Correct 2 ms 1260 KB Output is correct
33 Incorrect 16 ms 4844 KB Output isn't correct
34 Correct 17 ms 4972 KB Output is correct
35 Correct 37 ms 4844 KB Output is correct
36 Incorrect 22 ms 5484 KB Output isn't correct
37 Correct 21 ms 5484 KB Output is correct
38 Correct 51 ms 5484 KB Output is correct
39 Incorrect 24 ms 6252 KB Output isn't correct
40 Correct 33 ms 6252 KB Output is correct
41 Correct 64 ms 6124 KB Output is correct
42 Incorrect 30 ms 6764 KB Output isn't correct
43 Correct 31 ms 6892 KB Output is correct
44 Correct 83 ms 6764 KB Output is correct
45 Incorrect 36 ms 7404 KB Output isn't correct
46 Correct 39 ms 7404 KB Output is correct
47 Correct 105 ms 7404 KB Output is correct
48 Incorrect 42 ms 8044 KB Output isn't correct
49 Correct 54 ms 8192 KB Output is correct
50 Correct 130 ms 8044 KB Output is correct
51 Incorrect 49 ms 8812 KB Output isn't correct
52 Correct 53 ms 8940 KB Output is correct
53 Correct 157 ms 8684 KB Output is correct
54 Incorrect 57 ms 9324 KB Output isn't correct
55 Correct 62 ms 9324 KB Output is correct
56 Correct 182 ms 9324 KB Output is correct
57 Incorrect 66 ms 9964 KB Output isn't correct
58 Correct 70 ms 10100 KB Output is correct
59 Correct 212 ms 9964 KB Output is correct
60 Incorrect 78 ms 10604 KB Output isn't correct
61 Correct 82 ms 10688 KB Output is correct
62 Correct 269 ms 10732 KB Output is correct
63 Correct 165 ms 10604 KB Output is correct
64 Correct 236 ms 10732 KB Output is correct
65 Correct 305 ms 10604 KB Output is correct
66 Incorrect 233 ms 10604 KB Output isn't correct
67 Correct 74 ms 10604 KB Output is correct
68 Correct 119 ms 10604 KB Output is correct
69 Correct 136 ms 10604 KB Output is correct
70 Correct 109 ms 10704 KB Output is correct
71 Correct 104 ms 10604 KB Output is correct
72 Incorrect 96 ms 10604 KB Output isn't correct
73 Incorrect 144 ms 10860 KB Output isn't correct
74 Correct 177 ms 10892 KB Output is correct
75 Correct 157 ms 10900 KB Output is correct
76 Correct 163 ms 10912 KB Output is correct
77 Correct 175 ms 10936 KB Output is correct
78 Correct 74 ms 10860 KB Output is correct
79 Correct 158 ms 10860 KB Output is correct
80 Correct 163 ms 10860 KB Output is correct
81 Correct 174 ms 10860 KB Output is correct
82 Correct 151 ms 10988 KB Output is correct
83 Correct 166 ms 10860 KB Output is correct
84 Correct 225 ms 10956 KB Output is correct
85 Correct 164 ms 10860 KB Output is correct
86 Correct 192 ms 10860 KB Output is correct
87 Correct 203 ms 10860 KB Output is correct
88 Correct 175 ms 10780 KB Output is correct
89 Correct 212 ms 10732 KB Output is correct
90 Correct 195 ms 10860 KB Output is correct
91 Correct 232 ms 10860 KB Output is correct
92 Correct 192 ms 10732 KB Output is correct