QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#744022#9620. osu!manialwj1239AC ✓0ms3756kbC++111012b2024-11-13 20:36:532024-11-13 20:36:56

Judging History

你现在查看的是最新测评结果

  • [2024-11-13 20:36:56]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3756kb
  • [2024-11-13 20:36:53]
  • 提交

answer

#define  _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define int long long
#define sc scanf
#define pr printf
#define endl '\n'
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;

const int INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1 * 1e6 + 10;

int d[4][2] = {
	{-1, 0}, {1, 0}, {0, -1}, {0, 1}
};

void solve() {
	double pp;
	double a;
	double b;
	double c;
	double d;
	double e;
	double f;

	scanf("%lf%lf%lf%lf%lf%lf%lf", &pp, &a, &b, &c, &d, &e, &f);

	double ans1 = (300 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (3 * (a + b + c + d + e + f));
	double ans2 = max((320 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (320 * (a + b + c + d + e + f)) - 0.8l, 0.0l) * 5 * pp;
	cout << fixed << setprecision(2) << ans1 << "% " << (int)(ans2 + 0.50001) << '\n';
}

signed main()
{
	int T = 0;

	sc("%d", &T);

	while (T--) {
		solve();
	}

	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3756kb

input:

18
1279
4624 4458 1109 220 103 314
753
3604 3204 391 33 9 29
807
5173 3986 763 84 29 96
718
576 461 60 5 2 7
947
4058 3268 764 169 42 158
568
2660 1731 161 16 6 15
641
4181 3126 656 56 10 43
630
3029 2336 377 41 10 61
529
1991 1354 181 11 9 5
1802
8321 2335 115 19 11 27
1645
3965 1087 41 6 1 13
1688...

output:

91.54% 543
97.40% 543
95.75% 523
97.12% 513
93.38% 499
98.16% 444
96.19% 430
96.20% 423
97.74% 400
99.19% 1604
99.38% 1482
99.14% 1465
98.53% 1251
100.00% 2688
100.00% 1792
100.00% 3000
52.78% 0
0.00% 0

result:

ok 18 lines