Submission #162819


Source Code Expand

#include <stdio.h>

int main(void) {
	int r,c,sy,sx,gy,gx, i, n, v = 0,f = 0,mae;
	int map[50][50];
	char buf;
	
	int kaisou[250][250][2];
	
	scanf("%d", &r);
	scanf("%d", &c);
	scanf("%d", &sy);
	scanf("%d", &sx);
	scanf("%d", &gx);
	scanf("%d", &gy);
	sx--;sy--;gx--;gy--;

	for(i = 0; r > i; i++){
		scanf("%c", &buf);
		for(n = 0; c > n; n++){
		scanf("%c", &buf);
		map[i][n] = (buf == '#'? 1 : 0);
		}
	}
	kaisou[0][0][0] = sx;
	kaisou[0][0][1] = sy;
	map[sx][sy] = 2;

	mae = 1;
	for(i = 1; f == 0; i++){
	
		for(n = 0; mae > n; n++){
			if(map[kaisou[i-1][n][0]+1][kaisou[i-1][n][1]] == 0){
				kaisou[i][v][0] = kaisou[i-1][n][0]+1;
				kaisou[i][v][1] = kaisou[i-1][n][1];
				map[kaisou[i-1][n][0]+1][kaisou[i-1][n][1]] = i+2;
				if(kaisou[i][v][0] == gx && kaisou[i][v][1] == gy){
					n = 100;
					f = 1;
				}
				v++;
			}
			if(map[kaisou[i-1][n][0]-1][kaisou[i-1][n][1]] == 0){
				kaisou[i][v][0] = kaisou[i-1][n][0]-1;
				kaisou[i][v][1] = kaisou[i-1][n][1];
				map[kaisou[i-1][n][0]-1][kaisou[i-1][n][1]] = i+2;
				if(kaisou[i][v][0] == gx && kaisou[i][v][1] == gy){
					n = 100;
					f = 1;
				}
				v++;
			}
			if(map[kaisou[i-1][n][0]][kaisou[i-1][n][1]+1] == 0){
				kaisou[i][v][0] = kaisou[i-1][n][0];
				kaisou[i][v][1] = kaisou[i-1][n][1]+1;
				map[kaisou[i-1][n][0]][kaisou[i-1][n][1]+1] = i+2;
				if(kaisou[i][v][0] == gx && kaisou[i][v][1] == gy){
					n = 100;
					f = 1;
				}
				v++;
			}
			if(map[kaisou[i-1][n][0]][kaisou[i-1][n][1]-1] == 0){
				kaisou[i][v][0] = kaisou[i-1][n][0];
				kaisou[i][v][1] = kaisou[i-1][n][1]-1;
				map[kaisou[i-1][n][0]][kaisou[i-1][n][1]-1] = i+2;
				if(kaisou[i][v][0] == gx && kaisou[i][v][1] == gy){
					n = 100;
					f = 1;
				}
				v++;
			}
				
		}
		mae = v;
		v = 0;
	}
	printf("%d\n", i-1);
	
	return 0;
}

Submission Info

Submission Time
Task C - 幅優先探索
User Gear
Language C (GCC 4.6.4)
Score 0
Code Size 1884 Byte
Status RE
Exec Time 248 ms
Memory 1316 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:10:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:11:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:12:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:13:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:14:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:15:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:19:8: 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
AC × 3
AC × 18
RE × 7
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 19 ms 804 KB
subtask0_sample02.txt AC 19 ms 804 KB
subtask0_sample03.txt AC 19 ms 796 KB
subtask1_01.txt RE 245 ms 1312 KB
subtask1_02.txt RE 248 ms 1180 KB
subtask1_03.txt AC 19 ms 932 KB
subtask1_04.txt AC 20 ms 924 KB
subtask1_05.txt AC 19 ms 916 KB
subtask1_06.txt RE 245 ms 1304 KB
subtask1_07.txt AC 19 ms 932 KB
subtask1_08.txt AC 19 ms 1052 KB
subtask1_09.txt AC 20 ms 932 KB
subtask1_10.txt AC 20 ms 936 KB
subtask1_11.txt AC 19 ms 924 KB
subtask1_12.txt AC 19 ms 800 KB
subtask1_13.txt AC 19 ms 928 KB
subtask1_14.txt AC 19 ms 924 KB
subtask1_15.txt AC 20 ms 1060 KB
subtask1_16.txt AC 20 ms 1048 KB
subtask1_17.txt AC 20 ms 928 KB
subtask1_18.txt AC 20 ms 928 KB
subtask1_19.txt RE 248 ms 1316 KB
subtask1_20.txt RE 245 ms 1184 KB
subtask1_21.txt RE 245 ms 1184 KB
subtask1_22.txt RE 245 ms 1312 KB