QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#153188#5607. Cribbage On SteroidsLamberlainMuliAC ✓16ms8300kbPython32.4kb2023-08-29 16:18:502023-08-29 16:18:50

Judging History

你现在查看的是最新测评结果

  • [2023-08-29 16:18:50]
  • 评测
  • 测评结果:AC
  • 用时:16ms
  • 内存:8300kb
  • [2023-08-29 16:18:50]
  • 提交

answer

n=int(input())
count=0
sets=[]
cards=[]
ranks=['A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K']
value={}
for rank in ranks:
    if rank == 'A':
        value[rank]=1
    elif rank in ['T','J','Q','K']:
        value[rank]=10
    else:
        value[rank]=int(rank)
        
while len(cards)!=n:
    new=[x for x in input().split()]
    cards=cards+new
    sets.append(new)
freq={}
freq_values={}
for card in cards:
    if card not in freq:
        freq[card]=1
    else:
        freq[card]+=1

for card in cards:
    if value[card] not in freq_values:
        if card == 'A':
            freq_values[1]=1
        elif card in ['T','J','Q','K']:
            freq_values[10]=1
        else:
            freq_values[int(card)]=1
    else:
        if card == 'A':
            freq_values[1]+=1
        elif card in ['T','J','Q','K']:
            freq_values[10]+=1
        else:
            freq_values[int(card)]+=1
            
for rank in ranks:
    if rank not in cards:
        freq[rank]=0
    if value[rank] not in freq_values:
        if rank=='A':
            freq_values[1]=0
        elif rank in ['T','J','Q','K']:
            freq_values[10]=0
        else:
            freq_values[int(rank)]=0
            
fifteens=[]
for i in range(2,16):
    def solve(j,i,sol,sm):
        global sols
        if j==i:
            if sm==15:
                fifteens.append(sol)
        elif sm>15:
            return
        else:
            mn=1 if len(sol)==0 else sol[-1]
            for k in range(mn,min(11,15-sm+1)):
                solve(j+1,i,sol+[k],sm+k)
    solve(0,i,[],0)
from math import *
points=0
fifteens.sort()
for fifteen in fifteens:
    comb_freq={}
    for num in fifteen:
        if num not in comb_freq:
            comb_freq[num]=1
        else:
            comb_freq[num]+=1
    if all([freq_values[x]>=comb_freq[x] for x in comb_freq.keys()]):
        p=1
        for y in comb_freq.keys():
            p*=comb(freq_values[y],comb_freq[y])
        points+=2*p
for card,f in freq.items():
    if f>=2:
        points+=f*(f-1)
start=0
while start<=10:
    mx=1
    for run in range(3,13-start+1):
        if all([(freq[ranks[start+i]]>0) for i in range(run)]):
            mx=run
    if mx>=3:
        prod=1
        for i in range(mx):
            prod*=freq[ranks[start+i]]
        points+=prod*mx
    start = start+mx        
print(points)

詳細信息

Test #1:

score: 100
Accepted
time: 5ms
memory: 8104kb

input:

5
4 5 6 5 5

output:

23

result:

ok single line: '23'

Test #2:

score: 0
Accepted
time: 12ms
memory: 8300kb

input:

13
A 2 3 4 5
6 7 8 9 T
J Q K

output:

71

result:

ok single line: '71'

Test #3:

score: 0
Accepted
time: 12ms
memory: 8148kb

input:

10
2 2 3 4 5 8 9 T J Q

output:

45

result:

ok single line: '45'

Test #4:

score: 0
Accepted
time: 4ms
memory: 8224kb

input:

5
5 5 5 5 J

output:

28

result:

ok single line: '28'

Test #5:

score: 0
Accepted
time: 10ms
memory: 8184kb

input:

5
5 5 5 5 5

output:

40

result:

ok single line: '40'

Test #6:

score: 0
Accepted
time: 11ms
memory: 8228kb

input:

11
A 2 3 5 6 7 8 T J Q K

output:

41

result:

ok single line: '41'

Test #7:

score: 0
Accepted
time: 12ms
memory: 8180kb

input:

20
A 2 3 4 5
A 2 3 4 5
A 2 3 4 5
A 2 3 4 5

output:

20308

result:

ok single line: '20308'

Test #8:

score: 0
Accepted
time: 3ms
memory: 8220kb

input:

7
9 6 5 A 4 7 8

output:

16

result:

ok single line: '16'

Test #9:

score: 0
Accepted
time: 8ms
memory: 8292kb

input:

11
Q K
2 2 2
3 3 3
A A
4

output:

224

result:

ok single line: '224'

Test #10:

score: 0
Accepted
time: 11ms
memory: 8164kb

input:

100
A A A A A A A A A A A A A A A A A A A A
A A A A A A A A A A A A A A A A A A A A
A A A A A A A A A A A A A A A A A A A A
A A A A A A A A A A A A A A A A A A A A
A A A A A A A A A A A A A A A A A A A A

output:

506676942699987180

result:

ok single line: '506676942699987180'

Test #11:

score: 0
Accepted
time: 16ms
memory: 8260kb

input:

100
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5

output:

333300

result:

ok single line: '333300'

Test #12:

score: 0
Accepted
time: 13ms
memory: 8296kb

input:

5
K J 2 6 8

output:

0

result:

ok single line: '0'

Test #13:

score: 0
Accepted
time: 11ms
memory: 8300kb

input:

7
T J J J Q K K

output:

32

result:

ok single line: '32'

Test #14:

score: 0
Accepted
time: 9ms
memory: 8220kb

input:

5
J Q K A 2

output:

3

result:

ok single line: '3'

Test #15:

score: 0
Accepted
time: 16ms
memory: 8292kb

input:

14
5 5
A 4
2 3
A 4
2 3
T J Q K

output:

438

result:

ok single line: '438'

Test #16:

score: 0
Accepted
time: 8ms
memory: 8188kb

input:

100
A T 4 K K J T 7 4 T Q A 5 K 8 T Q J K 5 3 8 A 9 3 4 7 J 5 7 K J 7 9 3 T 8 9 8 2 8 6 7 J T 6 6 4 5 K 9 6 5 K 5 J T A 4 3 A K 5 T Q T 6 K T 8 Q J K Q 8 A 6 9 5 7 K 3 2 5 Q J 4 T 2 7 2 9 2 T 9 4 5 9 5 5

output:

2440992624714

result:

ok single line: '2440992624714'

Test #17:

score: 0
Accepted
time: 11ms
memory: 8184kb

input:

100
K Q 3 K 9 5 5 7 A T K T 8 5 J 3 6 6 5 A 9 9 3 5 2 5 7 4 9 Q 9 4 9 A 2 T Q 2 K 3 4 4 9 8 K 3 K 5 A 2 Q 5 8 6 6 5 K 2 T 3 2 9 2 8 Q 3 A 6 4 K A 3 A 6 4 5 K A 6 4 3 T 3 Q 4 6 8 7 K 2 A J 3 8 5 K 5 A T 4

output:

1127283925810

result:

ok single line: '1127283925810'

Test #18:

score: 0
Accepted
time: 8ms
memory: 8156kb

input:

100
Q 6 6 A 8 J T T A 2 7 9 2 9 7 K T T 6 7 T 4 A K 2 T 8 T 5 Q J J 7 8 3 A 7 K A 8 J T J J T J 3 2 2 7 A K A J 6 7 6 Q 4 K 2 2 9 2 4 Q K 5 A T 2 6 5 A J 4 9 A Q 3 T A T 2 T 8 2 6 6 K 7 5 A 9 2 A T A 2 4

output:

1001732618498

result:

ok single line: '1001732618498'

Test #19:

score: 0
Accepted
time: 16ms
memory: 8188kb

input:

100
T J 9 2 T 5 3 Q J 6 Q 5 9 Q 4 8 K K 9 3 T Q 9 8 K 3 T A J K K 4 4 4 2 5 A A K A 3 K Q A 6 5 8 A A A 2 T 7 2 7 8 Q J A 8 3 9 2 9 7 7 Q 4 9 5 2 9 J 9 4 2 6 Q 4 2 3 7 5 7 5 7 8 3 9 8 2 Q Q T A A 2 4 6 3

output:

2636894652562

result:

ok single line: '2636894652562'

Test #20:

score: 0
Accepted
time: 10ms
memory: 8240kb

input:

100
J 5 Q 3 T J 8 2 T T 7 4 3 K 3 3 4 6 K T T 7 7 A K 8 9 7 7 K 2 K 2 Q K T 7 Q Q 4 9 3 3 4 5 J K T 3 6 4 5 Q 6 7 7 3 9 8 3 3 A T 3 Q 4 9 5 7 A 3 Q 4 6 J A A Q T A J J A 9 K 8 A A 2 6 T 4 T 9 J A 7 6 J 3

output:

1754378063080

result:

ok single line: '1754378063080'

Test #21:

score: 0
Accepted
time: 3ms
memory: 8148kb

input:

100
T 7 T 5 6 5 A K 7 8 8 K 6 5 5 8 9 Q 2 7 3 5 9 Q Q 9 Q 2 J 5 J 4 4 4 A 9 Q 5 4 5 6 3 5 3 6 T 5 Q J 8 7 4 A 2 8 2 6 T A 4 4 T 7 A T T 6 9 K 8 5 4 6 K 7 5 9 4 J A K 6 K 3 5 2 4 J 2 Q 6 8 J 9 7 8 6 J 6 2

output:

2519534370948

result:

ok single line: '2519534370948'