Submission #1780081
Source Code Expand
#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cmath>
using namespace std;
#define all(c) c.begin(),c.end()
#define repeat(i,n) for(int i=0;i<static_cast<int>(n);i++)
#define debug(x) #x << "=" << (x)
#define dump(x) cerr << debug(x) << " (L:" << __LINE__ << ")"<< endl
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<string> vs;
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec){
os << "[";
for(int i = 0; i < vec.size(); i++){
os << vec[i] << ",";
}
os << "]";
return os;
}
template<typename T>
T input(){
T t;
cin >> t;
return t;
}
template<typename T>
vector<T> input(const int N){
vector<T> v(N);
repeat(i,N) cin >> v[i];
return v;
}
long long gcd(long long a, long long b){
if(b == 0){
return a;
}
return gcd(b, a % b);
}
long long lcm(long long a, long long b){
return (a / gcd(a, b)) * b;
}
long long mul(const long long& a, const long long& b, const long long& mod) {
return ((a % mod) * (b % mod)) % mod;
}
long long power(const long long& x, const long long& y, const long long& mod) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % mod;
} else {
long long value = power(x, y / 2, mod);
if (y % 2 == 0) {
return mul(value, value, mod);
} else {
return mul(value, value, mod) * x % mod;
}
}
}
long long div(const long long& a, const long long& b, const long long& mod) {
return mul(a, power(b, mod - 2, mod), mod);
}
map<long long, long long> factorials;
long long factorial(const long long& n, const long long& mod) {
if (n == 0 || n == 1) {
return 1;
}
if (factorials[n] != 0) {
return factorials[n];
}
factorials[n] = n * factorial(n - 1, mod) % mod;
return factorials[n] % mod;
}
long long combination(const long long& n, const long long& x, const long long& mod) {
long long numerator = 1;
long long denominator = 1;
repeat(i, x) {
numerator *= (n - i) % mod;
numerator %= mod;
denominator *= (i + 1) % mod;
denominator %= mod;
}
return div(numerator, denominator, mod);
}
struct Node {
int x;
int y;
int steps;
Node(int _x, int _y, int _steps) {
x = _x;
y = _y;
steps = _steps;
}
};
int searchShortestStep(const vs& field,
vvi& visited,
const int& cx, const int& cy,
const int& gx, const int& gy) {
int shortest = 0;
queue<Node> bfsQueue;
Node node(cx, cy, 0);
bfsQueue.push(node);
while (!bfsQueue.empty()) {
Node current = bfsQueue.front();
bfsQueue.pop();
if (current.x == gx && current.y == gy) {
shortest = current.steps;
break;
}
if (current.x < 0 || field[0].size() < current.x
|| current.y < 0 || field.size() < current.y) {
continue;
}
if (field[current.y][current.x] == '#') {
continue;
}
if (visited[current.y][current.x] == 1) {
continue;
}
visited[current.y][current.x] = 1;
bfsQueue.push(Node(current.x + 1, current.y, current.steps + 1));
bfsQueue.push(Node(current.x - 1, current.y, current.steps + 1));
bfsQueue.push(Node(current.x, current.y + 1, current.steps + 1));
bfsQueue.push(Node(current.x, current.y - 1, current.steps + 1));
}
return shortest;
}
int main() {
int rows, columns;
cin >> rows >> columns;
int sx, sy, gx, gy;
cin >> sy >> sx;
cin >> gy >> gx;
vs field(rows);
string row;
repeat(i, rows) {
cin >> row;
field[i] = row;
}
vvi visited(rows, vi(columns, -1));
cout << searchShortestStep(field, visited, sx - 1, sy - 1, gx - 1, gy - 1) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 幅優先探索 |
User |
xeonics |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
4280 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
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 |