QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#742640 | #9620. osu!mania | RWeakest# | AC ✓ | 0ms | 3892kb | C++17 | 974b | 2024-11-13 16:59:34 | 2024-11-13 16:59:40 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll T, ppmax;
ll acc[6] = {300, 300, 200, 100, 50, 0};
ll pp[6] = {320, 300, 200, 100, 50, 0};
ll num[6];
void solve() {
cin >> ppmax;
for (int i = 0; i <= 5; i++) cin >> num[i];
ll acc1 = 0, acc2 = 0, pp1 = 0, pp2 = 0;
for (int i = 0; i <= 5; i++) {
acc1 += num[i] * acc[i];
acc2 += num[i] * 300;
pp1 += num[i] * pp[i];
pp2 += num[i] * 320;
}
double ans1 = 100.0 * acc1 / acc2;
double a2 = max(0.0, 1.0 * pp1 / pp2 - 0.8) * 5 * ppmax + 1e-8;
cout << std::fixed << setprecision(2) << ans1 << "% ";
cout << std::fixed << setprecision(0) << a2 << "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr), std::cout.tie(nullptr);
cin >> T;
while (T--) {
solve();
}
return 0;
}
/*
2
630
3029 2336 377 41 10 61
3000
20000 10000 0 0 0 0
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3892kb
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