QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#736758 | #9620. osu!mania | fresh_boy | AC ✓ | 0ms | 3728kb | C++14 | 889b | 2024-11-12 13:15:01 | 2024-11-12 13:15:02 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define For(i,a,b) for(i=a;i<=b;i++)
#define FOR(i,a,b) for(i=a;i>=b;i--)
#define o1 cout<<"Yes\n"
#define o0 cout<<"No\n"
using namespace std;
typedef long long i64;
typedef long double ldb;
const ldb eps = 1e-8;
void solve() {
ldb ppmax;
cin >> ppmax;
ldb a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
ldb tot = a + b + c + d + e + f;
ldb fz1 = 300 * (a + b) + 200 * c + 100 * d + 50 * e;
ldb fm1 = 300 * tot;
cout << fixed << setprecision(2) << fz1 * 100 / fm1 << "% ";
ldb fm2 = 320 * tot;
ldb fz2 = fz1 + 20 * a;
fz2 -= 256 * tot;
if (fz2 <= 0) {
cout << 0 << '\n';
}
else {
fz2 *= 5 * ppmax;
i64 ans = (fz2 / fm2) + 0.5 + eps;
cout << ans << '\n';
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
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: 3728kb
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