QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#762960 | #9620. osu!mania | lonelywolf# | AC ✓ | 0ms | 3928kb | C++20 | 989b | 2024-11-19 17:29:57 | 2024-11-19 17:30:03 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[] = {300, 300, 200, 100, 50, 0};
int b[] = {320, 300, 200, 100, 50, 0};
int c[6];
void solve() {
int ppmax;
cin >> ppmax;
int sum = 0;
for(int i = 0; i < 6; ++i) {
cin >> c[i];
sum += c[i];
}
int p = 0;
for(int i = 0; i < 6; ++i)
p += a[i] * c[i];
double ans1 = 1.0f * p / sum / 3;
cout << ans1 << "% ";
p = 0;
for(int i = 0; i < 6; ++i)
p += b[i] * c[i];
double tmp = max(0.0, 1.0 * p / sum / 320 - 0.8);
double ans2 = tmp * 5 * ppmax;
// cout << ans2 << '\n';
cout << (int)(ans2 + 0.500001) << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(2);
int t = 1;
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: 3928kb
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