Submission #1654330

---

Source Code Expand

#二つのクィーンが衝突するか判定
import sys
sys.setrecursionlimit(1000000)
def twoDimArray(row,column,n): return [[n for j in range(column)] for i in range(row)]
banmen=[]
yposes=set()
def iscollide(a:tuple,b:tuple):
    if a[0]==b[0]:
        return True
    elif a[1]==b[1]:
        return True
    elif a[0]+a[1]==b[0]+b[1]:
        return True
    elif a[0]-a[1]==b[0]-b[1]:
        return True
    else:
        return False
        
        
def dfs(li:tuple,ypos,xpos):
    if len(li)==8:
        return li
    elif ypos>7:
        return None
    collisionflag=True
    for k in li:
        if iscollide((ypos,xpos),k):
            collisionflag=False
            break
    if collisionflag:
        returned= dfs(li+((ypos,xpos),),ypos+(xpos+1)//8,(xpos+1)%8)
        if returned!=None:
            return returned
    returned= dfs(li,ypos+(xpos+1)//8,(xpos+1)%8)
    if returned!=None:
        return returned
    return None
                    
                
    
for i in range(8):
    tmpstr=input()
    for j in enumerate(tmpstr):
        if j[1]=="Q":
            queenpos=(i,j[0])
            for k in banmen:
                if  iscollide(queenpos,k):
                    print("No Answer")
                    exit()
            yposes.add(queenpos[0])
            banmen.append(queenpos)
banmen=tuple(banmen)
ans=twoDimArray(8,8,".")
returned = dfs(banmen,0,0)
if returned==None:
    print("No Answer")
else:
    for i in returned:
        ans[i[0]][i[1]]="Q"
    for i in ans:
        print("".join(i))
        

Submission Info

Judge Result