Submission #162941


Source Code Expand

#include <stdio.h>

typedef struct {
	int x;
	int y;
} point;

int go(int cost, point goal, point queue[], int current, int last, char board[51][51]);

int main(){
	int Y,X,sy,sx,gy,gx,i;
	char board[51][51];
	point start,goal,queue[2500];

	scanf("%d %d\n",&Y,&X);
	scanf("%d %d\n",&sy,&sx);
	start.x = sx; start.y = sy;
	scanf("%d %d\n",&gy,&gx);
	goal.x = gx ; goal.y = gy;
	for(i=0 ; i<Y ; i++){
		scanf("%s\n",&board[i][0]);
	}
	queue[0] = start;

	printf("%d\n", go(0, goal, queue, 0, 0, board));

	return 0;
}

int go(int cost, point goal, point queue[], int current, int last, char board[51][51]){
	point p,q;
	p = queue[current];
	if(p.x == goal.x && p.y == goal.y){
		return cost;
	}else{
		board[p.y][p.x] = '#';
		if(board[p.y - 1][p.x] != '#'){
			q = p;
			q.y = p.y - 1;
			queue[++last] = q;
		}
		if(board[p.y + 1][p.x] != '#'){
			q = p;
			q.y = p.y + 1;
			queue[++last] = q;
		}
		if(board[p.y][p.x - 1] != '#'){
			q = p;
			q.x = p.x - 1;
			queue[++last] = q;
		}
		if(board[p.y][p.x + 1] != '#'){
			q = p;
			q.x = p.x + 1;
			queue[++last] = q;
		}

		return go(cost+1, goal, queue, current+1, last, board);
	}
}

Submission Info

Submission Time
Task C - 幅優先探索
User NKudryavka
Language C (GCC 4.6.4)
Score 0
Code Size 1198 Byte
Status WA
Exec Time 251 ms
Memory 844 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:15:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:16:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:18:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:21:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 1
RE × 2
WA × 1
RE × 24
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 RE 242 ms 792 KB
subtask0_sample02.txt WA 22 ms 704 KB
subtask0_sample03.txt RE 239 ms 792 KB
subtask1_01.txt RE 241 ms 784 KB
subtask1_02.txt RE 251 ms 796 KB
subtask1_03.txt RE 233 ms 792 KB
subtask1_04.txt RE 239 ms 796 KB
subtask1_05.txt RE 238 ms 788 KB
subtask1_06.txt RE 238 ms 792 KB
subtask1_07.txt RE 234 ms 788 KB
subtask1_08.txt RE 233 ms 792 KB
subtask1_09.txt RE 239 ms 672 KB
subtask1_10.txt RE 233 ms 716 KB
subtask1_11.txt RE 239 ms 844 KB
subtask1_12.txt RE 245 ms 792 KB
subtask1_13.txt RE 240 ms 788 KB
subtask1_14.txt RE 248 ms 796 KB
subtask1_15.txt RE 244 ms 744 KB
subtask1_16.txt RE 243 ms 792 KB
subtask1_17.txt RE 231 ms 672 KB
subtask1_18.txt RE 240 ms 792 KB
subtask1_19.txt RE 241 ms 792 KB
subtask1_20.txt RE 233 ms 672 KB
subtask1_21.txt RE 235 ms 792 KB
subtask1_22.txt RE 236 ms 788 KB