QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#788332 | #9620. osu!mania | Godwang# | AC ✓ | 0ms | 3912kb | C++23 | 1.4kb | 2024-11-27 16:35:05 | 2024-11-27 16:35:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define endl '\n'
#define ll long long
#define pb push_back
const int N=1e6+10;
//////////////////
int tt;
double ppmax,a,b,c,d,e,f;
/////////////////
/////////////////
void init()
{
}
/////////////////
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// freopen("ain.txt","r",stdin);freopen("aout.txt","w",stdout);
cin>>tt;
while (tt--)
{
cin>>ppmax>>a>>b>>c>>d>>e>>f;
double acc=1.0*(300*a+300*b+200*c+100*d+50*e)/(300*(a+b+c+d+e+f));
acc*=100;
cout<<fixed<<setprecision(2)<<acc;
cout<<"% ";
double pp=1.0*(320*a+300*b+200*c+100*d+50*e)/(320*(a+b+c+d+e+f))-0.8;
if(pp<0)
{
cout<<0;
}
else
{
pp*=5*ppmax;
//
//cout<<pp<<endl;
ll temp=pp;
ll anss=pp;
double ans=1.0*anss;
pp-=ans;
// cout<<pp;
if(abs(pp-0.5)<1e-7)
{
anss++;
}
else
{
ll zhi=round(pp);
anss+=zhi;
}
cout<<anss;
}
cout<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3912kb
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