【 CodeForces 604A】B - 特别水的题2-Uncowed Forces

最新推荐文章于 2021-05-23 22:19:59 发布

转载最新推荐文章于 2021-05-23 22:19:59 发布 · 166 阅读

Kevin Sun 在 Codeforces Round #334 中展现了出色的表现，通过所有问题并计算最终得分。文章详细介绍了比赛规则、计分方式以及如何通过正确的提交时间和错误提交次数来计算总分数。同时，考虑到了成功和失败的黑客攻击对分数的影响。

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=102271#problem/B

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 $\text{[math]}$ . 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 m₁, m₂, m₃, m₄, m₅, where m_i (0 ≤ m_i ≤ 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 w₁, w₂, w₃, w₄, w₅, where w_i (0 ≤ w_i ≤ 10) is Kevin's number of wrong submissions on problem i.

The last line contains two space-separated integers h_s and h_u (0 ≤ h_s, h_u ≤ 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 $\text{[math]}$ 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<algorithm>
#define maxx 10
using namespace std;
long long hu,hs;
double x[maxx]={500, 1000, 1500, 2000, 2500},w[maxx],score,m[maxx];
int main(){
    for(int i=0;i<5;i++)
        scanf("%lf",&m[i]);
    for(int i=0;i<5;i++)
        scanf("%lf",&w[i]);
    scanf("%lld%lld",&hs,&hu);
    for(int i=0;i<5;i++)
        score+=max(0.3*x[i],(1-m[i]/250)*x[i]-50*w[i]);
    score+=100*hs-50*hu;
    printf("%.0f\n",score);//.0f实际上是四舍五入，但是题目保证了答案一定是整数
    return 0;
}

或者

#include<stdio.h>
#include<algorithm>
#define maxx 10
using namespace std;
long long x[maxx]={500, 1000, 1500, 2000,2500},w[maxx],score,m[maxx],hu,hs;
int main(){
    for(int i=0;i<5;i++)
        scanf("%lld",&m[i]);
    for(int i=0;i<5;i++)
        scanf("%ldd",&w[i]);
    scanf("%lld%lld",&hs,&hu);
    for(int i=0;i<5;i++)
        score+=max(x[i]*3/10,(x[i]-m[i]*x[i]/250)-50*w[i]);
    score+=100*hs-50*hu;
    printf("%lld\n",score);
    return 0;
}