QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#741987 | #9620. osu!mania | TauLee01# | AC ✓ | 0ms | 3788kb | C++17 | 995b | 2024-11-13 15:35:09 | 2024-11-13 15:35:30 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
int val1[6] = {300, 300, 200, 100, 50, 0};
int val2[6] = {320, 300, 200, 100, 50, 0};
int ppmax;
int a[6];
void solve() {
cin >> ppmax;
for (int i = 0; i < 6; ++i) {
cin >> a[i];
}
int sum1 = 0, sum2 = 0;
int sum11 = 0, sum22 = 0;
for (int i = 0; i < 6; ++i) {
sum1 += a[i] * val1[i];
sum11 += a[i] * val2[i];
sum2 += a[i];
sum22 += a[i];
}
double acc = 1.*sum1 / (sum2 * 300);
double accp = 1.*sum11 / (sum22 * 320);
double pp = max(0.0, accp - 0.8) * 5 * ppmax;
acc *= 100;
cout << fixed << setprecision(2) << acc << "% ";
pp += 0.0000001;
cout << fixed << setprecision(0) << pp << "\n";
}
signed main() {
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int _ = 1;
cin >> _;
while (_--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3788kb
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