結果

問題 No.424 立体迷路
ユーザー tsuishitsuishi
提出日時 2021-02-17 17:18:55
言語 C
(gcc 12.3.0)
結果
WA  
実行時間 -
コード長 5,377 bytes
コンパイル時間 1,139 ms
コンパイル使用メモリ 32,852 KB
実行使用メモリ 8,708 KB
最終ジャッジ日時 2023-10-12 04:14:58
合計ジャッジ時間 5,792 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
8,708 KB
testcase_01 AC 0 ms
4,352 KB
testcase_02 AC 1 ms
4,352 KB
testcase_03 AC 1 ms
4,356 KB
testcase_04 AC 1 ms
4,348 KB
testcase_05 WA -
testcase_06 AC 1 ms
4,352 KB
testcase_07 AC 1 ms
4,352 KB
testcase_08 AC 1 ms
4,352 KB
testcase_09 AC 1 ms
4,352 KB
testcase_10 AC 1 ms
4,352 KB
testcase_11 WA -
testcase_12 AC 1 ms
4,348 KB
testcase_13 WA -
testcase_14 AC 1 ms
4,352 KB
testcase_15 AC 1 ms
4,348 KB
testcase_16 AC 0 ms
4,348 KB
testcase_17 AC 1 ms
4,348 KB
testcase_18 AC 1 ms
4,352 KB
testcase_19 AC 0 ms
4,352 KB
testcase_20 AC 1 ms
4,352 KB
testcase_21 AC 0 ms
4,352 KB
testcase_22 WA -
testcase_23 AC 0 ms
4,352 KB
testcase_24 AC 1 ms
4,348 KB
testcase_25 TLE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c: 関数 ‘GETWORD’ 内:
main.c:38:63: 警告: 関数 ‘getchar_unlocked’ の暗黙的な宣言です [-Wimplicit-function-declaration]
   38 | static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];c=getchar_unlocked();while( c != EOF ){if((c==' ')||( c=='\n')) break;*cp++=c;c=getchar_unlocked();}*cp='\0';return &str[0];}
      |                                                               ^~~~~~~~~~~~~~~~
main.c: 関数 ‘main’ 内:
main.c:144:33: 警告: 関数 ‘putchar_unlocked’ の暗黙的な宣言です [-Wimplicit-function-declaration]
  144 |                                 putchar_unlocked( MAP[y][x] );
      |                                 ^~~~~~~~~~~~~~~~

ソースコード

diff # 

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <ctype.h>
#include <quadmath.h>
#include <math.h>
// Yukicoder №424 立体迷路
// https://yukicoder.me/problems/no/424
// ***********************
// for debug
#define DEBUGw

#define NOP do{}while(0)
#ifdef DEBUG
#define TRACE(...) do{printf(__VA_ARGS__);fflush(stdout);}while(0)
#define TRACECR do{putchar_unlocked('\n');fflush(stdout);}while(0)
#else
#define TRACE(...) NOP
#define TRACECR NOP
#endif

#define PRINCR putchar_unlocked('\n')
#define NOCR(strig) do{char *p;p=strchr(strig,'\n');if(p)*p='\0';}while(0)
// The out-of-date function
#define	asctime(...)	asctime_s(...)
#define	ctime(...)		ctime_s(...)
#define	strlen(a)	mystr_len(a)
//#define	fopen(...)		fopen_s(...)
//#define	freopen(...)	freopen_s(...)
//#define	rewind(a)		fseek(a,0L,SEEK_SET)
//#define	setbuf(a,b)		setvbuf(a,b,_IOFBF,BUFSIZ)

// for stdio
#define GETLINE(str) do{char *p;fgets(str,sizeof(str),stdin);p=strchr(str,'\n');if(p)*p='\0';}while(0)
#define mygc(c) (c)=getchar()
static char *GETWORD( char* str );
static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];c=getchar_unlocked();while( c != EOF ){if((c==' ')||( c=='\n')) break;*cp++=c;c=getchar_unlocked();}*cp='\0';return &str[0];}
#define	GETINTS(a,b) {char s[34];int *ap=a;REP(i,b){GETWORD(s);*ap++=atoi(s);}}
static int GETLINEINT(void) {char s[34];GETLINE(s);return atoi(s);}
static int GETWORDINT(void) {char s[34];GETWORD(s);return atoi(s);}
#define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0)

static int max(int a,int b){if(a>b){return a;}return b;}
static int min(int a,int b){if(a<b){return a;}return b;}
// for readaility
typedef	long long	lolong;
const int	INF = 1e9;
const int	MOD = 1e9+7;
const lolong	LINF = 1e18;
#define PI	  ((double)3.141592653589793238462643383279)
#define	YES(a)	printf("%s",((a)?"YES":"NO"))
#define	Yes(a)	printf("%s",((a)?"Yes":"No"))
#define OK(a)	printf("%s",((a)?"OK":"NG"))
#define Ok(a)	printf("%s",((a)?"Ok":"Ng"))
#define	POSSIBLE(a)		printf("%s",((a)?"POSSIBLE":"IMPOSSIBLE"))
#define	Possible(a)		printf("%s",((a)?"Possible":"Impossible"))
#define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0)
#define REP(a,b) for(int a=0;a<(int)(b);++a)
#define REP1(a,b) for(int a=1;a<=(b);++a)
#define FLOOP(a,b) for(a=0;a<(b);++a)
#define FLOOP1(a,b) for(a=1;a<=(b);++a)
#define	ABS(c)	 ((c)<0?(-(c)):(c))
#define LSB(i) ((i) & -(i))
#define INPBUF (250+2)

#define	data_s	int
// ***********************
// ***********************
static int cmpint_asc(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
static int cmpint_desc(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
static int cmpchar_asc(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}
static int cmpchar_desc(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}
static int mystr_len(char *str){int i=0;do{if(str[i]=='\0')break;i++;if(i>9999)break;}while(1);return i;}
static int countchar(char str[],char c,int limit ) {int	cnt = 0;for(int i=0;i<limit;i++) if( str[i] == c )cnt++;return cnt;}
// ***********************
// 外部変数
char MAP[56][56];
int	goalx;
int	goaly;
int	finish = 0;
// ***********************
// ***********************
// ***********************
// ***********************
// ***********************
// ***********************
// ***********************
// ***********************
void walking(int y, int x ) {
	if( ( x == goalx)&&( y == goaly ) ) {
		finish = 1;
		return;
	} else if( !finish ) {
		char	*myfloor = &MAP[y][x];
		if( (MAP[y-1][x] - *myfloor) < 2 ) { *myfloor+=15; walking(y-1,x); *myfloor -=15; }
		if( (MAP[y-2][x] == *myfloor)&&(MAP[y-1][x] < *myfloor) ) { *myfloor+=15; walking(y-2,x); *myfloor -=15; }
		if( (MAP[y+1][x] - *myfloor) < 2 ) { *myfloor+=15; walking(y+1,x); *myfloor -=15; }
		if( (MAP[y+2][x] == *myfloor)&&(MAP[y+1][x] < *myfloor) ) { *myfloor+=15; walking(y+2,x); *myfloor -=15; }
		if( (MAP[y][x-1] - *myfloor) < 2 ) { *myfloor+=15; walking(y,x-1); *myfloor -=15; }
		if( (MAP[y][x-2] == *myfloor)&&(MAP[y][x-1] < *myfloor) ) { *myfloor+=15; walking(y,x-2); *myfloor -=15; }
		if( (MAP[y][x+1] - *myfloor) < 2 ) { *myfloor+=15; walking(y,x+1); *myfloor -=15; }
		if( (MAP[y][x+2] == *myfloor)&&(MAP[y][x+1] < *myfloor) ) { *myfloor+=15; walking(y,x+2); *myfloor -=15; }
	}
	return;
}
// ***********************
int main() {
	int	h,w;
	int sx,sy;
	int	gx,gy;


	h = GETWORDINT();
	w = GETWORDINT();
	sy = GETWORDINT() +1;
	sx = GETWORDINT() +1;
	goaly = gy = GETWORDINT() +1;
	goalx = gx = GETWORDINT() +1;
	REP(i,h+4) {
		MAP[i][0] = 20 +'0';
		MAP[i][1] = 20 +'0';
		MAP[i][w+2] = 20 +'0';
		MAP[i][w+3] = 20 +'0';
	}
	REP(i,w+2) {
		MAP[0][i] = 20 +'0';
		MAP[1][i] = 20 +'0';
		MAP[h+2][i] = 20 +'0';
		MAP[h+3][i] = 20 +'0';
	}
	REP1(y,h) {
		REP1(x,w) {
            char c;
            c=getchar_unlocked();
            while( (c > '9')||( c < '0') ) c=getchar_unlocked();  
			MAP[y+1][x+1] = c ;
		}
	}
	//-----
	while(0){
		REP(y,h+4) {
			REP(x,w+4) {
				putchar_unlocked( MAP[y][x] );
			}
			putchar_unlocked('\n');
		}
		fflush(stdout);
		break;
	}
	walking(sy,sx);
	YES( finish );
	PRINCR;
	return 0;
}
0