Uncowed Forces
2016-07-21 20:13
239 查看
D - Uncowed Forces
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
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 = 1000 points
from hacks, his total score becomes 3930 + 1000 = 4930.
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
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
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.
相关文章推荐
- 使用 Arrays 类操作 Java 中的数组
- Qt之QSizePolicy
- CodeForces615ABulbs(水题)
- 第一章-部署NetScaler VPX10.5服务器
- Patrick and Shopping
- Java 中的Synchronizer
- Codeforces 80B Depression
- 2016夏季练习——二叉树
- QSizePolicy
- Qt之QSizePolicy
- Qt之QSizePolicy
- Leetcode 190. Reverse Bits (Easy) (cpp)
- nagios系列(三)之nagios被动监控模式之添加系统负载load、swap、磁盘iostat及memory内存监控详解
- 2016ACM多校训练第一场_1001_Abandoned Country 并查集+DFS
- nodejs express项目结构分析(windows)
- HDU 1016 Prime Ring Problem 素数环 搜索
- Volley、XUtils、Fson框架
- POJ1236 图的一个连通性问题
- 设计模式之策略模式
- 简单的应用调用驱动