Submission #1368341
Source Code Expand
#include <cstdio> #include <stdio.h> #include <string> #include <string.h> #include <algorithm> #include <vector> #include <iostream> using namespace std; typedef vector<int> vi; #define MAX_INT 114514 #define FOR(i,a,b) for (int i=(a);i<(b);i++) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--) #define REP(i,n) for (int i=0;i<(n);i++) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) #define ALL(a) (a).begin(),a.end() #define MAXE(a) *max_element(ALL(a)) #define MINE(a) *min_element(ALL(a)) string s[8]; int check(int x,int y){ int po = 1; REP(i,8){ if(s[i][x] == 'Q' && i!=y) return 0; if(s[y][i] == 'Q' && i!=x) return 0; if(x - i > 0 && y - i > 0){ if(s[y-1-i][x-1-i] == 'Q') po = 0; } if(x + i < 7 && y - i > 0){ if(s[y-1-i][x+1+i] == 'Q') po = 0; } if(x - i > 0 && y + i < 7){ if(s[y+1+i][x-1-i] == 'Q') po = 0; } if(x + i < 7 && y + i < 7){ if(s[y+1+i][x+1+i] == 'Q') po = 0; } } return po; } //n箇所にqを置けるか int DFS(int n){ if(n == 0) return 1; else{ REP(y,8) REP(x,8){ if(s[y][x] != 'Q'){ if(check(x,y)){ s[y][x] = 'Q'; if(DFS(n-1)) return 1; } s[y][x] = '.'; } } } return 0; } int main(){ REP(i,8){ cin >>s[i]; } //入力がそもそもおかしい REP(y,8) REP(x,8){ if(s[y][x] == 'Q'){ if(check(x,y) == 0){ cout << "No Answer" << endl; return 0; } } } if(DFS(5)){ REP(i,8)cout << s[i] << endl; } else{ cout << "No Answer" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - パズルのお手伝い |
User | uynet |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1570 Byte |
Status | AC |
Exec Time | 3 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 | 2 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 | 3 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 | 3 ms | 256 KB |