Submission #3790947
Source Code Expand
#include <bits/stdc++.h>
#define int long long
#define INF 1000000007
#define SMO -1000000007
#define P pair<int,int>
using namespace std;
bool prime(int n){
for(int i=2;i<=sqrt(n);i++){
if(n%i==0)return false;
}
return n!=1;
}
int kaicnt;
int kai(int n,int x){
kaicnt++;
if(kaicnt==x){
kaicnt=0;
return n%INF;
}
return (kai(n-1,x)%INF*n)%INF;
}
int conbi(int n,int x){
x=min(x,n-x+1);
return kai(n,x)/kai(x,x);
}
int pow_mod(int n,int k,int m){
if(k==0)return 1;
else if(k%2==1)return pow_mod(n,k-1,m)*n%m;
else {
int t=pow_mod(n,k/2,m);
return t*t%m;
}
}
int l,m,sx,sy,gx,gy;
int hox[5]={0,1,0,-1},hoy[5]={1,0,-1,0};
char c[105][105];
int d[105][105];
int bfs(){
queue<P>que;
que.push({sx,sy});
for(int i=1;i<=l;i++){
for(int j=1;j<=m;j++)d[i][j]=INF;
}
d[sx][sy]=0;
while(!que.empty()){
P p=que.front();
que.pop();
if(p.first==gx&&p.second==gy)break;
for(int i=0;i<4;i++){
int nx=p.first+hox[i],ny=p.second+hoy[i];
if(nx<=l&&nx>0&&ny<=m&&ny>0&&d[nx][ny]==INF&&c[nx][ny]!='#'){
que.push({nx,ny});
d[nx][ny]=d[p.first][p.second]+1;
}
}
}
return d[gx][gy];
}
signed main(){
cin>>l>>m>>sx>>sy>>gx>>gy;
for(int i=1;i<=l;i++){
for(int j=1;j<=m;j++)cin>>c[i][j];
}
cout<<bfs()<<endl;
}
Submission Info
Submission Time |
|
Task |
C - 幅優先探索 |
User |
define |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1311 Byte |
Status |
AC |
Exec Time |
2 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 |
2 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 |