Submission #2525104


Source Code Expand

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;

struct point{
	int x; int y;
};

deque<point> deq;
int map[505][505], dist[505][505];

void check(int x) {
	if (x <= 2) {
		cout << "YES" << endl;
	}
	else { cout << "NO" << endl; }
}

int dx[4] = { 0,-1,0,1 };
int dy[4] = { 1,0,-1,0 };
int main() {
	int h, w;
	cin >> h >> w;
	point start, goal;
	for (int j = 1; j <= h; j++) {
		for (int i = 1; i <= w; i++) {
			char c;
			cin >> c;
			if (c == '.') {
				map[i][j] = 0;
			}
			else if (c == '#') {
				map[i][j] = 1;
			}
			else if (c == 's') {
				start = { i,j };
			}
			else {
				goal = { i,j };
			}
		}
	}
	for (int i = 0; i <= w + 1; i++) {
		dist[i][0] = dist[i][h + 1] = 1000000;
	}
	for (int j = 0; j <= h + 1; j++) {
		dist[0][j] = dist[w + 1][j] = 1000000;
	}
	for (int i = 1; i <= w; i++) {
		for (int j = 1; j <= h ; j++) {
			dist[i][j] = -1;
		}
	}
	dist[start.x][start.y] = 0;
	deq.push_front(start);
	while (1) {
		point now;
		now = deq.front();
		deq.pop_front();
		int dist_now = dist[now.x][now.y];
		for (int i = 0; i < 4; i++) {
			point next = { now.x + dx[i], now.y + dy[i] };
			if (dist[next.x][next.y] != -1) {
				continue;
			}
			if (next.x == goal.x && next.y == goal.y) {
				check(dist_now);
				return 0;
			}
			if (map[next.x][next.y] == 0) {
				deq.push_front(next);
				dist[next.x][next.y] = dist_now;
			}
			else if (map[next.x][next.y] == 1) {
				deq.push_back(next);
				dist[next.x][next.y] = dist_now + 1;
			}
		}
	}
}

Submission Info

Submission Time
Task C - 器物損壊!高橋君
User nejineji
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1582 Byte
Status AC
Exec Time 22 ms
Memory 2944 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 83
Set Name Test Cases
All 00_min_01.txt, 00_min_02.txt, 00_min_03.txt, 00_min_04.txt, 00_min_05.txt, 00_min_06.txt, 00_min_07.txt, 00_min_08.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rndhard_00.txt, 02_rndhard_01.txt, 02_rndhard_02.txt, 02_rndhard_03.txt, 02_rndhard_04.txt, 02_rndhard_05.txt, 02_rndhard_06.txt, 02_rndhard_07.txt, 02_rndhard_08.txt, 02_rndhard_09.txt, 02_rndhard_10.txt, 02_rndhard_11.txt, 02_rndhard_12.txt, 02_rndhard_13.txt, 02_rndhard_14.txt, 02_rndhard_15.txt, 02_rndhard_16.txt, 02_rndhard_17.txt, 02_rndhard_18.txt, 02_rndhard_19.txt, 02_rndhard_20.txt, 02_rndhard_21.txt, 02_rndhard_22.txt, 02_rndhard_23.txt, 02_rndhard_24.txt, 02_rndhard_25.txt, 02_rndhard_26.txt, 02_rndhard_27.txt, 02_rndhard_28.txt, 02_rndhard_29.txt, 02_rndhard_30.txt, 02_rndhard_31.txt, 02_rndhard_32.txt, 02_rndhard_33.txt, 02_rndhard_34.txt, 02_rndhard_35.txt, 02_rndhard_36.txt, 02_rndhard_37.txt, 02_rndhard_38.txt, 02_rndhard_39.txt, 03_rndhardsmall_00.txt, 03_rndhardsmall_01.txt, 03_rndhardsmall_02.txt, 03_rndhardsmall_03.txt, 03_rndhardsmall_04.txt, 03_rndhardsmall_05.txt, 03_rndhardsmall_06.txt, 03_rndhardsmall_07.txt, 03_rndhardsmall_08.txt, 03_rndhardsmall_09.txt
Case Name Status Exec Time Memory
00_min_01.txt AC 1 ms 256 KB
00_min_02.txt AC 1 ms 256 KB
00_min_03.txt AC 1 ms 256 KB
00_min_04.txt AC 1 ms 256 KB
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt AC 1 ms 256 KB
00_min_07.txt AC 1 ms 256 KB
00_min_08.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 16 ms 2176 KB
01_rnd_01.txt AC 18 ms 2944 KB
01_rnd_02.txt AC 20 ms 2944 KB
01_rnd_03.txt AC 17 ms 2688 KB
01_rnd_04.txt AC 16 ms 2304 KB
01_rnd_05.txt AC 19 ms 2304 KB
01_rnd_06.txt AC 19 ms 2816 KB
01_rnd_07.txt AC 19 ms 2816 KB
01_rnd_08.txt AC 19 ms 2176 KB
01_rnd_09.txt AC 18 ms 2304 KB
01_rnd_10.txt AC 22 ms 2816 KB
01_rnd_11.txt AC 16 ms 2176 KB
01_rnd_12.txt AC 18 ms 2688 KB
01_rnd_13.txt AC 16 ms 2304 KB
01_rnd_14.txt AC 19 ms 2432 KB
01_rnd_15.txt AC 17 ms 2432 KB
01_rnd_16.txt AC 16 ms 2176 KB
01_rnd_17.txt AC 22 ms 2944 KB
01_rnd_18.txt AC 19 ms 2304 KB
01_rnd_19.txt AC 16 ms 2560 KB
02_rndhard_00.txt AC 18 ms 2304 KB
02_rndhard_01.txt AC 18 ms 2304 KB
02_rndhard_02.txt AC 20 ms 2560 KB
02_rndhard_03.txt AC 21 ms 2432 KB
02_rndhard_04.txt AC 17 ms 2304 KB
02_rndhard_05.txt AC 20 ms 2688 KB
02_rndhard_06.txt AC 18 ms 2432 KB
02_rndhard_07.txt AC 19 ms 2432 KB
02_rndhard_08.txt AC 18 ms 2304 KB
02_rndhard_09.txt AC 19 ms 2432 KB
02_rndhard_10.txt AC 18 ms 2304 KB
02_rndhard_11.txt AC 18 ms 2304 KB
02_rndhard_12.txt AC 17 ms 2304 KB
02_rndhard_13.txt AC 18 ms 2304 KB
02_rndhard_14.txt AC 18 ms 2432 KB
02_rndhard_15.txt AC 19 ms 2432 KB
02_rndhard_16.txt AC 21 ms 2560 KB
02_rndhard_17.txt AC 21 ms 2560 KB
02_rndhard_18.txt AC 17 ms 2304 KB
02_rndhard_19.txt AC 18 ms 2432 KB
02_rndhard_20.txt AC 18 ms 2432 KB
02_rndhard_21.txt AC 20 ms 2432 KB
02_rndhard_22.txt AC 18 ms 2304 KB
02_rndhard_23.txt AC 18 ms 2304 KB
02_rndhard_24.txt AC 19 ms 2560 KB
02_rndhard_25.txt AC 19 ms 2560 KB
02_rndhard_26.txt AC 17 ms 2304 KB
02_rndhard_27.txt AC 18 ms 2432 KB
02_rndhard_28.txt AC 17 ms 2304 KB
02_rndhard_29.txt AC 17 ms 2304 KB
02_rndhard_30.txt AC 17 ms 2176 KB
02_rndhard_31.txt AC 17 ms 2176 KB
02_rndhard_32.txt AC 19 ms 2560 KB
02_rndhard_33.txt AC 19 ms 2432 KB
02_rndhard_34.txt AC 19 ms 2560 KB
02_rndhard_35.txt AC 21 ms 2560 KB
02_rndhard_36.txt AC 18 ms 2432 KB
02_rndhard_37.txt AC 19 ms 2432 KB
02_rndhard_38.txt AC 18 ms 2432 KB
02_rndhard_39.txt AC 19 ms 2432 KB
03_rndhardsmall_00.txt AC 1 ms 256 KB
03_rndhardsmall_01.txt AC 1 ms 256 KB
03_rndhardsmall_02.txt AC 1 ms 256 KB
03_rndhardsmall_03.txt AC 1 ms 256 KB
03_rndhardsmall_04.txt AC 1 ms 256 KB
03_rndhardsmall_05.txt AC 1 ms 256 KB
03_rndhardsmall_06.txt AC 1 ms 256 KB
03_rndhardsmall_07.txt AC 1 ms 256 KB
03_rndhardsmall_08.txt AC 1 ms 256 KB
03_rndhardsmall_09.txt AC 1 ms 256 KB