RAFANOLE - Nadal vs Djokovic

Rafael Nadal vs Novak Djokovic is probably the fiercest rivalry in tennis right now. Now your task is very simple. You are given a string containing the scores of a single set (a set consists of many games) between these two stalwarts. N denotes Nadal and D denoted Djokovic. For those who are new to tennis, have a look of the rules online. Anyway small description about the rules:

Now how a player wins a single game?

In a game scores are incremented as follows: 15, 30, 40. A player wins if scores are like 40-0, 40-15, 40-30. If tied at 40-40, it is called deuce. If N wins next he has an advantage and if he loses the next volley he comes back to deuce. After advantage if the player wins the next volley he wins that game.

Simply put the player who wins 6 games first (provided he has won two games more than his opponent) wins the set. For example, 6-1, 6-2, 6-3, 6-4 are all valid.

If 1 player has won 6 games and the other has won 5 games the match continues. (7-5 is also a valid scoreline.)

If both the players are deadlocked at 6-6, then we have a tiebreaker. In the tiebreaker the scores are counted normally (1, 2, 3...) The person who reaches 7 points first and is at least 2 more than his opponent wins the set. Example: 7-0, 7-1, 7-2 ... 7-5 are valid. If the score is 7-6 the match proceeds until one of the players scores two points more than the other, for example: even 10-8 is valid.

Input

1st line - number of test cases

Next T lines consist of strings denoting who won a volley.

Output

Output the winner, their score, and the tie breaker score if any in the first line.

Output the loser and their score on the second line.

See the sample out for the required formatting.

Example

Input:
2
N N N N N N N N N N N N N N N N N N N N D D D D D D D D N N N N
D D D D N N N N D D D D N N N N D D D D N N N N D D D D N N N N D D D D N N N N D D D D N N N N D D D D D D N N N N N D

Output:
N 6
D 2
D 7 (7-5)
N 6

Added by:n.7n
Date:2013-10-21
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own

hide comments
2019-11-13 02:25:17
Cool problem. Breaking down the scoring rules for the purpose of generalizing the solution makes one realize how unnecessarily complicated the traditional calls are: my solving function is 21 lines in Python despite ifelsing and uses only 5 variables.

Try BOWLING1 if you enjoyed this. And if you don't find tennis exciting, look up Camila Giorgi.
2017-01-16 15:06:10 Vipul Srivastava
No blank line after each test case in the output.
2014-09-02 00:39:13 Faiz Malik
My 100th AC in 1st go :)
2014-02-27 11:39:22 n.7n
Tricky case for those who get WA:
Input:
N N N N D D D D N N N N D D D D N N N N D D D D N N N N D D D D N N N N D D D D N D N D N D N D N D N N D N D N D N D N D N D D N D N D N D N D N D N D N D N D N N
Output:
N 7 (10-8)
D 6
2014-02-06 15:32:46 Gaara
AC on first attempt easy one..:) just follow the rule no rocket science and beware of taking input takeit using getline thanx to @Kimi Räikkönen

Last edit: 2014-02-06 15:33:14
2014-01-19 17:32:39 |RAMSDEN|
@author can u pls chk my soln id 10900959
getting wrong answer
2013-12-18 18:54:58 anurag garg
lots of condition......
2013-11-16 20:29:18 n.7n
@ Deven : All input test cases shall be assumed to be valid.

Last edit: 2013-11-13 15:34:13
2013-11-16 20:29:18 albertg
My 100th AC :)
2013-11-16 20:29:18 Deven
Would the Input be till end of the Match only ??

Or will some extra things can also be given and the program should recognise it by itself that the match is over and it should stop.??
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.