QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#741767 | #9620. osu!mania | yzhx# | AC ✓ | 0ms | 3860kb | C++20 | 1.2kb | 2024-11-13 15:11:15 | 2024-11-13 15:11:16 |
Judging History
answer
#include <stdlib.h>
#include <iostream>
using namespace std;
using ll = long long;
const double eps = 1e-8;
void slove() {
int ppmax;
int a, b, c, d, e, f;
cin >> ppmax;
cin >> a >> b >> c >> d >> e >> f;
double pre = (double)a * 300.0 + (double)b * 300.0 + (double)c * 200.0 + (double)d * 100.0 + (double)e * 50.0;
double dow = (double)(a + b + c + d + e + f) * 300.0;
double acc = pre / dow;
acc *= 100.0;
// cout << acc << endl;
printf("%.2lf", acc);
cout << "% ";
pre = (double)a * 320.0 + (double)b * 300.0 + (double)c * 200.0 + (double)d * 100.0 + (double)e * 50.0;
dow = (double)(a + b + c + d + e + f) * 320.0;
double pp = max(0.0, pre / dow - 0.8);
pp = pp * 5.0 * (double)ppmax;
// printf("1: %.10lf\n", pp);
pp = pp + eps;
// cout << pp << endl;
// ll tmp = pp;
// if (tmp % 10 <= 4) tmp -= tmp % 10;
// else tmp += 10;
// tmp /= 10;
// printf("2: %.10lf\n", pp);
// cout << (int)(pp) << endl;
printf("%.0lf\n", (pp));
}
int main() {
int cnt = 1;
cin >> cnt;
while (cnt--) {
slove();
}
}
/*
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: 3860kb
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