QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#772264 | #9620. osu!mania | candy34# | AC ✓ | 0ms | 3976kb | C++20 | 934b | 2024-11-22 18:02:18 | 2024-11-22 18:02:18 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define ph push_back
#define pp pop_back
using namespace std;
const double eps=1e-8;
int T;
long double ppmax,a,b,c,d,e,f;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>T;
while(T--)
{
cin>>ppmax>>a>>b>>c>>d>>e>>f;
double ans1;
ans1=300.0*a+300.0*b+200.0*c+100.0*d+50.0*e;
ans1=ans1/300.0/(a+b+c+d+e+f);
ans1=ans1*100.0;
cout<<fixed<<setprecision(2)<<ans1<<"\% ";
double ans2;
ans2=320.0*a+300.0*b+200.0*c+100.0*d+50.0*e;
ans2=ans2/320.0/(a+b+c+d+e+f)-0.8;
if(ans2<0.0) ans2=0.0;
ans2=ans2*5.0*ppmax;
// cout<<ans2<<endl;
double res=(ans2+0.5);
int ans3=(int)res+1;
if(fabs(res-ans3)<eps) cout<<ans3<<endl;
else cout<<(int)res<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3976kb
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