|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||1||1||1||100.000%|
Beach Volleyball is a very popular game to play at the beach.1 You form teams of two or more players on each side, and try to hit a ball back and forth. In reality, you usually just hope that whatever random person is hit by the ball is shorter than you, or won’t get too angry.
When you play Volleyball somewhat more seriously, you try to keep track of a score. You get points if the ball bounces in your opponents’ court, or they hit it out of bounds, or touch it too often. Scorekeeping is a tedious chore — there is really no reason to do it by hand. So we will write a program which will figure out the score given the sequence of what happened.
Here’s a refresher of volleyball rules. Only the team that is serving can score points, and they do so if they win the volley. If they lose the volley, then the other team doesn’t get a point yet, but they do get to serve next. (If the serving team wins the volley, they continue to serve.) There are several ways to lose a volley:2
So given a sequence of who touched the ball, our goal is to find out the current score (notice that “touching” the ball may include serving it). We also should output an error message if at any point in time, the wrong team served.
1Hence the name.
2We will ignore effects of the net here, as well as a few other details, including the fact that the person serving the ball must normally rotate.
The first line contains a number K ≥ 1, which is the number of input data sets in the file. This is followed by K data sets of the following form:
The first line of a data set contains three numbers n1, n2,t with 2 ≤ n1, n2 ≤ 10. n1 and n2 are the numbers of players on Team A and Team B (notice that these need not be equal, or even close), and 1 ≤ t ≤ 1000 is the length of the sequence of “ball touches”.
The second line is a sequence of t “ball touches”, separated by one empty space, as follows:
The first “ball touch” is always a number, representing the person who served first.
We also promise you that the input will never contain impossible sequences (except wrong serves). For instance, you won’t have the sequence “1 X X”, where the ball bounced twice outside when really, some team should have been serving it for the third touch.
For each data set, first output “Data Set x:” on a line by itself, where x is its number. Then, output the score of the two teams, separated by a single white space. If at any point during the sequence, a player from the wrong team served, output “Wrong Serve” instead of the score.
3 3 3 6 1 2 5 A 4 X 2 2 20 1 3 4 3 1 2 1 2 3 1 2 4 A 4 2 4 1 2 X 3 6 6 5 10 1 2 B 7
Data Set 1: 0 1 Data Set 2: 0 2 Data Set 3: Wrong Serve