QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#746222 | #9620. osu!mania | IllusionaryDominance# | AC ✓ | 0ms | 3816kb | C++20 | 864b | 2024-11-14 13:53:28 | 2024-11-14 13:53:31 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T;
cin >> T;
while(T--)
{
ll ppmax;
cin >> ppmax;
ll a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
ll acc1 = 300ll*a+300ll*b+200ll*c+100ll*d+50ll*e;
ll acc2 = 300ll*(a+b+c+d+e+f);
acc1*=100ll;
ll pp1 = 320ll*a+300ll*b+200ll*c+100ll*d+50ll*e;
ll pp2 = 320ll*(a+b+c+d+e+f);
pp1 -= (320ll*4/5)*(a+b+c+d+e+f);
pp1 = max(0ll, pp1);
pp1 *= 5ll; pp1 *= ppmax;
cout << fixed << setprecision(2) << (double)(acc1)/acc2 << "% ";
cout << fixed << setprecision(0) << (double)(pp1)/pp2 << "\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3816kb
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