hdu 6023 模拟

题目：

Automatic Judge

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 928    Accepted Submission(s): 370

Problem 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.  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
  
  

代码：比赛开始脑子犯浑WA了2发 背锅。。。

#include<stdio.h>
#include<iostream>
using namespace std;

int t,n,m;
int a[15];
bool f[15];
char b[10],c[10],d[10];

int main(){//15MS	1668K
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n+1;++i){
            a[i]=0; f[i]=false;
        }
        while(m--){
            scanf("%s %s %s",b,c,d);
            //printf("%s %s %s\n",b,c,d);
            int tmp=(b[2]-'0')*10+(b[3]-'0');
            //cout<<tmp<<endl;
            if(d[0]=='A'){
                if(f[tmp]) continue;
                f[tmp]=true;
                int shi=((c[0]-'0')*10+(c[1]-'0'))*60;
                int fen=(c[3]-'0')*10+(c[4]-'0');
                //cout<<shi<<"  "<<fen<<endl;
                a[tmp]+=shi+fen;
            }
            else if(f[tmp]) continue;
            else{
                a[tmp]+=20;
            }
        }
        int ans=0;
        int cnt=0;
        for(int i=1;i<=n;++i){
            //cout<<a[i]<<endl;
            if(f[i]) cnt++,ans+=a[i];//比赛中f[i]写成了a[i],狂WA不止...应该判AC而非提交
        }
        printf("%d %d\n",cnt,ans);
    }
    return 0;
}

队友代码：(简洁得多啊Orz。。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
const double PI=acos(-1.0);
const double eps=1e-6;
const int INF=1000000000;
const int maxn=100;
int T,n,m;
bool h[25];
int ca[25];
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		memset(h,0,sizeof(h));
		memset(ca,0,sizeof(ca));
		int t=0;
		scanf("%d%d",&n,&m);
		int ans=0;
		while(m--)
		{
			int a,b,c;
			string s;
			scanf("%d %02d:%02d",&a,&b,&c);
			cin>>s;
			a=a-1000;
			if(h[a])continue;
			if(s=="AC")
			{
				t++;
				h[a]=1;
				ans+=ca[a]*20+b*60+c;
			}
			else ca[a]++;
		}
		printf("%d %d\n",t,ans);
	}
	return 0;
}