I have a dream that one day in the foyer of the ACM/ICPC World Finals Contest,
I could solve all the problems and be the champion.But things always went beyond
my mind,we just solved for problems.
We submitted Problem B at 29 minutes and got “Accept”,we passed Problem A at
85 minutes, then we got “Wrong”at 94 minutes on Problem G, but we soon got
“Accept”at 98 minutes,then we submitted Problem D but got “Wrong”……At last,
we passed Problem ABCG,and Problem D was still “Wrong”.
Now I have to write a summary about the contest,Iread our submission states from
PC^2,and I need to list the
<o:p></o:p>
The first line of input is one integer T(T≤100)，giving the number of test cases in the input.Each test case starts with a line containing a positive integer N(N≤100),representing the number of the submission states.In the next N lines each line contains an integer t(0≤t≤300),the submission time.Then a character(from 'A'to'J'),the ID of submission problem follows.At last is a string("Accept" or "Wrong"),the states of this submission.
For each test case,output two lines,the first line print "Accept",follow by a colon,a space,then list the name of those accept problems in alphabetical ascending order,if there is no "Accept" problem(what a shame!),just leaves it blank.The second line is about"Wrong" states,the style of which is similar to the first line.Print a blank line after each test case.
