QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#778519 | #9620. osu!mania | Yoshinow2001# | AC ✓ | 1ms | 3720kb | C++20 | 1.0kb | 2024-11-24 15:03:13 | 2024-11-24 15:03:13 |
Judging History
answer
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main(){
fastio;
int tc;cin>>tc;
while(tc--){
long long ppmax,a,b,c,d,e,f;
cin>>ppmax>>a>>b>>c>>d>>e>>f;
double acc=(double)(30*a+30*b+20*c+10*d+5*e)/(30*(a+b+c+d+e+f));
cout<<fixed<<setprecision(2)<<acc*100<<"\%"<<' ';
long long pp=(64*a+44*b-56*c-156*d-206*e-256*f)*5*ppmax;
pp=max(pp,0ll);
if(pp==0)cout<<0<<endl;
else{
long long m=320*(a+b+c+d+e+f);
long long lst=pp%m;
if(2*lst>=m)cout<<pp/m+1<<endl;
else cout<<pp/m<<endl;
}
// cout<<(int)round(pp/(320*(a+b+c+d+e+f)))<<endl;
// double pp=(double)/(320*(a+b+c+d+e+f));
// pp=max(0.0,pp)*5*ppmax;
// cout<<fixed<<setprecision(10)<<pp<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3720kb
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