QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#772596 | #9620. osu!mania | CodyLee# | AC ✓ | 0ms | 3852kb | C++23 | 958b | 2024-11-22 20:36:05 | 2024-11-22 20:36:09 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cout << #x << " = " << x << "\n";
#define jiasu ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long LL;
typedef pair<LL, LL> PLL;
const LL N = 1e6 + 1;
const LL M = 2020;
const LL mod = 1e9 + 7;
void solve()
{
LL ppmax;
cin >> ppmax;
LL a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
long double acc = (300.0 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (300.0 *(a + b + c + d + e + f));
long double tpp = (320.0 * a + 300 * b + 200 * c + 100 * d + 50 * e) * 5 * ppmax / (320.0 * (a + b + c + d + e + f));
LL pp = max(0ll, LL(round(tpp)) - 4ll * ppmax);
cout <<fixed << setprecision(2) << acc*100.0 << "% " << pp << "\n";
return;
}
// abbba
int main()
{
jiasu;
int t = 1;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
cin >> t;
while (t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3852kb
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