QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #741213 | #9620. osu!mania | ATM12345# | AC ✓ | 0ms | 3828kb | C++17 | 960b | 2024-11-13 13:49:26 | 2024-11-13 13:49:26 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define LL long long
#define ls p<<1
#define rs p<<1|1
#define Ma 1000005
#define mod 1000000007
#define PLL pair<ll,ll>
#define PDD pair<double,double>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fi first
#define se second
#define N 61
#define pb push_back
#define ld long double
#define all(x) x.begin(),x.end()
#define inf 1e18
using namespace std;
ll a,b,c,d,e,f;
ll pm;
char s='%';
void sol()
{
cin>>pm>>a>>b>>c>>d>>e>>f;
ld res=(300*a+300*b+200*c+100*d+50*e)*1.0/3/(a+b+c+d+e+f);
ll sum=(320*a+300*b+200*c+100*d+50*e)*5*pm,div=320*(a+b+c+d+e+f);
ll dis=4*pm;
ll ans=sum/div;
if ((sum%div)*2>=div)
ans++;
ans-=dis;
ans=max(0ll,ans);
printf("%.2Lf%c %lld\n",res,s,ans);
return;
}
int main()
{
IOS
ll tt=1;
cin>>tt;
while (tt--)
sol();
return 0;
}
/*
2
630
3029 2336 377 41 10 61
3000
20000 10000 0 0 0 0
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3828kb
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