QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#741210 | #9620. osu!mania | 123BVN | AC ✓ | 0ms | 3796kb | C++23 | 842b | 2024-11-13 13:49:17 | 2024-11-13 13:49:17 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
void solve() {
int Acc,a, b, c, d, e, f,ppmax,pp;
cin >> ppmax;
cin >> a >> b >> c >> d >> e >> f;
int x, y;
x = 300 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f;
y = 300 * (a + b + c + d + e + f);
printf("%.2f", x*100.0 / y);
cout << "% ";
x = 320 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f - 8 * 32 * (a + b + c + d + e + f);
x = max(0ll, x);
x = x * 5 * ppmax;
y = 320 * (a + b + c + d + e + f);
x *= 100;
x =x/y;
if (x / 10 % 10 >= 5) {
x /= 100;
x++;
}
else {
x /= 100;
}
printf("%lld", x);
cout << endl;
}
signed main() {
int _ = 1;
cin >> _;
while (_--) {
solve();
}
}
/*
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: 3796kb
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