Submission #691662
Source Code Expand
#include <stdio.h>
int R, C;
int sy, sx;
int gy, gx;
int field[51][51] = {0};
int dx[4] = {0, 1, 0, -1};
int dy[4] = {-1, 0, 1, 0};
void explore(int cx, int cy, int depth){
field[cy][cx] = depth;
if(field[gy][gx] > 0){
return;
}
for(int i=0; i<4; i++){
if(field[cy + dy[i]][cx + dx[i]] < 0){
explore(cx + dx[i], cy + dy[i], depth + 1);
}
}
}
int search(){
int m = 0;
for(int y=0; y<R; y++){
for(int x=0; x<C; x++){
if(field[y][x] > m){
m = field[y][x];
}
}
}
return m;
}
int main(){
scanf("%d %d", &R, &C);
scanf("%d %d", &sy, &sx);
scanf("%d %d", &gy, &gx);
sx--; sy--; gx--; gy--;
char line[55];
for(int y=0; y<R; y++){
scanf("%s", line);
for(int x=0; x<C; x++){
if(line[x] == '.'){
field[y][x] = -1;
}
else{
field[y][x] = 0;
}
}
}
explore(sx, sy, 1);
int result = field[gy][gx] - 1;
printf("%d\n", result);
return 0;
}
Submission Info
Submission Time
2016-04-10 21:56:17+0900
Task
A - 幅優先探索
User
elnikkis
Language
C (GCC 5.4.1)
Score
0
Code Size
1161 Byte
Status
WA
Exec Time
3 ms
Memory
256 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:35:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &R, &C);
^
./Main.c:36:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &sy, &sx);
^
./Main.c:37:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &gy, &gx);
^
./Main.c:42:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", line);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
2 ms
128 KB
subtask0_sample02.txt
AC
2 ms
128 KB
subtask0_sample03.txt
AC
3 ms
128 KB
subtask1_01.txt
AC
2 ms
256 KB
subtask1_02.txt
AC
2 ms
256 KB
subtask1_03.txt
AC
2 ms
128 KB
subtask1_04.txt
AC
2 ms
128 KB
subtask1_05.txt
WA
2 ms
256 KB
subtask1_06.txt
WA
2 ms
256 KB
subtask1_07.txt
AC
2 ms
128 KB
subtask1_08.txt
AC
2 ms
128 KB
subtask1_09.txt
WA
2 ms
128 KB
subtask1_10.txt
WA
2 ms
128 KB
subtask1_11.txt
WA
2 ms
128 KB
subtask1_12.txt
WA
2 ms
128 KB
subtask1_13.txt
WA
2 ms
128 KB
subtask1_14.txt
AC
2 ms
128 KB
subtask1_15.txt
WA
2 ms
128 KB
subtask1_16.txt
WA
2 ms
128 KB
subtask1_17.txt
WA
2 ms
128 KB
subtask1_18.txt
WA
2 ms
128 KB
subtask1_19.txt
WA
2 ms
128 KB
subtask1_20.txt
WA
2 ms
256 KB
subtask1_21.txt
AC
2 ms
256 KB
subtask1_22.txt
WA
2 ms
256 KB