QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#787728 | #9620. osu!mania | Lonelyper# | AC ✓ | 0ms | 3876kb | C++17 | 1.2kb | 2024-11-27 14:16:41 | 2024-11-27 14:16:42 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<int> pp_nums={320,300,200,100,50,0};
vector<int> acc_nums={300,300,200,100,50,0};
void cal_acc(vector<int> scores)
{
int child=0;
int count=0;
for(int i=0;i<acc_nums.size();++i)
{
child+=acc_nums[i]*scores[i];
count+=scores[i];
}
int mom=count*300ll;
double rst=(double)child/(double)mom;
rst*=100.0;
cout<<fixed<<setprecision(2)<<rst<<'%';
}
void cal_pp(vector<int> scores,int ppmax)
{
int child=0;
int count=0;
for(int i=0;i<pp_nums.size();++i)
{
child+=pp_nums[i]*scores[i];
count+=scores[i];
}
int mom=count*320ll;
long long temp=child*5ll*ppmax;
long long rst=temp/mom;
if((temp%mom)*2ll>=mom)
++rst;
rst-=4ll*ppmax;
if(rst<0)
rst=0;
cout<<rst;
}
void Lonelyper(){
int ppmax;
cin>>ppmax;
int a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e>>f;
vector<int> scores={a,b,c,d,e,f};
cal_acc(scores);
cout<<' ';
cal_pp(scores,ppmax);
cout<<endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while(t --) Lonelyper();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3876kb
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