Automatic Judge

Description

Welcome to HDU to take part in the second CCPC girls’ competition! 
A new automatic judge system is used for this competition. During the five-hour contest time, you can submit your code to the system, then the judge will reply you. Here is a list of the judge's replies and their meaning:

1. $Accepted (AC) $: Yes, your program is correct. You did a good job!

2. $Presentation Error (PE)$ : Your program's output format is not exactly the same as required by the problem, although the output is correct. This usually means the existence of omitted or extra blank characters (white spaces, tab characters and/or new line characters) between any two non-blank characters, and/or blank lines (a line consisting of only blank characters) between any two non-blank lines. Trailing blank characters at the end of each line and trailing blank lines at the of output are not considered format errors. Check the output for spaces, blank lines, etc. against the problem's output specification.

3. $Wrong Answer (WA)$ : Correct solution not reached for the inputs. The inputs and outputs that we use to test the programs are not public (it is recomendable to get accustomed to a true contest dynamic :-)

4. $Runtime Error (RE)$ : Your program failed during the execution and you will receive the hints for the reasons.

5. $Time Limit Exceeded (TLE)$ : Your program tried to run during too much time.

6. $Memory Limit Exceeded (MLE) $: Your program tried to use more memory than the judge default settings.

7. $Output Limit Exceeded (OLE) $: Your program tried to write too much information. This usually occurs if it goes into a infinite loop.

8. $Compilation Error (CE) $: The compiler fails to compile your program. Warning messages are not considered errors. Click on the judge's reply to see the warning and error messages produced by the compiler.

For each submission, if it is the first time that the judge returns ``AC'' on this problem, then it means you have passed this problem, and the current time will be added to the penalty of your team. In addition, every time you pass a problem, each unsuccessful try for that problem before is counted as 20 minutes penalty, it should also be added to the penalty of your team. 
Now given the number of problems in the contest and the submission records of a team. Please write a program to calculate the number of problems the team passed and their penalty.

 

Input

The first line of the input contains an integer $T(1\leq T\leq20)$, denoting the number of test cases. 
In each test case, there are two integers $n(1\leq n\leq 13)$ and $m(1\leq m\leq 100)$ in the first line, denoting the number of problems and the number of submissions of a team. Problems are labeled by 1001, 1002, ..., $1000+n$. 
In the following $m$ lines, each line contains an integer $x(1001\leq x\leq 1000+n)$ and two strings $t(00:00\leq t\leq 05:00)$ and $s$, denoting the team submits problem $x$ at time $t$, and the result is $s$. $t$ is in the format of HH:MM, while $s$ is in the set \{AC, PE, WA, RE, TLE, MLE, OLE\}. The team is so cautious that they never submit a CE code. It is guaranteed that all the $t$ in the input is in ascending order and every $t$ is unique. 

 

Output

For each test case, print a single line containing two integers $A$ and $B$, denoting the number of problems the team passed and the penalty. 

 

Sample Input

1

3 5

1002 00:02 AC

1003 00:05 WA

1003 00:06 WA

1003 00:07 AC

1002 04:59 AC

 

Sample Output

2 49

 

 

 

题目意思：基本就是ACM比赛的判题机制吧，但是有点不一样的是一道题只有最后AC了，才会增加罚时，没有ＡＣ的题不增加罚时

 

上代码：

 

 

 #include<stdio.h>
 #include<algorithm>
 #include<string.h>
 using namespace std;
 struct messages
 {
     int id;//题号
     int h;//时
     int m;//分
     char s[];//状态
 } a[];
 int ac[];//用来标记是否ac过,ac了代表1,不ac代表0
 int time[];
 int main()
 {
     int t,n,m,i,sum,count;
     scanf("%d",&t);
     while(t--)
     {
         sum=;
         count=;
         memset(time,,sizeof(time));
         memset(ac,,sizeof(ac));
         scanf("%d%d",&n,&m);
         for(i=; i<m; i++)
         {
             scanf("%d",&a[i].id);
             scanf("%d:%d",&a[i].h,&a[i].m);
             scanf(" %s",a[i].s);
             if(ac[a[i].id]==)//用来过滤掉那些已经ac的题目
             {
                 continue;
             }
             if(a[i].s[]=='A')
             {
                 time[a[i].id]+=a[i].h*+a[i].m;
                 ac[a[i].id]=;
             }
             else
             {
                 time[a[i].id]+=;
             }
             getchar();
         }
         for(i=; i<=+n; i++)//采用了类似哈希的方法
         {
             if(ac[i])
             {
                 sum+=time[i];
                 count++;
             }
         }
         printf("%d %d\n",count,sum);
     }
     return ;
 }