CodeForces - 604A Uncowed Forces

最新推荐文章于 2021-10-04 20:17:46 发布

每个人都该翩翩起舞

最新推荐文章于 2021-10-04 20:17:46 发布

阅读量171

点赞数

分类专栏： ACM CF

本文链接：https://blog.csdn.net/qq_29538137/article/details/79226717

版权

ACM 同时被 2 个专栏收录

32 篇文章 0 订阅

订阅专栏

23 篇文章 0 订阅

订阅专栏

题目链接：http://codeforces.com/problemset/problem/604/A

题意：计算CF得分

思路：照做就是

AC代码：

#include <bits/stdc++.h>
#include<map>
#include<iostream>
#include<set>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int a[MAXN];

int main() {
	int m1, m2, m3, m4, m5, w1, w2, w3, w4, w5, hs, hu;
	scanf("%d %d%d %d %d%d %d %d %d %d %d %d", &m1, &m2, &m3, &m4, &m5, &w1, &w2, &w3, &w4, &w5, &hs, &hu);
	double sum = 0;
	sum += max(0.3 * 500, (1 - 1.0*m1 / 250) * 500 - 50 * w1) + max(0.3 * 1000, (1 - 1.0*m2 / 250) * 1000 - 50 * w2);
	sum += max(0.3 * 1500, (1 - 1.0*m3 / 250) * 1500 - 50 * w3) + max(0.3 * 2000, (1 - 1.0*m4 / 250) * 2000 - 50 * w4) + max(0.3 * 2500, (1 - 1.0*m5 / 250) * 2500 - 50 * w5);
	sum += 100 * hs - 50 * hu;
	printf("%.0lf\n", sum);
	return 0;
}