Codeforces Round #334 (Div. 2) A. Uncowed Forces 水题

最新推荐文章于 2025-08-21 10:38:03 发布

weixin_30883311

最新推荐文章于 2025-08-21 10:38:03 发布

阅读量90

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/qscqesze/p/5012784.html

本文介绍了一个基于Codeforces比赛规则的得分计算问题。通过输入选手的提交时间、错误提交次数及成功的和不成功的hack数量，文章提供了一种精确计算最终得分的方法，并附带了C++实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. Uncowed Forces

Time Limit: 20 Sec

Memory Limit: 256 MB

题目连接

http://codeforces.com/contest/604/problem/A

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 $\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 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

20 40 60 80 100
0 1 2 3 4
1 0

Sample Output

HINT

题意

给你CF的积分规则，然后告诉你一个人的每道题的提交时间，已经wa了几发，以及hack成功和hack失败次数

问你最后得了多少分

题解：

水题，唯一注意的一点就是，不要直接用题目给你的公式，会挂精度的

代码：

#include<iostream>
#include<math.h>
#include<stdio.h>
using namespace std;


int m[10];
int w[10];
int main()
{
    for(int i=1;i<=5;i++)
        cin>>m[i];
    for(int i=1;i<=5;i++)
        cin>>w[i];
    int H,IH;
    cin>>H>>IH;
    int ans = 0;
    for(int i=1;i<=5;i++)
        ans+=max((150*i),(250-m[i])*i*2-50*w[i]);
    ans+=100*H - 50*IH;
    cout<<ans<<endl;
}