Submission #1292449
Source Code Expand
c = [] init = [[True for i in range(8)] for j in range(8)] def func(q, b): if len(q) == 5: for p in q: c[p[0]][p[1]] = "Q" return True for i in range(8): for j in range(8): if b[i][j]: new_b = [[y for y in x] for x in b] for x in range(8): new_b[i][x] = False new_b[x][j] = False if i-x >= 0: if j-x >= 0: new_b[i-x][j-x] = False if j+x < 8: new_b[i-x][j+x] = False if i+x < 8: if j-x >= 0: new_b[i+x][j-x] = False if j+x < 8: new_b[i+x][j+x] = False if func(q + [(i,j)],new_b) == True: return True return False initflag = True for i in range(8): l = list(input()) for j in range(8): if l[j] == "Q": if init[i][j] == False: initFlag = False print("No Answer") exit() for x in range(8): init[i][x] = False init[x][j] = False if i-x >= 0: if j-x >= 0: init[i-x][j-x] = False if j+x < 8: init[i-x][j+x] = False if i+x < 8: if j-x >= 0: init[i+x][j-x] = False if j+x < 8: init[i+x][j+x] = False c.append(l) if func([], init): for t in c: print("".join(t)) else: print("No Answer")
Submission Info
Submission Time | |
---|---|
Task | C - パズルのお手伝い |
User | yuzupom |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 1800 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 3192 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 | 18 ms | 3188 KB |
00_sample2.txt | AC | 17 ms | 3188 KB |
01_rnd_00.txt | AC | 24 ms | 3188 KB |
01_rnd_01.txt | AC | 18 ms | 3188 KB |
01_rnd_02.txt | AC | 17 ms | 3188 KB |
01_rnd_03.txt | AC | 24 ms | 3188 KB |
01_rnd_04.txt | AC | 17 ms | 3188 KB |
01_rnd_05.txt | AC | 23 ms | 3188 KB |
01_rnd_06.txt | AC | 17 ms | 3188 KB |
01_rnd_07.txt | AC | 17 ms | 3192 KB |
01_rnd_08.txt | AC | 17 ms | 3188 KB |
01_rnd_09.txt | AC | 17 ms | 3188 KB |
01_rnd_10.txt | AC | 17 ms | 3188 KB |
01_rnd_11.txt | AC | 17 ms | 3188 KB |
01_rnd_12.txt | AC | 17 ms | 3188 KB |
01_rnd_13.txt | AC | 19 ms | 3188 KB |
01_rnd_14.txt | AC | 18 ms | 3188 KB |
01_rnd_15.txt | AC | 17 ms | 3188 KB |
01_rnd_16.txt | AC | 18 ms | 3188 KB |
01_rnd_17.txt | AC | 17 ms | 3188 KB |
01_rnd_18.txt | AC | 17 ms | 3188 KB |
01_rnd_19.txt | AC | 18 ms | 3188 KB |
01_rnd_20.txt | AC | 17 ms | 3188 KB |
01_rnd_21.txt | AC | 17 ms | 3188 KB |
01_rnd_22.txt | AC | 17 ms | 3188 KB |
01_rnd_23.txt | AC | 24 ms | 3192 KB |
01_rnd_24.txt | AC | 17 ms | 3188 KB |
01_rnd_25.txt | AC | 20 ms | 3188 KB |
01_rnd_26.txt | AC | 18 ms | 3188 KB |
01_rnd_27.txt | AC | 18 ms | 3192 KB |
01_rnd_28.txt | AC | 27 ms | 3188 KB |
01_rnd_29.txt | AC | 18 ms | 3188 KB |
01_rnd_30.txt | AC | 18 ms | 3188 KB |
01_rnd_31.txt | AC | 18 ms | 3188 KB |
01_rnd_32.txt | AC | 18 ms | 3188 KB |
01_rnd_33.txt | AC | 18 ms | 3188 KB |
01_rnd_34.txt | AC | 18 ms | 3188 KB |
01_rnd_35.txt | AC | 17 ms | 3188 KB |
01_rnd_36.txt | AC | 18 ms | 3192 KB |
01_rnd_37.txt | AC | 17 ms | 3188 KB |
01_rnd_38.txt | AC | 24 ms | 3188 KB |
01_rnd_39.txt | AC | 28 ms | 3188 KB |