QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#741148 | #9620. osu!mania | ucup-team4074# | AC ✓ | 0ms | 3620kb | C++14 | 916b | 2024-11-13 13:35:23 | 2024-11-13 13:35:25 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
void solve();
signed main() {
fast
int t = 1;
cin >> t;
while (t--) solve();
}
int ppmax, a, b, c, d, e, f;
int freq(int a, int b){
int res = a / b;
if(a % b * 2 >= b) res++;
return res;
}
void solve() {
cin >> ppmax >> a >> b >> c >> d >> e >> f;
int acc_a = 300 * a + 300 * b + 200 * c + 100 * d + 50 * e;
int acc_b = 300 * (a + b + c + d + e + f);
acc_a *= 10000;
int acc = freq(acc_a, acc_b);
int pp_b = 320 * (a + b + c + d + e + f);
int pp = max(0ll, freq((320 * a + 300 * b + 200 * c + 100 * d + 50 * e - pp_b / 5 * 4) * 5 * ppmax, pp_b));
cout << acc / 100 << '.';
if(acc % 100 < 10) cout << 0 << acc % 100;
else cout << acc % 100;
cout << '%' << ' ' << pp << '\n';
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
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