QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#771640 | #9620. osu!mania | estrellad# | AC ✓ | 0ms | 3840kb | C++20 | 689b | 2024-11-22 14:49:02 | 2024-11-22 14:49:03 |
Judging History
answer
// dzx
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N=1e5+5;
const int M=1e5+5,P=998244353,INF=1e18;
typedef pair<int,int> PII;
#define fi first
#define se second
int p,a,b,c,d,e,f;
void solve(){
cin>>p>>a>>b>>c>>d>>e>>f;
double res1=100*(1.0*300*a+300*b+200*c+100*d+50*e)/(300*(a+b+c+d+e+f));
double res2=max(0.0,5*p*(1.0*320*a+300*b+200*c+100*d+50*e)/(320*(a+b+c+d+e+f))-5*p*0.8);
cout<<fixed<<setprecision(2)<<res1<<"% ";
cout<<(int)(res2+0.5)<<endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int _T=1;
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: 3840kb
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