• CF div2 334 A


    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 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 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.

     让你按照CF计算分数的方式计算得分。。。。

     1 #include <cstdio>
     2 #include <cstring>
     3 #include <iostream>
     4 #include <stack>
     5 #include <queue>
     6 #include <map>
     7 #include <algorithm>
     8 #include <vector>
     9 
    10 using namespace std;
    11 
    12 const int maxn = 200005;
    13 
    14 typedef long long LL;
    15 
    16 vector<int>G[maxn];
    17 
    18 double a[6] = {500,1000,1500,2000,2500};
    19 
    20 
    21 
    22 
    23 int main()
    24 {
    25    double w[6];
    26     double  t[6];
    27 
    28    for(int i=0;i<5;i++){
    29     cin>>t[i];
    30 
    31    }
    32 
    33      for(int i=0;i<5;i++)
    34     cin>>w[i];
    35 
    36 
    37   int c,h;
    38   cin>>c>>h;
    39   double ans = 0;
    40   for(int i=0;i<5;i++){
    41     ans += max(0.3*a[i],((1-t[i]/250)*a[i]) - 50*w[i]);
    42   }
    43   ans += 100*c + (-50)*h;
    44   cout<<ans<<endl;
    45 
    46 
    47 
    48     return 0;
    49 }
    View Code
  • 相关阅读:
    页面打开 抛出w3wp.exe 中发生未处理异常
    link
    带下拉子菜单的导航菜单
    横向列表菜单
    Codeforces Round #640 (Div. 4)
    【剑指Offer】06. 从尾到头打印链表
    【剑指Offer】65. 不用加减乘除做加法
    【剑指Offer】15. 二进制中1的个数
    【剑指Offer】03. 数组中重复的数字(哈希)
    【LeetCode】50. Pow(x, n)(快速幂)
  • 原文地址:https://www.cnblogs.com/lmlyzxiao/p/5019060.html
Copyright © 2020-2023  润新知