Submission #6857166


Source Code Expand

import sys

MAP=[list(input()) for i in range(8)]

QUEEN=[]
for i in range(8):
    for j in range(8):
        if MAP[i][j]=="Q":
            QUEEN.append([i,j])

NOW=[[0]*8 for i in range(8)]

import copy

def queen(x,y,NOW):
    USED=copy.deepcopy(NOW)
    USED[x][y]="Q"
    for i in range(8):
        for j in range(8):
            if USED[i][j]=="Q" or USED[i][j]==".":
                continue
            if x==i or y==j or i+j==x+y or i-j==x-y:
                USED[i][j]="."

    return USED


for i,j in QUEEN:
    NOW[i][j]="Q"
    NOW=queen(i,j,NOW)


def one_queen(count,USED):
    
    #print(count)
    #for u in USED:
    #    print(" ".join(map(str,u)))
    #print()
    if count==0:
        for u in USED:
            print("".join(map(str,u)))
        sys.exit()
    for i in range(8):
        for j in range(8):
            if USED[i][j]==0:
                one_queen(count-1,queen(i,j,USED))


one_queen(5,NOW)
print("No Answer")  
    

Submission Info

Submission Time
Task C - パズルのお手伝い
User titia
Language Python (3.4.3)
Score 0
Code Size 1010 Byte
Status WA
Exec Time 118 ms
Memory 3444 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 26
WA × 16
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 23 ms 3444 KB
00_sample2.txt AC 111 ms 3444 KB
01_rnd_00.txt AC 58 ms 3444 KB
01_rnd_01.txt AC 24 ms 3444 KB
01_rnd_02.txt WA 32 ms 3444 KB
01_rnd_03.txt AC 58 ms 3444 KB
01_rnd_04.txt WA 24 ms 3444 KB
01_rnd_05.txt AC 56 ms 3444 KB
01_rnd_06.txt WA 31 ms 3444 KB
01_rnd_07.txt WA 36 ms 3444 KB
01_rnd_08.txt WA 23 ms 3444 KB
01_rnd_09.txt WA 26 ms 3444 KB
01_rnd_10.txt AC 69 ms 3444 KB
01_rnd_11.txt AC 92 ms 3444 KB
01_rnd_12.txt AC 87 ms 3444 KB
01_rnd_13.txt AC 29 ms 3444 KB
01_rnd_14.txt WA 35 ms 3444 KB
01_rnd_15.txt AC 92 ms 3444 KB
01_rnd_16.txt AC 93 ms 3444 KB
01_rnd_17.txt WA 28 ms 3444 KB
01_rnd_18.txt AC 23 ms 3444 KB
01_rnd_19.txt AC 23 ms 3444 KB
01_rnd_20.txt AC 118 ms 3444 KB
01_rnd_21.txt WA 34 ms 3444 KB
01_rnd_22.txt WA 24 ms 3444 KB
01_rnd_23.txt AC 59 ms 3444 KB
01_rnd_24.txt WA 29 ms 3444 KB
01_rnd_25.txt AC 36 ms 3444 KB
01_rnd_26.txt WA 34 ms 3444 KB
01_rnd_27.txt AC 24 ms 3444 KB
01_rnd_28.txt AC 77 ms 3444 KB
01_rnd_29.txt AC 64 ms 3444 KB
01_rnd_30.txt AC 49 ms 3444 KB
01_rnd_31.txt WA 29 ms 3444 KB
01_rnd_32.txt AC 24 ms 3444 KB
01_rnd_33.txt AC 113 ms 3444 KB
01_rnd_34.txt WA 38 ms 3444 KB
01_rnd_35.txt WA 23 ms 3444 KB
01_rnd_36.txt AC 46 ms 3444 KB
01_rnd_37.txt WA 23 ms 3444 KB
01_rnd_38.txt AC 55 ms 3444 KB
01_rnd_39.txt AC 80 ms 3444 KB