CodeForces】604A - Uncowed Forces
2016-07-21 23:20
239 查看
Description
Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin was uncowed and bulldozed
through all of them, distinguishing himself from the herd as the best cowmputer scientist in all of Bovinia. Kevin knows his submission time for each problem, the number of wrong submissions that he made on each problem, and his total numbers of successful
and unsuccessful hacks. Because Codeforces scoring is complicated, Kevin wants you to write a program to compute his final score.
Codeforces scores are computed as follows: If the maximum point value of a problem is x, and Kevin submitted correctly at minute mbut
made w wrong submissions, then his score on that problem is
.
His total score is equal to the sum of his scores for each problem. In addition, Kevin's total score gets increased by 100 points for each successful hack, but gets decreased by 50 points
for each unsuccessful hack.
All arithmetic operations are performed with absolute precision and no rounding. It is guaranteed that Kevin's final score is an integer.
Input
The first line of the input contains five space-separated integers m1, m2, m3, m4, m5,
where mi (0 ≤ mi ≤ 119) is the time of Kevin's
last submission for problem i. His last submission is always correct and gets accepted.
The second line contains five space-separated integers w1, w2, w3, w4, w5,
where wi (0 ≤ wi ≤ 10) is Kevin's number of wrong
submissions on problem i.
The last line contains two space-separated integers hs and hu (0 ≤ hs, hu ≤ 20),
denoting the Kevin's numbers of successful and unsuccessful hacks, respectively.
Output
Print a single integer, the value of Kevin's final score.
Sample Input
Input
Output
Input
Output
Hint
In the second sample, Kevin takes 119 minutes on all of the problems. Therefore, he gets
of
the points on each problem. So his score from solving problems is
. Adding in 10·100 = 1000points
from hacks, his total score becomes 3930 + 1000 = 4930.
代码如下:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int max(int x,int y)
{
if(x<y)
return y;
else
return x;
}
struct p{
int m;
int w;
}arr[6];
int main()
{
int x[5]={500,1000,1500,2000,2500};
while(~scanf("%d%d%d%d%d",&arr[0].m,&arr[1].m,&arr[2].m,&arr[3].m,&arr[4].m))
{
scanf("%d%d%d%d%d",&arr[0].w,&arr[1].w,&arr[2].w,&arr[3].w,&arr[4].w);
int q,p;
scanf("%d%d",&q,&p);
int sum=0;
for(int i=0;i<5;i++)
{
sum+=max(3*x[i]/10,(1*x[i]-x[i]*arr[i].m/250)-50*arr[i].w);
}
sum+=100*q-50*p;
printf("%d\n",sum);
}
}
Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin was uncowed and bulldozed
through all of them, distinguishing himself from the herd as the best cowmputer scientist in all of Bovinia. Kevin knows his submission time for each problem, the number of wrong submissions that he made on each problem, and his total numbers of successful
and unsuccessful hacks. Because Codeforces scoring is complicated, Kevin wants you to write a program to compute his final score.
Codeforces scores are computed as follows: If the maximum point value of a problem is x, and Kevin submitted correctly at minute mbut
made w wrong submissions, then his score on that problem is
.
His total score is equal to the sum of his scores for each problem. In addition, Kevin's total score gets increased by 100 points for each successful hack, but gets decreased by 50 points
for each unsuccessful hack.
All arithmetic operations are performed with absolute precision and no rounding. It is guaranteed that Kevin's final score is an integer.
Input
The first line of the input contains five space-separated integers m1, m2, m3, m4, m5,
where mi (0 ≤ mi ≤ 119) is the time of Kevin's
last submission for problem i. His last submission is always correct and gets accepted.
The second line contains five space-separated integers w1, w2, w3, w4, w5,
where wi (0 ≤ wi ≤ 10) is Kevin's number of wrong
submissions on problem i.
The last line contains two space-separated integers hs and hu (0 ≤ hs, hu ≤ 20),
denoting the Kevin's numbers of successful and unsuccessful hacks, respectively.
Output
Print a single integer, the value of Kevin's final score.
Sample Input
Input
20 40 60 80 100 0 1 2 3 4 1 0
Output
4900
Input
119 119 119 119 119 0 0 0 0 0 10 0
Output
4930
Hint
In the second sample, Kevin takes 119 minutes on all of the problems. Therefore, he gets
of
the points on each problem. So his score from solving problems is
. Adding in 10·100 = 1000points
from hacks, his total score becomes 3930 + 1000 = 4930.
代码如下:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int max(int x,int y)
{
if(x<y)
return y;
else
return x;
}
struct p{
int m;
int w;
}arr[6];
int main()
{
int x[5]={500,1000,1500,2000,2500};
while(~scanf("%d%d%d%d%d",&arr[0].m,&arr[1].m,&arr[2].m,&arr[3].m,&arr[4].m))
{
scanf("%d%d%d%d%d",&arr[0].w,&arr[1].w,&arr[2].w,&arr[3].w,&arr[4].w);
int q,p;
scanf("%d%d",&q,&p);
int sum=0;
for(int i=0;i<5;i++)
{
sum+=max(3*x[i]/10,(1*x[i]-x[i]*arr[i].m/250)-50*arr[i].w);
}
sum+=100*q-50*p;
printf("%d\n",sum);
}
}
相关文章推荐
- scala基础21-伴生类和伴生对象相互访问
- Greenplum中装载和卸载数据
- hdu_5738_Eureka(脑洞)
- ACM--学生排队--HDOJ 1297--Children’s Queue--大数
- hdoj 1028 Ignatius and the Princess III <递归+状态记录优化----母函数????>
- 影视娱乐1-俄剧-实习医生
- mysql数据库改名的三种方法
- java的注释
- .NET Core采用的全新配置系统[4]: “Options模式”下各种类型的Options对象是如何绑定的?
- PHP 一致性Hash
- 相机标定:关于用Levenberg-Marquardt算法在相机标定中应用
- Java模拟计算器
- React Native 特定平台选择-Platform
- js 自动补全
- 彻底搞懂Spring类加载(注解方式)
- JavaScript简单例子之DOM动态获取年月日下拉框
- Java 网络I/O模型
- webBench&ad网站并发测试工具
- 面试题2:实现Singleton模式
- linphone-LinphoneManager.java文件分析