Submission #162142
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define pr(a) cout << (a) << endl
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000000;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
int main() {
int n,m,sx,sy,tx,ty;
cin >> n >> m >> sx >> sy >> tx >> ty;
sx--;
sy--;
tx--;
ty--;
string s[n];
rep(i,n) cin >> s[i];
int d[n][m];
rep(i,n) {
rep(j,m) d[i][j]=MAX;
}
queue<P> que;
que.push(P(sx,sy));
d[sx][sy]=0;
int ans=0;
while(!que.empty()) {
P p=que.front();
que.pop();
int nx=p.first,ny=p.second;
if(nx==tx && ny==ty) {
ans=d[nx][ny];
break;
}
rep(i,4) {
int x=nx+dx[i],y=ny+dy[i];
if(x>=0 && x<n && y>=0 && y<m) {
if(d[x][y]==MAX && s[x][y]=='.') {
d[x][y]=d[nx][ny]+1;
que.push(P(x,y));
}
}
}
}
pr(ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 幅優先探索 |
User |
s1200008 |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1150 Byte |
Status |
AC |
Exec Time |
41 ms |
Memory |
932 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 |
22 ms |
804 KB |
subtask0_sample02.txt |
AC |
21 ms |
756 KB |
subtask0_sample03.txt |
AC |
20 ms |
800 KB |
subtask1_01.txt |
AC |
22 ms |
748 KB |
subtask1_02.txt |
AC |
22 ms |
924 KB |
subtask1_03.txt |
AC |
21 ms |
748 KB |
subtask1_04.txt |
AC |
22 ms |
804 KB |
subtask1_05.txt |
AC |
21 ms |
804 KB |
subtask1_06.txt |
AC |
25 ms |
804 KB |
subtask1_07.txt |
AC |
21 ms |
800 KB |
subtask1_08.txt |
AC |
41 ms |
784 KB |
subtask1_09.txt |
AC |
22 ms |
800 KB |
subtask1_10.txt |
AC |
22 ms |
924 KB |
subtask1_11.txt |
AC |
23 ms |
808 KB |
subtask1_12.txt |
AC |
20 ms |
796 KB |
subtask1_13.txt |
AC |
20 ms |
800 KB |
subtask1_14.txt |
AC |
20 ms |
800 KB |
subtask1_15.txt |
AC |
21 ms |
932 KB |
subtask1_16.txt |
AC |
22 ms |
928 KB |
subtask1_17.txt |
AC |
20 ms |
800 KB |
subtask1_18.txt |
AC |
21 ms |
808 KB |
subtask1_19.txt |
AC |
22 ms |
804 KB |
subtask1_20.txt |
AC |
20 ms |
800 KB |
subtask1_21.txt |
AC |
22 ms |
920 KB |
subtask1_22.txt |
AC |
22 ms |
732 KB |