Submission #1610541
Source Code Expand
#include <iostream> #include <cmath> #include <vector> #include <cstdlib> #include <stdio.h> #include <algorithm> using namespace std; int x(int Qn){ return Qn % 8; } int y(int Qn){ return Qn / 8; } void copy_array(int *Q, int *newQ){ for(int i = 0; i < 12; i++){ newQ[i] = Q[i]; } return; } int check(int *Q, int new_qi, int coo){ // new_qi 番目のQをcoo に追加できるかどうかのチェック int new_x = x(coo); int new_y = y(coo); int xx, yy; int badflag = 0; // badflag == 1 で失敗 for(int i = 0; i < new_qi-1; i++){ xx = x(Q[i]); yy = y(Q[i]); if(new_x == xx || new_y == yy || new_x - xx == new_y - yy || new_x - xx == yy - new_y){ return -1; } } return 0; // おける。 } int set(int *Q, int new_qi, int new_coo){ // return 0 : success // return -1: insuccess // check if(check(Q, new_qi, new_coo) == -1){ //printf("new (%d, %d) is unsetable.\n", x(new_coo), y(new_coo)); return -1; // 失敗 } // else /* 設置可能 */ int newQ[8]; copy_array(Q, newQ); newQ[new_qi - 1] = new_coo; // new_qi == 8 終わり。 if(new_qi == 8){ /* Let's show time !!!!!!!! */ sort(newQ, newQ+8); int que = 0; for(int i = 0; i < 64; i++){ if(newQ[que] == i){ cout << "Q"; que++; }else{ cout << "."; } if(i%8 == 7){ cout << endl; } } return 0; }else{ // まだ最下層じゃないよ int res; for(int i = 0; i < 64; i++){ res = set(newQ, new_qi+1, i ); if(res == 0) return 0; } // 成功しない場合 return -1; } } int main(int argc, char *argv[]){ char c; int Q[8] = {-1}; int qi = 0; for(int i = 0; i < 64; i++){ cin >> c; if(c == 'Q'){ // i番目にあることを記録 Q[qi++] = i; } } qi = 4; // 何番目のQかを示す。 int res; for(int i = 0; i < 64; i++){ res = set(Q, qi, i); if(res != -1) break; } if(res == -1){ cout << "No Answer" << endl; } return 0; } /* ...Q.... ......Q. ..Q..... ........ ........ ........ ........ ........ */
Submission Info
Submission Time | |
---|---|
Task | C - パズルのお手伝い |
User | hatchi |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2302 Byte |
Status | RE |
Exec Time | 1908 ms |
Memory | 264448 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample1.txt, 00_sample2.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt, 01_rnd_30.txt, 01_rnd_31.txt, 01_rnd_32.txt, 01_rnd_33.txt, 01_rnd_34.txt, 01_rnd_35.txt, 01_rnd_36.txt, 01_rnd_37.txt, 01_rnd_38.txt, 01_rnd_39.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample1.txt | RE | 1908 ms | 262400 KB |
00_sample2.txt | RE | 1384 ms | 262400 KB |
01_rnd_00.txt | RE | 1385 ms | 262400 KB |
01_rnd_01.txt | RE | 1384 ms | 262400 KB |
01_rnd_02.txt | RE | 1386 ms | 262400 KB |
01_rnd_03.txt | RE | 1383 ms | 262400 KB |
01_rnd_04.txt | RE | 1385 ms | 262400 KB |
01_rnd_05.txt | RE | 1384 ms | 262400 KB |
01_rnd_06.txt | RE | 1384 ms | 262400 KB |
01_rnd_07.txt | RE | 1388 ms | 262400 KB |
01_rnd_08.txt | WA | 1 ms | 256 KB |
01_rnd_09.txt | RE | 1384 ms | 262400 KB |
01_rnd_10.txt | RE | 1385 ms | 262400 KB |
01_rnd_11.txt | RE | 1385 ms | 262400 KB |
01_rnd_12.txt | RE | 1384 ms | 262400 KB |
01_rnd_13.txt | RE | 1394 ms | 264448 KB |
01_rnd_14.txt | RE | 1383 ms | 262400 KB |
01_rnd_15.txt | RE | 1384 ms | 262400 KB |
01_rnd_16.txt | RE | 1384 ms | 262400 KB |
01_rnd_17.txt | RE | 1385 ms | 262400 KB |
01_rnd_18.txt | RE | 1384 ms | 262400 KB |
01_rnd_19.txt | RE | 1388 ms | 262400 KB |
01_rnd_20.txt | RE | 1385 ms | 262400 KB |
01_rnd_21.txt | RE | 1385 ms | 262400 KB |
01_rnd_22.txt | RE | 1386 ms | 262400 KB |
01_rnd_23.txt | RE | 1385 ms | 262400 KB |
01_rnd_24.txt | RE | 1389 ms | 262400 KB |
01_rnd_25.txt | RE | 1384 ms | 262400 KB |
01_rnd_26.txt | RE | 1384 ms | 262400 KB |
01_rnd_27.txt | RE | 1384 ms | 262400 KB |
01_rnd_28.txt | RE | 1384 ms | 262400 KB |
01_rnd_29.txt | RE | 1386 ms | 262400 KB |
01_rnd_30.txt | RE | 1384 ms | 262400 KB |
01_rnd_31.txt | RE | 1385 ms | 262400 KB |
01_rnd_32.txt | RE | 1384 ms | 262400 KB |
01_rnd_33.txt | RE | 1384 ms | 262400 KB |
01_rnd_34.txt | RE | 1384 ms | 262400 KB |
01_rnd_35.txt | WA | 1 ms | 256 KB |
01_rnd_36.txt | RE | 1389 ms | 262400 KB |
01_rnd_37.txt | WA | 1 ms | 256 KB |
01_rnd_38.txt | RE | 1384 ms | 262400 KB |
01_rnd_39.txt | RE | 1384 ms | 262400 KB |