A Contesting Decision
来源:互联网 发布:虚拟网络教学 编辑:程序博客网 时间:2024/05/16 07:08
J - A Contesting Decision
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu
Submit
Status
Description
Judging a programming contest is hard work, with demanding contestants, tedious decisions,and monotonous work. Not to mention the nutritional problems of spending 12 hours with only donuts, pizza, and soda for food. Still, it can be a lot of fun.
Software that automates the judging process is a great help, but the notorious unreliability of some contest software makes people wish that something better were available. You are part of a group trying to develop better, open source, contest management software, based on the principle of modular design.
Your component is to be used for calculating the scores of programming contest teams and determining a winner. You will be given the results from several teams and must determine the winner.
Scoring
There are two components to a team’s score. The first is the number of problems solved. The second is penalty points, which reflects the amount of time and incorrect submissions made before the problem is solved. For each problem solved correctly, penalty points are charged equal to the time at which the problem was solved plus 20 minutes for each incorrect submission. No penalty points are added for problems that are never solved.
So if a team solved problem one on their second submission at twenty minutes, they are charged 40 penalty points. If they submit problem 2 three times, but do not solve it, they are charged no penalty points. If they submit problem 3 once and solve it at 120 minutes, they are charged 120 penalty points. Their total score is two problems solved with 160 penalty points.
The winner is the team that solves the most problems. If teams tie for solving the most problems,then the winner is the team with the fewest penalty points.
Input
For the programming contest your program is judging, there are four problems. You are guaranteed that the input will not result in a tie between teams after counting penalty points.
Line 1 < nTeams >
Line 2 - n+1 < Name > < p1Sub > < p1Time > < p2Sub > < p2Time > … < p4Time >
The first element on the line is the team name, which contains no whitespace.Following that, for each of the four problems, is the number of times the team submitted a run for that problem and the time at which it was solved correctly (both integers). If a team did not solve a problem, the time will be zero. The number of submissions will be at least one if the problem was solved.
Output
The output consists of a single line listing the name of the team that won, the number of problems they solved, and their penalty points.
Sample Input
4
Stars 2 20 5 0 4 190 3 220
Rockets 5 180 1 0 2 0 3 100
Penguins 1 15 3 120 1 300 4 0
Marsupials 9 0 3 100 2 220 3 80
Sample Output
Penguins 3 475
#include<stdio.h>#include<string.h>int main(){ int n,i,j; char wname[99],name[99]; int time,num,max=0,maxs; scanf("%d",&n); for(i=0;i<n;i++) { int s=0,count=0; scanf("%s",wname);//输入名称 for(j=0;j<4;j++) { scanf("%d%d",&num,&time); if(time!=0)//将提交成功的题目统计 { count++; s=s+time+(num-1)*20; } } if(count>max||(count==max&&s<maxs))//擂台算法更新数据 { max=count;strcpy(name,wname);maxs=s; } } printf("%s %d %d",name,max,maxs);}
- A Contesting Decision
- A Contesting Decision - 1581
- ZOJ1764 A Contesting Decision
- A Contesting Decision
- POJ 1581 A Contesting Decision
- POJ 1581 A Contesting Decision
- HDU 1304 A Contesting Decision
- A Contesting Decision 简单排序题
- 模拟 POJ-1581 A Contesting Decision
- POJ 1581 A Contesting Decision 水
- 杭电1304 A Contesting Decision
- (DS1.5.4)POJ 1581 A Contesting Decision(结构体排序)
- 《数据结构编程实验》 1.5.4A Contesting Decision
- 杭电-1304A Contesting Decision(结构体)
- poj1581A Contesting Decision
- POJ-1581 A Contesting Decision-模拟ACM比赛时的评分规则
- Starting From A Decision.
- I have made a decision
- GlassFish的domain管理
- 翻译可以如此简单
- 借助 Lucene.Net 构建站内搜索引擎(下)
- pixhawk博客导读
- Trunk(端口汇聚)的概念与设置
- A Contesting Decision
- 大一暑期集训训练赛一
- java学习笔记,认识java
- 常见的java面试的基础问题
- socket编程之select多路复用
- Python——11面向对象编程基础
- 小丑排序
- 关于Trunk、Hybrid、Access、Tag、Untag、Pvid的关系
- java判断是否为手机号