Submission #4489566


Source Code Expand

#include <bits/stdc++.h>

#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()

using namespace std;
using ll = long long;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> P;
 
const int INF = 1e9;
//const ll INF = 1e18;
const double EPS = 1e-10;
const int MOD = 1e9+7;
const double PI = acos(-1.0);

const int x4[] = {1,0,-1,0}, y4[] = {0,-1,0,1};
const int x8[] = {1,1,1,0,-1,-1,-1,0}, y8[] = {1,0,-1,-1,-1,0,1,1};


int main()
{
	int h,w;
	cin >> h >> w;
	int sy,sx,gy,gx;
	cin >> sy >> sx >> gy >> gx;
	sy--,sx--,gy--,gx--;
	char c[h][w];
	rep(i,h) rep(j,w) cin >> c[i][j];
	int d[h][w]; //�X�^�[�g����̍ŒZ����
	for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) d[i][j] = INF;
	queue<P> que; que.push(P(sx,sy)); d[sy][sx] = 0;
	while(que.size()){
		P p = que.front(); que.pop();
		for(int i = 0; i < 4/*4,8*/; i++){
			int nx = p.first + x4[i]/*4,8*/,ny = p.second + y4[i]/*4,8*/;
			if(nx < 0 || w <= nx || ny < 0 || h <= ny) continue;
			if(d[ny][nx] != INF || c[ny][nx] == '#') continue;
			que.push(P(nx,ny)); d[ny][nx] = d[p.second][p.first]+1;
		}
	}
	cout << d[gy][gx] << endl;

    return 0;
}

Submission Info

Submission Time
Task A - 幅優先探索
User sai2o
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1379 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 25
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
All subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 1 ms 256 KB
subtask0_sample02.txt AC 1 ms 256 KB
subtask0_sample03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask1_15.txt AC 1 ms 256 KB
subtask1_16.txt AC 1 ms 256 KB
subtask1_17.txt AC 1 ms 256 KB
subtask1_18.txt AC 1 ms 256 KB
subtask1_19.txt AC 1 ms 256 KB
subtask1_20.txt AC 1 ms 256 KB
subtask1_21.txt AC 1 ms 256 KB
subtask1_22.txt AC 1 ms 256 KB