F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Spade 7

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 139    Accepted Submission(s): 3


Problem Description
Spade 7, or ¡°Bie Qi¡± in Chinese, is a popular card game using a standard deck of fifty-two cards - The deck consists of four suits of thirteen cards each, coded and sequenced as A (regarded as 1), 2, 3, 4, 5, 6, 7, 8, 9, 10, J (regarded as 11), Q (regarded as 12), and K (regarded as 13). The four suits are club (C), heart (H), spade (S), and diamond (D).
Spade 7 is so easy and funny that can be well suited for any ages, No matter a primary school student or a card game expert, even professional bridge masters are addicted to the spade7. And it allows three to seven players playing together.
These are the rules of Spade 7 in a four-player game:
1.Each player receives thirteen cards.
2.The owner of Spade 7 begins by discarding it. Then the players take turns in anti-clockwise order.
3.In each turn, the player needs to discard one valid card, or fold one card when and only when he does not have any valid cards. A valid card is either a 7 of any suits, or touching another card (with the same suit and the difference between their codes is exactly one) which has been discarded by any player in previous turns.
4.The game ends when nobody has cards in his hands.
Every time someone folds a card, he receives penalty points equals to the code of this card. The goal for each player is, to minimize his penalty points.
As pacifists, Alice and three of her best friends are tired of fighting with each other. So they want to try their best to minimize the sum of all four players¡¯ penalty points. Can you help her figure out the best result?
 

Input
The input begins with a line containing an integer T (1 ¡Ü T ¡Ü 20), the number of test cases.
Each test case contains four lines, describing the cards owned by four players at the beginning, one player per line. The four players are given in anti-clockwise order.
Each line contains thirteen strings, separated by spaces. Each string describes one card in the follow format:
1.The string is represented as ¡°suit¡± + ¡°code¡±.
2.The ¡°suit¡± is a character C (for club) or H (for heart) or S (for spade) or D (for diamond).
3.The ¡°code¡± can be A (regarded as 1), 2, 3, 4, 5, 6, 7, 8, 9, 10, J (regarded as 11), Q (regarded as 12), or K (regarded as 13).
4.NO SPACE between the ¡°suit¡± and the ¡°code¡±.
 

Output
For each test case, output only one line -- the minimum sum of all four players¡¯ penalty points.
 

Sample Input
1 HA H2 H3 H4 H5 H6 H7 H8 H9 H10 HJ HQ HK CA C2 C3 C4 C5 C6 C7 C8 C9 C10 CJ CQ CK SA S2 S3 S4 S5 S6 S7 S8 S9 S10 SJ SQ SK DA D2 D3 D4 D5 D6 D7 D8 D9 D10 DJ DQ DK
 

Sample Output
0
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 12:07:19, Gzip enabled