QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#742408 | #9620. osu!mania | miyou379# | AC ✓ | 0ms | 3856kb | C++17 | 822b | 2024-11-13 16:34:06 | 2024-11-13 16:34:08 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = int64_t;
using uint = uint32_t;
using u64 = uint64_t;
#define all(x) x.begin(), x.end()
#define LF '\n'
using namespace std;
void Solution() {
u64 ppmax;
u64 a, b, c, e, d, f;
cin >> ppmax >> a >> b >> c >> d >> e >> f;
u64 x = 300 * a + 300 * b + 200 * c + 100 * d + 50 * e;
u64 y = (a + b + c + d + e + f);
// cout << x << ' ' << 300 * y << '\n';
u64 A = 320 * a + 300 * b + 200 * c + 100 * d + 50 * e;
long double pp = max(0.0L, (1.0L * A / 320.0 / y - 0.8L) * 5 * ppmax);
cout << fixed << setprecision(2) << (x*1.0L / y / 3) << "% " << u64(pp + 0.5L) << LF;
}
signed main(void) {
cin.tie(nullptr)->ios::sync_with_stdio(false);
int _T = 1;
cin >> _T; cin.get();
while (_T--) {
Solution();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3856kb
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