QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#767304 | #9620. osu!mania | OOBMABTRAMS# | AC ✓ | 0ms | 3792kb | C++17 | 645b | 2024-11-20 20:28:15 | 2024-11-20 20:28:29 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int N=1000013;
typedef long long ll;
typedef long double ld;
const ll INF=3e9;
const int P=998244353;
const ld eps=1e-10;
ll f[N],pw[10][200];
void solve(){
ll pm;cin>>pm;
ll a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e>>f;
ld ans1=300*a+300*b+200*c+100*d+50*e;
ans1/=3*(a+b+c+d+e+f);
printf("%.2Lf",ans1);
cout<<"% ";
ld ans2=320*a+300*b+200*c+100*d+50*e;
ans2/=320*(a+b+c+d+e+f);
ans2=ans2*5*pm-4*pm;
ans2=max(ans2,0.0l);
printf("%.0Lf",ans2);
cout<<'\n';
}
//
signed main(){
int T=1;cin>>T;
while(T--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3792kb
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