QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#750682 | #9620. osu!mania | ucup-team3519# | AC ✓ | 0ms | 3624kb | C++17 | 796b | 2024-11-15 15:28:07 | 2024-11-15 15:28:08 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = int64_t;
i64 fd(i64 x, i64 y) {
return (x * 2 + y) / (y * 2);
}
void solve() {
i64 ppmax;
i64 a, b, c, d, e, f;
std::cin >> ppmax;
std::cin >> a >> b >> c >> d >> e >> f;
i64 sum = a + b + c + d + e + f;
i64 acc = 300 * a + 300 * b + 200 * c + 100 * d + 50 * e;
acc = fd(acc * 10000, 300 * sum);
i64 pp = (320 * a + 300 * b + 200 * c + 100 * d + 50 * e - 4 * 64 * sum) * ppmax;
pp = fd(pp, 64 * sum);
pp = std::max(pp, (i64)0);
std::cout << acc / 100 << '.' << acc % 100 / 10 << acc % 10 << "% " << pp << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t;
std::cin >> t;
while (t--) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
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