Submission #1757739
Source Code Expand
#include <iostream> #include <vector> #include <stack> using namespace std; using vc = vector<char>; using vvc = vector<vector<char>>; int dic[5] = {1,1,-1,-1,1}; bool inside(int a){ return ((a >= 0) && (a < 8)) ; } bool paint(int y,int x,vvc& arr){ arr[y][x] = '.'; for(int k = 0; k < 8; k++){ if(arr[k][x] == 'Q' || arr[y][k] == 'Q') return true; arr[k][x] = arr[y][k] = ' '; } for(int i = 0; i < 4; i++){ for(int j = 0; j < 8; j++){ if(inside(y+dic[i]*j) && inside(x+dic[i+1]*j)){ if(arr[y+dic[i]*j][x+dic[i+1]*j] == 'Q') return true; arr[y+dic[i]*j][x+dic[i+1]*j] = ' '; } } } arr[y][x] = 'Q'; return false; } void output(vvc& now){ for(int i = 0; i < 8; i++){ for(int j = 0; j < 8; j++){ if(now[i][j] == 'Q') cout << 'Q'; else cout << '.';//. } cout << endl; } } void display(vvc& now){ cout << "-----------" << endl; for(int i = 0; i < 8; i++){ for(int j = 0; j < 8; j++){ cout << now[i][j]; } cout << endl; } cout << "-----------" << endl << endl; } int main(void){ vvc arr(8,vc(8)); for(int i = 0; i < 8; i++) for(int j = 0; j < 8; j++){ cin >> arr[i][j]; } for(int i = 0; i < 8; i++) for(int j = 0; j < 8; j++) if(arr[i][j] == 'Q'){ if(paint(i,j,arr)){ cout << "No Answer" << endl; return 0; } } stack<vvc> q; q.push(arr); //64 //64-32+3 = 32 //35 - 32 + 10 = 16 //13 - 32 + 20 = 8 //4 //2 //1 //2^20 while(!q.empty()){//O(8*8*8*4 = 2048 = 2^11) vvc now = q.top(); q.pop(); //display(now); int answer = 0; for(int i = 0; i < 8; i++) for(int j = 0; j < 8; j++){ if( now[i][j] == '.' ){ vvc next = now; if(paint(i,j,next)){ continue; } q.push(next); }else{ if(now[i][j] == 'Q') answer++; } } if(answer == 8){ output(now); return 0; } } cout << "No Answer" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - パズルのお手伝い |
User | nasatame |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2700 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 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 | AC | 1 ms | 256 KB |
00_sample2.txt | AC | 1 ms | 256 KB |
01_rnd_00.txt | AC | 2 ms | 256 KB |
01_rnd_01.txt | AC | 1 ms | 256 KB |
01_rnd_02.txt | AC | 1 ms | 256 KB |
01_rnd_03.txt | AC | 2 ms | 256 KB |
01_rnd_04.txt | AC | 1 ms | 256 KB |
01_rnd_05.txt | AC | 2 ms | 256 KB |
01_rnd_06.txt | AC | 1 ms | 256 KB |
01_rnd_07.txt | AC | 1 ms | 256 KB |
01_rnd_08.txt | AC | 1 ms | 256 KB |
01_rnd_09.txt | AC | 1 ms | 256 KB |
01_rnd_10.txt | AC | 1 ms | 256 KB |
01_rnd_11.txt | AC | 1 ms | 256 KB |
01_rnd_12.txt | AC | 1 ms | 256 KB |
01_rnd_13.txt | AC | 1 ms | 256 KB |
01_rnd_14.txt | AC | 1 ms | 256 KB |
01_rnd_15.txt | AC | 1 ms | 256 KB |
01_rnd_16.txt | AC | 1 ms | 256 KB |
01_rnd_17.txt | AC | 1 ms | 256 KB |
01_rnd_18.txt | AC | 1 ms | 256 KB |
01_rnd_19.txt | AC | 1 ms | 256 KB |
01_rnd_20.txt | AC | 1 ms | 256 KB |
01_rnd_21.txt | AC | 1 ms | 256 KB |
01_rnd_22.txt | AC | 1 ms | 256 KB |
01_rnd_23.txt | AC | 2 ms | 256 KB |
01_rnd_24.txt | AC | 1 ms | 256 KB |
01_rnd_25.txt | AC | 1 ms | 256 KB |
01_rnd_26.txt | AC | 1 ms | 256 KB |
01_rnd_27.txt | AC | 1 ms | 256 KB |
01_rnd_28.txt | AC | 2 ms | 256 KB |
01_rnd_29.txt | AC | 1 ms | 256 KB |
01_rnd_30.txt | AC | 1 ms | 256 KB |
01_rnd_31.txt | AC | 1 ms | 256 KB |
01_rnd_32.txt | AC | 1 ms | 256 KB |
01_rnd_33.txt | AC | 1 ms | 256 KB |
01_rnd_34.txt | AC | 1 ms | 256 KB |
01_rnd_35.txt | AC | 1 ms | 256 KB |
01_rnd_36.txt | AC | 1 ms | 256 KB |
01_rnd_37.txt | AC | 1 ms | 256 KB |
01_rnd_38.txt | AC | 2 ms | 256 KB |
01_rnd_39.txt | AC | 2 ms | 256 KB |