結果

提出番号	1318
提出者	jellyfish
言語	C++
提出日時	2018-06-21 17:21:51
問題名	(62)SuperCon2018(独自テスト)
結果	TLE
点数	0

---

テストケース

ソースコード

#include<stdio.h>
#include<time.h>

int scN,scM;
int scB[2][10];
clock_t scStartTime,scEndTime;
void scInput(){
	int i;
	scanf("%d%d",&scN,&scM);
	for(i=0;i<scM;++i){scanf("%d%d",&scB[0][i],&scB[1][i]);}
	scStartTime=clock();
}
void scOutput(int s){
	scEndTime=clock();
	printf("Ans= %d, time=%d\n",s,(int)(scEndTime-scStartTime));
}

#include <math.h>
#include <cstdlib>

int main() {

	scInput();

	long long road = 0;
	long long max = (long long)pow(4, scN);
	int x = 9;
	int y = 9;
	bool fail = false;
	int count = 0;
	for (int i = 0; i < scM; i++) {
		scB[0][i] += 9;
		scB[1][i] += 9;
	}

	


	for (; road < max; road++) {
		bool hit[19][19] = { {} };
		for (int i = 0; i < scM; i++) {
			hit[scB[0][i]][scB[1][i]] = true;
		}
		
		x = 9;
		y = 9;
		fail = false;
		for (int dig = scN - 1; dig >= 0; dig--) {
			int go = ((road >> (dig * 2)) % 4);
			if (abs(9 - x) + abs(9 - y) > dig + 1) {
				fail = true;
				road += (long long)pow(4, dig);
				break;
			}
			if (go == 0) {
				if (hit[++x][y]) {
					road += (long long)pow(4, dig);
					fail = true;
					break;
				}
				hit[x][y] = true;
			}
			if (go == 1) {
				if (hit[x][++y]) {
					road += (long long)pow(4, dig);
					fail = true;
					break;
				}
				hit[x][y] = true;
			}
			if (go == 2) {
				if (hit[--x][y]) {
					road += (long long)pow(4, dig);
					fail = true;
					break;
				}
				hit[x][y] = true;
			}
			if (go == 3) {
				if (hit[x][--y]) {
					road += (long long)pow(4, dig);
					fail = true;
					break;
				}
				hit[x][y] = true;
			}
		}

		if (fail) {
			road--; continue;
		}

		if (x == 9 && y == 9) count++;

	}


	scOutput(count);

	return 0;
}