Submission #5192
Source Code Expand
vecs = [[0,1],[0,-1],[1,0],[-1,0],[-1,-1],[-1,1],[1,-1],[1,1]] source = [[0]*8 for i in range(8)] queen_num = 0 for l in range(8): for i,t in enumerate(raw_input().strip()): if t=="Q": if source[l][i] != 0: print "No Answer" exit() source[l][i] = 1 queen_num += 1 for vec in vecs: x,y = i+vec[0],l+vec[1] while 0<=x<8 and 0<=y<8: if source[y][x] == 1: print "No Answer" exit() source[y][x] = 2 x += vec[0] y += vec[1] task = [source] for i in range(7-queen_num): next_tasks = [] #print i+queen_num,len(task) if len(task)>0: target = task.pop() #print "\n".join("".join([".","Q","N"][atom] for atom in line) for line in target) #print for _y,line in enumerate(target): for _x,atom in enumerate(line): if atom==0: next_task = [line[:] for line in target] next_task[_y][_x] = 1 for vec in vecs: x,y = _x+vec[0],_y+vec[1] while 0<=x<8 and 0<=y<8: next_task[y][x] = 2 x += vec[0] y += vec[1] next_tasks.append(next_task) task = next_tasks else: break if len(task)!=0: for line in task[0]: print "".join([".","Q","."][atom] for atom in line) else: print "No Answer"
Submission Info
Submission Time | |
---|---|
Task | C - パズルのお手伝い |
User | kotauchisunsun |
Language | Python (2.7.3) |
Score | 0 |
Code Size | 1682 Byte |
Status | WA |
Exec Time | 51 ms |
Memory | 3384 KB |
Judge Result
Set Name | all | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 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 | WA | 47 ms | 3384 KB |
00_sample2.txt | AC | 46 ms | 144 KB |
01_rnd_00.txt | AC | 48 ms | 3368 KB |
01_rnd_01.txt | WA | 46 ms | 140 KB |
01_rnd_02.txt | AC | 47 ms | 136 KB |
01_rnd_03.txt | WA | 46 ms | 132 KB |
01_rnd_04.txt | AC | 46 ms | 164 KB |
01_rnd_05.txt | WA | 48 ms | 128 KB |
01_rnd_06.txt | AC | 46 ms | 136 KB |
01_rnd_07.txt | AC | 46 ms | 140 KB |
01_rnd_08.txt | AC | 46 ms | 140 KB |
01_rnd_09.txt | AC | 47 ms | 140 KB |
01_rnd_10.txt | AC | 47 ms | 128 KB |
01_rnd_11.txt | AC | 47 ms | 136 KB |
01_rnd_12.txt | AC | 47 ms | 132 KB |
01_rnd_13.txt | WA | 47 ms | 140 KB |
01_rnd_14.txt | AC | 47 ms | 168 KB |
01_rnd_15.txt | AC | 46 ms | 140 KB |
01_rnd_16.txt | AC | 47 ms | 3380 KB |
01_rnd_17.txt | AC | 47 ms | 128 KB |
01_rnd_18.txt | WA | 51 ms | 128 KB |
01_rnd_19.txt | WA | 48 ms | 128 KB |
01_rnd_20.txt | AC | 47 ms | 128 KB |
01_rnd_21.txt | AC | 46 ms | 3376 KB |
01_rnd_22.txt | AC | 48 ms | 128 KB |
01_rnd_23.txt | AC | 46 ms | 140 KB |
01_rnd_24.txt | AC | 46 ms | 128 KB |
01_rnd_25.txt | WA | 47 ms | 140 KB |
01_rnd_26.txt | AC | 47 ms | 3376 KB |
01_rnd_27.txt | WA | 47 ms | 3380 KB |
01_rnd_28.txt | AC | 48 ms | 128 KB |
01_rnd_29.txt | AC | 48 ms | 132 KB |
01_rnd_30.txt | AC | 46 ms | 164 KB |
01_rnd_31.txt | AC | 47 ms | 128 KB |
01_rnd_32.txt | WA | 46 ms | 128 KB |
01_rnd_33.txt | AC | 46 ms | 128 KB |
01_rnd_34.txt | AC | 46 ms | 140 KB |
01_rnd_35.txt | AC | 47 ms | 136 KB |
01_rnd_36.txt | AC | 45 ms | 128 KB |
01_rnd_37.txt | AC | 45 ms | 140 KB |
01_rnd_38.txt | WA | 47 ms | 128 KB |
01_rnd_39.txt | WA | 49 ms | 144 KB |