Task: | Kortit II |
Sender: | jokeri2222 |
Submission time: | 2024-11-04 22:46:07 +0200 |
Language: | Python3 (PyPy3) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
#4 | WRONG ANSWER | 0 |
#5 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.05 s | 1, 2, 3, 4, 5 | details |
#2 | TIME LIMIT EXCEEDED | -- | 2, 3, 4, 5 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3, 4, 5 | details |
#4 | RUNTIME ERROR | 0.23 s | 4, 5 | details |
#5 | RUNTIME ERROR | 0.08 s | 5 | details |
#6 | RUNTIME ERROR | 0.08 s | 5 | details |
Code
from itertools import permutations, islice, combinations import math def permutation(l, n): return next(islice(permutations(l), n, None), None) t = int(input()) vals = [] for test in range(t): vals.append(map(int, input().split())) for test in range(t): n, a, b = vals[test] if a + b == 1 or a + b > n: print(0) continue possibles = 0 apb = a+b _fac = math.factorial(apb)-1 for draws in combinations(range(n), n - a - b): pairs = list(range(n)) for draw in draws[::-1]: pairs.pop(draw) i=_fac while i>0: perm = permutation(pairs, i) A = B = 0 for j, (pair1, pair2) in enumerate(zip(pairs, perm)): if pair2 - pair1 < 0: A += 1 elif pair2 - pair1 > 0: B += 1 if A>a or B>b: i-=math.factorial(apb-j)-1 break if A == a and B == b: possibles += 1 i-=1 possibles = possibles * math.factorial(n) % 1000000007 print(possibles)
Test details
Test 1
Group: 1, 2, 3, 4, 5
Verdict: WRONG ANSWER
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: TIME LIMIT EXCEEDED
input |
---|
284 6 1 0 5 0 2 7 1 5 7 7 5 ... |
correct output |
---|
0 0 35280 0 36720 ... |
user output |
---|
(empty) |
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: RUNTIME ERROR
input |
---|
1000 15 12 6 7 1 6 44 4 26 6 6 5 ... |
correct output |
---|
0 5040 494558320 0 340694548 ... |
user output |
---|
0 5040 |
Error:
Traceback (most recent call last): File "input/code.py", line 27, in <module> perm = permutation(pairs, i) File "input/code.py", line 4, in permutation return next(islice(permutations(l), n, None), None) ValueError: Indicies for islice() must be None or non-negative integers
Test 5
Group: 5
Verdict: RUNTIME ERROR
input |
---|
1000 892 638 599 966 429 655 1353 576 1140 1403 381 910 ... |
correct output |
---|
0 0 0 249098285 0 ... |
user output |
---|
0 0 0 |
Error:
Traceback (most recent call last): File "input/code.py", line 27, in <module> perm = permutation(pairs, i) File "input/code.py", line 4, in permutation return next(islice(permutations(l), n, None), None) ValueError: Indicies for islice() must be None or non-negative integers
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 27, in <module> perm = permutation(pairs, i) File "input/code.py", line 4, in permutation return next(islice(permutations(l), n, None), None) ValueError: Indicies for islice() must be None or non-negative integers