QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#737004 | #9620. osu!mania | ucup-team059# | AC ✓ | 0ms | 3776kb | C++20 | 929b | 2024-11-12 14:14:06 | 2024-11-12 14:14:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i32 = int32_t;
using i64 = long long;
using ldb = long double;
using vi = vector<int>;
using pii = pair<int,int>;
void solve(){
int ppmax;
cin >> ppmax;
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
ldb acc = (300.0 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (300.0 *(a + b + c + d + e + f));
ldb tpp = (320.0 * a + 300 * b + 200 * c + 100 * d + 50 * e) * 5 * ppmax / (320.0 * (a + b + c + d + e + f));
i64 pp = max(0ll, i64(round(tpp)) - 4ll * ppmax);
// cout << fixed << setprecision(20) << max((ldb)0, tpp - 0.8) * 5 * ppmax << "\n";
// cout << i64(0.5 + max((ldb)0, tpp - 0.8) * 5 * ppmax) << "\n";
cout <<fixed << setprecision(2) << acc*100.0 << "% " << pp << "\n";
return;
}
i32 main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int T;
cin >> T;
while(T --)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3776kb
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