Submission #162809
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
bool mp[50][50];
int r,c,sx,sy,gx,gy;
int cost[50][50];
int dx[] = {1,0,-1,0},dy[] = {0,1,0,-1};
int tansaku(){
queue<pair<int,int> > P;
P.push(pair<int,int>(sx,sy));
for(;!P.empty();){
pair<int,int> pp;
pp = P.front();
for(int j=0;j<4;j++){
int nx,ny;
nx = pp.first + dx[j];
ny = pp.second + dy[j];
if(0 <= nx && nx < c && 0 <= ny && ny < r
&& mp[ny][nx]){
cost[ny][nx] = cost[pp.second][pp.first] + 1;
P.push(pair<int,int>(nx,ny));
mp[ny][nx] = false;
}
}
P.pop();
}
return cost[gy][gx];
}
int main(){
scanf("%d %d %d %d %d %d",&r,&c,&sy,&sx,&gy,&gx);
sy--;sx--;gx--;gy--;
for(int i=0;i<r;i++){
char s[50];
scanf("%s",s);
for(int j=0;j<c;j++){
if(s[j] == '.')
mp[i][j] = true;
}
}
printf("%d\n",tansaku());
// for(int i=0;i<r;i++){
// for(int j=0;j<c;j++){
// printf("%2d ",cost[i][j]);
// }
// printf("\n");
// }
return 0;
}
Submission Info
Submission Time
2014-04-19 22:26:47+0900
Task
C - 幅優先探索
User
keito17
Language
C++ (G++ 4.6.4)
Score
100
Code Size
1301 Byte
Status
AC
Exec Time
27 ms
Memory
924 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:37:53: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:41:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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
916 KB
subtask0_sample02.txt
AC
21 ms
920 KB
subtask0_sample03.txt
AC
21 ms
840 KB
subtask1_01.txt
AC
21 ms
924 KB
subtask1_02.txt
AC
22 ms
920 KB
subtask1_03.txt
AC
21 ms
920 KB
subtask1_04.txt
AC
22 ms
924 KB
subtask1_05.txt
AC
21 ms
916 KB
subtask1_06.txt
AC
21 ms
924 KB
subtask1_07.txt
AC
23 ms
812 KB
subtask1_08.txt
AC
21 ms
920 KB
subtask1_09.txt
AC
21 ms
920 KB
subtask1_10.txt
AC
22 ms
920 KB
subtask1_11.txt
AC
21 ms
920 KB
subtask1_12.txt
AC
22 ms
920 KB
subtask1_13.txt
AC
22 ms
812 KB
subtask1_14.txt
AC
21 ms
912 KB
subtask1_15.txt
AC
22 ms
916 KB
subtask1_16.txt
AC
23 ms
920 KB
subtask1_17.txt
AC
20 ms
916 KB
subtask1_18.txt
AC
27 ms
924 KB
subtask1_19.txt
AC
20 ms
912 KB
subtask1_20.txt
AC
23 ms
916 KB
subtask1_21.txt
AC
21 ms
920 KB
subtask1_22.txt
AC
21 ms
916 KB