A - Automatic Judge

A - Automatic Judge

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. PresentationError(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. WrongAnswer(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. RuntimeError(RE) : Your program failed during the execution and you will receive the hints for the reasons.

5. TimeLimitExceeded(TLE) : Your program tried to run during too much time.

6. MemoryLimitExceeded(MLE): Your program tried to use more memory than the judge default settings.

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

8. CompilationError(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≤T≤20), denoting the number of test cases.
In each test case, there are two integers n(1≤n≤13) and m(1≤m≤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≤x≤1000+n) and two strings t(00:00≤t≤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

思路：判断题目编号是否为通过的题目，如果是通过的题目，那么就pass++，把这道题目标记，表示已经通过，然后再计算时间；如果题目没有通过，那么就记录题目WA的次数，这是来计算惩罚时间的，一次是20分钟，直到这个题目AC的时候，把提交题目的时间和惩罚时间加一起。

数组p是用来标记已经AC的题目

数组q是用来记录题目提交的次数，即WA的次数，以便于用来计算惩罚时间。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
using namespace std;
int p[1000];
int q[1000];
int main(){
	int T,n,m;
	int num;
	char t[100],s[100];
	cin>>T;
	while(T--){
		scanf("%d %d",&n,&m);
		int pass=0;
		int time=0;
		memset(p,0,sizeof(p));
		memset(q,0,sizeof(q));
		for(int i=0;i<m;i++){
			scanf("%d%s%s",&num,t,s);
			  int num1=num-1000;
			  if(p[num1]!=0)
			    continue;
			  if(s[0]=='A'){
			  	 p[num1]=1;
			  	 pass++;
			  	 time=time+(t[1]-'0')*60+(t[3]-'0')*10+t[4]-'0';
			  	 time=time+q[num1]*20;
			  }else{
			  	q[num1]++;
			  }
		}
		printf("%d %d\n",pass,time);
	}
	return 0;
}