Uncowed Forces Codeforces Round #334
2016-07-21 15:16
162 查看
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 m but 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 = 1000 points from hacks, his total score becomes 3930 + 1000 = 4930.
#include<stdio.h>
#include<algorithm>
using namespace std;
struct node
{
int t;
int w;
}st[130];
int main()
{
int i,j;
int m[5]={500,1000,1500,2000,2500};
while(scanf("%d%d%d%d%d",&st[0].t,&st[1].t,&st[2].t,&st[3].t,&st[4].t)!=EOF)
{
for(i=0;i<5;i++)
scanf("%d",&st[i].w);
int h1,h2;
scanf("%d%d",&h1,&h2);
int sum;
sum=0;
for(i=0;i<5;i++)
{
sum+=max(3*m[i]/10,(1*m[i]-st[i].t*m[i]/250)-50*st[i].w);
}
sum+=h1*100-h2*50;
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 m but 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 = 1000 points from hacks, his total score becomes 3930 + 1000 = 4930.
#include<stdio.h>
#include<algorithm>
using namespace std;
struct node
{
int t;
int w;
}st[130];
int main()
{
int i,j;
int m[5]={500,1000,1500,2000,2500};
while(scanf("%d%d%d%d%d",&st[0].t,&st[1].t,&st[2].t,&st[3].t,&st[4].t)!=EOF)
{
for(i=0;i<5;i++)
scanf("%d",&st[i].w);
int h1,h2;
scanf("%d%d",&h1,&h2);
int sum;
sum=0;
for(i=0;i<5;i++)
{
sum+=max(3*m[i]/10,(1*m[i]-st[i].t*m[i]/250)-50*st[i].w);
}
sum+=h1*100-h2*50;
printf("%d\n",sum);
}
}
相关文章推荐
- 通过局域网安装centos6.4
- servlet的开发流程介绍
- 关于Git中SSH出现的Permission denied (publickey)问题
- C语言笔记
- Patrick and Shopping
- cannot open shared object file: No such file or director解决方案
- EL表达式及${对象}
- [置顶] 模式识别(Pattern Recognition)学习笔记(三十六)-- 动态聚类算法
- 定时任务基本概念
- 在线程中建立Form遇到的问题
- [Doc ID 1666646.1]如何使用功能管理员清除缓存?
- leetcode237
- 关于宏和函数、内联函数的一些区别
- 文件下载不能使用ajax的替代解决方案
- Jquery 事件冒泡的介绍以及如何阻止事件冒泡
- Android 让自定义TextView的drawableLeft与文本一起居中
- Spring Boot - 构建Spring Boot系统及相关配置详解
- 【理解JVM】 深入分析Java ClassLoader原理
- 筛法求素数
- 简述Java命令行参数、JVM、打包Java程序、JAR文件