QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#743691 | #9620. osu!mania | BaseAI# | AC ✓ | 0ms | 4016kb | C++23 | 886b | 2024-11-13 19:49:36 | 2024-11-13 19:49:36 |
Judging History
answer
#include<bits/stdc++.h>
#define double long double
using namespace std;
const double eps = 1e-8;
int sign(double x) {
if(fabs(x) < eps) return 0;
return (x < 0) ? -1 : 1;
}
int dcmp(double x,double y) {
return sign(x - y);
}
double g(double x) {
double r = x - (int)x;
if(dcmp(r, 0.5) < 0) return floor(x);
return ceil(x);
}
void solve() {
double ppmax;
double a,b,c,d,e,f;
cin >> ppmax >> a >> b >> c >> d >> e >> f;
double Acc = (300*a + 300*b + 200*c + 100*d + 50*e) / (300*(a + b + c + d + e + f)) * 100;
double zero = 0;
double pp = max(zero, (320*a + 300*b + 200*c + 100*d + 50*e)/(320*(a + b + c + d + e + f)) - 0.8) * 5 * ppmax;
//cout << round(pp) << "\n";
printf("%.2Lf%% %.0Lf\n",g(Acc*100.0)/100.0, g(pp));
}
int main()
{
int T;
cin >> T;
while(T--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 4016kb
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