QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#739280 | #9620. osu!mania | Zhi_zI# | AC ✓ | 0ms | 3832kb | C++17 | 840b | 2024-11-12 21:19:28 | 2024-11-12 21:19:29 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve() {
double ppmax; //scanf("%d", &ppmax);
cin >> ppmax;
double a, b, c, d, e, f; // scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);
cin >> a >> b >> c >> d >> e >> f;
double sum = 300 * a + 300 * b + 200 * c + 100 * d + 50 * e;
double ans = sum / (300 * (a + b + c + d + e + f));
ans *= 100;
// printf("%.2lf", ans);
// ("%%");
double tmp = 320 * a + 300 * b + 200 * c + 100 * d + 50 * e;
tmp = tmp / (320 * (a + b + c + d + e + f));
tmp *= 100;
double res = max((double)0, tmp - 80) * 0.01 * 5 * ppmax;
// printf(" %.0lf\n",res);
cout << ans << '%' << ' ' << (int)(res + 0.50000000001) << '\n';
}
int main(void) {
int t = 1;
cout << fixed << setprecision(2);
// scanf("%d", &t);
cin >> t ;
while(t -- ) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3832kb
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