HDU
来源:互联网 发布:淘宝麦麦网 编辑:程序博客网 时间:2024/06/07 07:03
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 stringst(00:00≤t≤05:00) and s, denoting the team submits problemx at time t, and the result is s. t is in the format of HH:MM, whiles 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 thet 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比赛规则。
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
bool guo[25];//判断是否AC
int it[25];//每题未AC前 错的次数
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(guo,0,sizeof(guo));
memset(it,0,sizeof(it));
int sum=0;
int n,m;
scanf("%d%d",&n,&m);
int time=0;
while(m--)
{
int a,b,c;
string s;
scanf("%d %02d:%02d",&a,&b,&c);
cin>>s;
a-=1000;
if(guo[a]) continue;
if(s=="AC")
{
sum++;
guo[a] = 1;
time += it[a]*20 + b*60 + c;//时间
}
else
{
it[a]++;
}
}
cout<<sum<<" "<<time<<endl;
}
}
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- mount.nfs: an incorrect mount option was specified
- 递归与分治策略-2.9.2线性时间选择(取中位数的中位数基准)(第k小问题)
- 数组重排 hiho一下第167周
- 记录我的Java学习经历(1)
- 【QT】对象模型(对象树)
- HDU
- 阿里iconfont官网提供的矢量图标用法介绍
- 网狐荣耀版棋牌中心服务器显示“服务启动失败”的原因
- 运维之系统服务篇------2.linux扩展应用 、 vim编辑技巧 、 发布网络YUM源 、 源码编译安装
- HTTP协议学习笔记
- Linux常用操作命令(一)
- 高性能服务器开发复习
- 有恒事竟成
- HDU