Codeforces Round #334 (Div. 2) A. Uncowed Forces
2016-01-09 19:00
127 查看
A. Uncowed Forces
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
output
input
output
Note
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.
解题报告:Codeforces Round #334 Editorial
题意
给你CF的积分规则,然后告诉你一个人的每道题的提交时间,
已经wa了几发,以及hack成功和hack失败次数 , 问你最后得了多少分
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
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
Note
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.
解题报告:Codeforces Round #334 Editorial
题意
给你CF的积分规则,然后告诉你一个人的每道题的提交时间,
已经wa了几发,以及hack成功和hack失败次数 , 问你最后得了多少分
相关文章推荐
- java 导出excel
- In MySQL, a zero number equals any string
- MySQL 学习用employee数据库表参考使用
- bomb 多对多关系 查询问题:1)查询用户A所订阅的所有频道 2)查询订阅了频道B的所有用户
- JMS - ExceptionListener
- 事件处理和消息响应
- button按钮不可点击
- IE的体系和webrowser
- Linux下openoffice+swftools安装教程
- Java抽象类用法示例详解
- eclipse 开发web项目步骤
- 给shell脚本中加上执行日志
- 自己定义progressdialog,改善用户体验
- 分享一些第三方组件和开源的库
- 结合win32和MFC
- 网络流之最大流算法模板EK
- 【Java】Java数据结构和算法(一)
- iOS framework 制作教程
- 秒杀多线程第八篇 经典线程同步 信号量Semaphore
- Sicily 1790. Single Round Match