| Task: | Kortit II |
| Sender: | Lelleri |
| Submission time: | 2024-11-01 22:54:36 +0200 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | 8 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 3 |
| #2 | ACCEPTED | 5 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| #4 | TIME LIMIT EXCEEDED | 0 |
| #5 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.05 s | 1, 2, 3, 4, 5 | details |
| #2 | ACCEPTED | 0.58 s | 2, 3, 4, 5 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3, 4, 5 | details |
| #4 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 5 | details |
| #6 | RUNTIME ERROR | 0.16 s | 5 | details |
Code
import math
def play_move(available_moves, n, target_wins, target_losses, target_ties, wins=0, losses=0, ties=0):
if(wins > target_wins or losses > target_losses or ties > target_ties):
return 0
if(available_moves == []):
return 1
depth = n-len(available_moves)+1
suitable_games_count = 0
for move in available_moves:
is_win_move = move > depth
is_lose_move = move < depth
is_tie_move = move == depth
suitable_games_count += play_move([x for x in available_moves if x != move], n, target_wins, target_losses, target_ties, wins+1 if is_win_move else wins, losses+1 if is_lose_move else losses, ties+1 if is_tie_move else ties)
return suitable_games_count
t = int(input())
tests = [[a for a in input().split()] for _ in range(t)]
for test in tests:
n, target_wins, target_losses = [int(x) for x in test]
target_ties = n-(target_wins+target_losses)
print(int((play_move(list(range(1, n+1)), n, target_wins, target_losses, target_ties)*math.factorial(n)) % (math.pow(10, 9)+7)))
Test details
Test 1
Group: 1, 2, 3, 4, 5
Verdict: ACCEPTED
| input |
|---|
| 54 4 4 0 3 1 3 3 2 2 4 0 4 ... |
| correct output |
|---|
| 0 0 0 0 0 ... |
| user output |
|---|
| 0 0 0 0 0 ... |
Test 2
Group: 2, 3, 4, 5
Verdict: ACCEPTED
| input |
|---|
| 284 6 1 0 5 0 2 7 1 5 7 7 5 ... |
| correct output |
|---|
| 0 0 35280 0 36720 ... |
| user output |
|---|
| 0 0 35280 0 36720 ... |
Test 3
Group: 3, 4, 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 841 19 3 12 19 19 13 19 7 13 20 11 15 ... |
| correct output |
|---|
| 40291066 0 0 0 0 ... |
| user output |
|---|
| (empty) |
Test 4
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 15 12 6 7 1 6 44 4 26 6 6 5 ... |
| correct output |
|---|
| 0 5040 494558320 0 340694548 ... |
| user output |
|---|
| (empty) |
Test 5
Group: 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 892 638 599 966 429 655 1353 576 1140 1403 381 910 ... |
| correct output |
|---|
| 0 0 0 249098285 0 ... |
| user output |
|---|
| (empty) |
Test 6
Group: 5
Verdict: RUNTIME ERROR
| input |
|---|
| 1000 2000 1107 508 2000 1372 249 2000 588 65 2000 1739 78 ... |
| correct output |
|---|
| 750840601 678722180 744501884 159164549 868115056 ... |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 34, in <module>
print(int((play_move(list(range(1, n+1)), n, target_wins, target_losses, target_ties)*math.factorial(n)) % (math.pow(10, 9)+7)))
File "input/code.py", line 20, in play_move
suitable_games_count += play_move([x for x in available_moves if x != move], n, target_wins, target_losses, target_ties, wins+1 if is_win_move else wins, losses+1 if is_lose_move else losses, ties+1 if is_tie_move else ties)
File "input/code.py", line 20, in play_move
suitable_games_count += play_move([x for x in available_moves if x != move], n, target_wins, target_losses, target_ties, wins+1 if is_win_move else wins, losses+1 if is_lose_move else losses, ties+1 if is_tie_move else ties)
File "input/code.py", line 20, in play_move
suitable_games_count += play_move([x for x in available_moves if x != move], n, target_wins, target_losses, target_ties, wins+1 if is_win_move else wins, losses+1 if is_lose_move else los...