QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#387942 | #3162. Mini Battleship | ohiostatescarlet# | AC ✓ | 2676ms | 66264kb | Python3 | 1.1kb | 2024-04-13 06:16:38 | 2024-04-13 06:16:38 |
Judging History
answer
from collections import defaultdict
n, k = map(int,input().split())
graph = [[".XO".find(v) for v in input()] for _ in range(n)]
ships = [int(input()) for _ in range(k)]
poss = defaultdict(lambda: {})
def place(ships, board):
# print(len(ships))
if len(ships) == 0:
if any(v==2 for row in board for v in row):
return 0
return 1
key = tuple(tuple(v) for v in board)
if key in poss[len(ships)]:
return poss[len(ships)][key]
c=ships.pop()
total_poss = 0
for x in range(n):
for y in range(n):
for dx, dy in ([(1, 0), (0, 1)] if c>1 else [(1, 0)]):
if 0 <=x + dx*(c-1) < n and 0<=y+dy*(c-1)<n and all(board[y+dy*d][x+dx*d] in [0, 2] for d in range(c)):
# print(x, y, dx, dy)
new_board = [[v for v in row] for row in board]
for d in range(c):
new_board[y+dy*d][x+dx*d] = 3
total_poss += place(ships, new_board)
ships.append(c)
poss[len(ships)][key] = total_poss
return total_poss
print(place(ships, graph))
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 17ms
memory: 10444kb
input:
4 3 .... .OX. .... O..X 3 2 1
output:
132
result:
ok single line: '132'
Test #2:
score: 0
Accepted
time: 13ms
memory: 10456kb
input:
4 4 .X.X .XX. ...X .... 1 2 3 4
output:
6
result:
ok single line: '6'
Test #3:
score: 0
Accepted
time: 13ms
memory: 10372kb
input:
2 2 .. .. 2 2
output:
4
result:
ok single line: '4'
Test #4:
score: 0
Accepted
time: 777ms
memory: 32684kb
input:
5 5 ..... ..... ..... ..... ..... 5 4 3 3 2
output:
80848
result:
ok single line: '80848'
Test #5:
score: 0
Accepted
time: 813ms
memory: 18156kb
input:
5 5 ..... ..... ..... ..... ..... 1 1 1 1 1
output:
6375600
result:
ok single line: '6375600'
Test #6:
score: 0
Accepted
time: 2676ms
memory: 31868kb
input:
5 5 ..... ..... ..... ..... ..... 2 2 2 2 2
output:
18840000
result:
ok single line: '18840000'
Test #7:
score: 0
Accepted
time: 18ms
memory: 10624kb
input:
5 5 ..... XX... ..XXX XXXX. ....X 5 1 4 2 3
output:
1
result:
ok single line: '1'
Test #8:
score: 0
Accepted
time: 17ms
memory: 10592kb
input:
5 5 OOOOO XXOOO OOXXX XXXXO OOOOX 5 1 4 2 3
output:
1
result:
ok single line: '1'
Test #9:
score: 0
Accepted
time: 1828ms
memory: 66232kb
input:
5 5 OOOOO ..OOO OO... ....O OOOO. 5 1 4 2 3
output:
1
result:
ok single line: '1'
Test #10:
score: 0
Accepted
time: 1846ms
memory: 66264kb
input:
5 5 OOOOO OOOOO OOOOO OOOOO OOOOO 5 1 4 2 3
output:
0
result:
ok single line: '0'
Test #11:
score: 0
Accepted
time: 8ms
memory: 10484kb
input:
5 5 OOOOO OOOOO OOOOO OOOOO OOOOO 5 5 5 5 5
output:
240
result:
ok single line: '240'
Test #12:
score: 0
Accepted
time: 13ms
memory: 10376kb
input:
1 1 . 1
output:
1
result:
ok single line: '1'
Test #13:
score: 0
Accepted
time: 13ms
memory: 10356kb
input:
1 1 O 1
output:
1
result:
ok single line: '1'
Test #14:
score: 0
Accepted
time: 8ms
memory: 10392kb
input:
1 1 X 1
output:
0
result:
ok single line: '0'
Test #15:
score: 0
Accepted
time: 13ms
memory: 10340kb
input:
4 5 .... .... .... .... 4 4 4 4 4
output:
0
result:
ok single line: '0'
Test #16:
score: 0
Accepted
time: 53ms
memory: 11040kb
input:
5 5 OX.XO XX.XX ..... XX.XX OX.XO 1 1 2 1 1
output:
192
result:
ok single line: '192'
Test #17:
score: 0
Accepted
time: 33ms
memory: 10784kb
input:
5 5 OX.XO XX.XX ..... XX.XX OX.XO 1 1 2 2 1
output:
0
result:
ok single line: '0'
Test #18:
score: 0
Accepted
time: 13ms
memory: 10388kb
input:
2 2 O. .X 2 1
output:
2
result:
ok single line: '2'
Test #19:
score: 0
Accepted
time: 11ms
memory: 10376kb
input:
3 5 ... ... ... 2 2 1 2 2
output:
432
result:
ok single line: '432'
Test #20:
score: 0
Accepted
time: 449ms
memory: 14028kb
input:
5 4 O...O ..... ..O.. ..... O...O 2 2 2 2
output:
0
result:
ok single line: '0'
Test #21:
score: 0
Accepted
time: 4ms
memory: 10392kb
input:
3 2 O.O .X. ... 3 2
output:
8
result:
ok single line: '8'
Test #22:
score: 0
Accepted
time: 255ms
memory: 13888kb
input:
5 5 X...O ..... O...X O.X.. ..... 1 1 2 2 5
output:
6856
result:
ok single line: '6856'
Test #23:
score: 0
Accepted
time: 14ms
memory: 10408kb
input:
3 3 .O. ... OO. 3 2 2
output:
44
result:
ok single line: '44'
Test #24:
score: 0
Accepted
time: 14ms
memory: 10444kb
input:
4 3 .... ..X. .... O..X 4 3 1
output:
70
result:
ok single line: '70'
Test #25:
score: 0
Accepted
time: 13ms
memory: 10356kb
input:
3 3 O.X .X. XO. 1 3 3
output:
0
result:
ok single line: '0'
Test #26:
score: 0
Accepted
time: 13ms
memory: 10332kb
input:
2 2 O. .. 1 2
output:
6
result:
ok single line: '6'
Test #27:
score: 0
Accepted
time: 12ms
memory: 10428kb
input:
4 4 .X.. ..XX .O.. X..O 1 3 1 1
output:
714
result:
ok single line: '714'
Test #28:
score: 0
Accepted
time: 7ms
memory: 10460kb
input:
2 2 .. OO 1 2
output:
4
result:
ok single line: '4'
Test #29:
score: 0
Accepted
time: 52ms
memory: 11096kb
input:
4 4 .... O... .... .OO. 3 1 1 2
output:
2390
result:
ok single line: '2390'
Test #30:
score: 0
Accepted
time: 13ms
memory: 10408kb
input:
3 3 ... .X. .XO 2 1 2
output:
36
result:
ok single line: '36'
Test #31:
score: 0
Accepted
time: 40ms
memory: 10876kb
input:
5 5 O.X.O O...O XO... .X.X. .O... 1 3 1 3 5
output:
48
result:
ok single line: '48'
Test #32:
score: 0
Accepted
time: 50ms
memory: 10932kb
input:
5 5 OO.X. ....X X.... ..... ..... 2 2 5 4 2
output:
3204
result:
ok single line: '3204'
Test #33:
score: 0
Accepted
time: 113ms
memory: 13208kb
input:
5 5 ..OX. ..X.. ..... O.... OXX.. 5 1 1 2 5
output:
556
result:
ok single line: '556'
Test #34:
score: 0
Accepted
time: 11ms
memory: 10336kb
input:
5 2 ..... ..X.. .X... ...O. ..... 2 4
output:
112
result:
ok single line: '112'
Test #35:
score: 0
Accepted
time: 9ms
memory: 10392kb
input:
2 2 .. O. 1 1
output:
6
result:
ok single line: '6'
Test #36:
score: 0
Accepted
time: 40ms
memory: 10928kb
input:
5 4 .X.X. X..O. ...O. ..... X..X. 1 3 4 2
output:
2722
result:
ok single line: '2722'
Test #37:
score: 0
Accepted
time: 9ms
memory: 10368kb
input:
3 3 O.. XO. .O. 1 1 2
output:
20
result:
ok single line: '20'
Test #38:
score: 0
Accepted
time: 11ms
memory: 10380kb
input:
4 3 ...O ..O. .... .... 1 1 1
output:
84
result:
ok single line: '84'
Test #39:
score: 0
Accepted
time: 13ms
memory: 10464kb
input:
2 2 .. X. 1 2
output:
2
result:
ok single line: '2'
Test #40:
score: 0
Accepted
time: 9ms
memory: 10416kb
input:
4 3 X..O .... O... .X.. 1 4 2
output:
63
result:
ok single line: '63'
Test #41:
score: 0
Accepted
time: 8ms
memory: 10332kb
input:
2 2 .O .X 2 2
output:
0
result:
ok single line: '0'
Test #42:
score: 0
Accepted
time: 4ms
memory: 10468kb
input:
4 2 ...O .... .... .... 4 2
output:
44
result:
ok single line: '44'
Test #43:
score: 0
Accepted
time: 12ms
memory: 10456kb
input:
4 2 XO.. .... X... .X.. 4 4
output:
0
result:
ok single line: '0'
Test #44:
score: 0
Accepted
time: 10ms
memory: 10436kb
input:
4 4 ..O. .... ..X. .XOO 4 4 1 1
output:
8
result:
ok single line: '8'
Test #45:
score: 0
Accepted
time: 13ms
memory: 10400kb
input:
4 2 .... .... .... ..X. 2 2
output:
334
result:
ok single line: '334'