QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#737989 | #9620. osu!mania | Aicu123 | AC ✓ | 0ms | 3944kb | C++20 | 1.1kb | 2024-11-12 17:21:15 | 2024-11-12 17:21:15 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define fi first
#define se second
//cout<<setiosflags(ios::fixed)<<setprecision(K);
const int dx[4]={1,-1,0,0};
const int dy[4]={0,0,1,-1};
const double eps=1e-9;
const double PI=acos(-1.0);
const int inf=1e9+7;
const int mod=998244353;
const int N=2e5+10,M=N<<1;
int iround(db x){
}
void solve(){
int mx;
cin>>mx;
int a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e>>f;
int tot=a+b+c+d+e+f;
int s1=300*a+300*b+200*c+100*d+50*e;
int s2=320*a+300*b+200*c+100*d+50*e;
db acc=1.0*s1/(300*tot);
db p=1.0*s2/(320*tot)*5*mx;
int l=floor(p);
int r=l+1;
int sl=l*320*tot;
int sr=r*320*tot;
int cur=s2*5*mx;
int pp=l;
if(sr-cur<=cur-sl){
pp=r;
}
pp-=4*mx;
pp=max(0,pp);
cout<<setiosflags(ios::fixed)<<setprecision(2);
acc*=100;
cout<<acc<<'%'<<' '<<pp<<'\n';
}
signed main(){
ios::sync_with_stdio(false);
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: 3944kb
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