Submission #1337955


Source Code Expand

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
typedef long long ll;

int main()
{
	int y, x, m1[4] = { -1,1,0,0 }, m2[4] = { 0,0,-1,1 }; cin >> y >> x;
	bool retu[100][100] = { false }; 
	int sy, sx, gy, gx; cin >> sy>> sx>> gy>> gx;
	REP(i, y) {
		REP(j, x) {
			char a; cin >> a; if (a == '#') { retu[i+1][j+1] = false; }
			else { retu[i+1][j+1]=true; }
		}
	}
	int nowy , nowx , kaisuu = 0; queue<int>qy, qx;
	qy.push(sy); qx.push(sx);
	int num[100][100] = { 0 };
	while (!qy.empty()) {
		nowy = qy.front(); qy.pop(); 
		nowx = qx.front(); qx.pop();
		if (nowx == gx&&nowy == gy) {
			cout << num[nowy][nowx]<< endl; break;
		}
		for(int i=0;i<4;i++) {
			if ( retu[nowy + m1[i]][nowx + m2[i]]==true) {
				qy.push(nowy + m1[i]);
				qx.push(nowx + m2[i]);
				retu[nowy + m1[i]][nowx + m2[i]] = false;
				num[nowy + m1[i]][nowx + m2[i]] = num[nowy][nowx] + 1;
			}
		}
		kaisuu++;
	}

	/*ll retu[100], n,goukei;
	cin >> n;
	REP(i, n) {
		cin >> retu[i];
		goukei *= i + 1;
	}
	REP(i, n) {

	}*/
	return 0;
}

Submission Info

Submission Time
Task C - 幅優先探索
User keidaroo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1189 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