CSES - Datatähti 2019 alku

Submission details
Task:	Ruudukko
Sender:	1
Submission time:	2018-10-11 20:20:22 +0300
Language:	Python3
Status:	READY
Result:	31

Feedback
group	verdict	score
#1	ACCEPTED	31
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.06 s	1	details
#2	ACCEPTED	0.06 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.05 s	1	details
#5	ACCEPTED	0.08 s	1	details
#6	ACCEPTED	0.70 s	1	details
#7	ACCEPTED	0.09 s	1	details
#8	ACCEPTED	0.07 s	1	details
#9	ACCEPTED	0.05 s	1	details
#10	ACCEPTED	0.05 s	1	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	TIME LIMIT EXCEEDED	--	2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	TIME LIMIT EXCEEDED	--	3	details
#23	TIME LIMIT EXCEEDED	--	3	details
#24	TIME LIMIT EXCEEDED	--	3	details
#25	TIME LIMIT EXCEEDED	--	3	details
#26	TIME LIMIT EXCEEDED	--	3	details
#27	TIME LIMIT EXCEEDED	--	3	details
#28	TIME LIMIT EXCEEDED	--	3	details
#29	TIME LIMIT EXCEEDED	--	3	details
#30	TIME LIMIT EXCEEDED	--	3	details

Code

import copy

n = int(input())
board = []
for i in range(0, n):
    board.append(list(input()))

def fill(l, symbol):
    for i in range(0, len(l)):
        l[i] = symbol
    return l

# set all rows and columns for both symbols as not forbidden (value of 0)
forbiddenZones = {"A": [fill(list(range(n)), 0), fill(list(range(n)), 0)], "B": [fill(list(range(n)), 0), fill(list(range(n)), 0)]}

for x in range(0, n): # update forbidden zones based on initial board arrangement
    for y in range(0, n):
        if board[x][y] == "A":
            forbiddenZones["A"][0][x] = 1
            forbiddenZones["A"][1][y] = 1
        elif board[x][y] == "B":
            forbiddenZones["B"][0][x] = 1
            forbiddenZones["B"][1][y] = 1

def possibleRowCompletions(symbols, restrictedsA, restrictedsB):
    # find all ways to complete a row such that it contains certain symbols that cannot be placed in certain places
    completedTrails = []
    def searcher(remainingSymbols, rstrA, rstrB, length, trail):
        if len(trail) == n:
            completedTrails.append(trail)
        choices = []
        if "A" in remainingSymbols and rstrA[0] != 1:
            choices.append("A")
        if "B" in remainingSymbols and rstrB[0] != 1:
            choices.append("B")
        if len(remainingSymbols) != length:
            choices.append(".")
        for choice in choices:
            searcher([x for x in remainingSymbols if x != choice], rstrA[1:], rstrB[1:], length - 1, trail + [choice])
    searcher(symbols, restrictedsA, restrictedsB, n, [])
    return completedTrails

def arrangementFinder(b, forbidden, rowNum):
    if 0 not in forbidden["A"][0] and 0 not in forbidden["A"][1] and 0 not in forbidden["B"][0] and 0 not in forbidden["B"][1]:
        return 1
    sum = 0
    symbols = []
    restrictedsA = []
    restrictedsB = []
    if forbidden["A"][0][rowNum] == 0:
        symbols.append("A")
        for x in range(0, n):
            if forbidden["A"][1][x] == 1 or b[rowNum][x] != ".":
                restrictedsA.append(1)
            else:
                restrictedsA.append(0)
    else:
        restrictedsA = [0] * n
    if forbidden["B"][0][rowNum] == 0:
        symbols.append("B")
        for x in range(0, n):
            if forbidden["B"][1][x] == 1 or b[rowNum][x] != ".":
                restrictedsB.append(1)
            else:
                restrictedsB.append(0)
    else:
        restrictedsB = [0] * n
    rowCompletions = possibleRowCompletions(symbols, restrictedsA, restrictedsB)
    if len(rowCompletions) == 0:
        return 0
    else:
        for row in rowCompletions:
            newForbidden = copy.deepcopy(forbidden)
            if "A" in row:
                newForbidden["A"][0][rowNum] = 1
                newForbidden["A"][1][row.index("A")] = 1
            if "B" in row:
                newForbidden["B"][0][rowNum] = 1
                newForbidden["B"][1][row.index("B")] = 1
            sum += arrangementFinder(b[0:rowNum] + [row] + b[rowNum+1:], newForbidden, rowNum + 1)
        return sum


answer = arrangementFinder(board, forbiddenZones, 0)
print(str(answer))

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`2 .. ..` view save

correct output
`2` view save

user output
`2` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`2 .. A.` view save

correct output
`1` view save

user output
`1` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`2 B. .A` view save

correct output
`0` view save

user output
`0` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`3 ... ... ...` view save

correct output
`12` view save

user output
`12` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`4 .... .... .... ....` view save

correct output
`216` view save

user output
`216` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`5 ..... ..... ..... ..... ...` view save

correct output
`5280` view save

user output
`5280` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`5 ....A ..... ..... ..... ...` view save

correct output
`264` view save

user output
`264` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`5 B.... ..... ..... .A.B. ...` view save

correct output
`22` view save

user output
`22` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`5 B.A.. ....A ..... A.B.. ...` view save

correct output
`2` view save

user output
`2` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`5 A.B.. BA... .B.A. ...BA ...` view save

correct output
`1` view save

user output
`1` view save

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`10 .......... .......... .......... .......... ...` view save

correct output
`306442892` view save

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`50 .................................` view save

correct output
`694861480` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`111 .................................` view save

correct output
`555319110` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`222 .................................` view save

correct output
`108372237` view save

user output
(empty)

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`333 .................................` view save

correct output
`259107857` view save

user output
(empty)

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`444 .................................` view save

correct output
`19906314` view save

user output
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`497 .................................` view save

correct output
`224313667` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`498 .................................` view save

correct output
`929574601` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`499 .................................` view save

correct output
`600226043` view save

user output
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 .................................` view save

correct output
`198353194` view save

user output
(empty)

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`499 .................................` view save

correct output
`840243733` view save

user output
(empty)

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`499 ........................A........` view save

correct output
`4146290` view save

user output
(empty)

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`499 B.........A......................` view save

correct output
`173518884` view save

user output
(empty)

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`499 ...A....B........................` view save

correct output
`20044800` view save

user output
(empty)

Test 25

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`499 AB...............................` view save

correct output
`2` view save

user output
(empty)

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500 .................................` view save

correct output
`121064146` view save

user output
(empty)

Test 27

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500 .................................` view save

correct output
`848435259` view save

user output
(empty)

Test 28

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500 .....B........A..................` view save

correct output
`296240911` view save

user output
(empty)

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500 .A......B........................` view save

correct output
`2196` view save

user output
(empty)

Test 30

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500 ...AB............................` view save

correct output
`1` view save

user output
(empty)

Datatähti 2019 alku

Ruudukko

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Tasks

Submissions (1)