QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#741817 | #9620. osu!mania | ShiroRinne# | AC ✓ | 0ms | 3904kb | C++20 | 1.0kb | 2024-11-13 15:17:13 | 2024-11-13 15:17:13 |
Judging History
answer
#include <bits/stdc++.h>
#define endl '\n'
using ll = long long;
constexpr int N = 2e5 + 10;
constexpr int mod = 998244353;
constexpr double eps = 1e-9;
using namespace std;
void solve(){
int ppmax;
cin >> ppmax;
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
double fz, fm;
fz = 300 * a + 300 * b + 200 * c + 100 * d + 50 * e;
fm = 300 * (a + b + c + d + e + f);
cout << fixed << setprecision(2) << (fz * 100.0 / fm) << "% ";
fz = 320 * a + 300 * b + 200 * c + 100 * d + 50 * e;
fm = 320 * (a + b + c + d + e + f);
double pp = max(0.0, fz / fm - 0.8) * 5.0 * ppmax;
double l1 = ceil(pp);
double l2 = l1 - 1;
if (l1 - pp - (pp - l2) <= eps) {
cout << fixed << setprecision(0) << l1 << endl;
}else {
cout << fixed << setprecision(0) << l2 << endl;
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
cin >> t;
while(t--) solve();
return 0;
}
/*
2
630
3029 2336 377 41 10 61
3000
20000 10000 0 0 0 0
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3904kb
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