QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#766679 | #9620. osu!mania | qmqcbhc | AC ✓ | 1ms | 3956kb | C++20 | 940b | 2024-11-20 18:11:50 | 2024-11-20 18:11:51 |
Judging History
answer
#include<bits/stdc++.h>
#define test(i) cout << #i << " "<< i << " " << endl;
#define endl '\n'
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
const int N=2e5+5;
ll t,n;
void fio(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void print(double a1,ll a2){
a1*=100;
printf("%.2lf",a1);
cout << "%" << " ";
cout << a2;
cout << endl;
}
void solve(){
ll pp;
cin >> pp;
ll a[10],b[]={300,300,200,100,50,0};
ll c[]={320,300,200,100,50,0};
for(int i=0; i<6; i++){
cin >> a[i];
}
long double ans1=0,ans2=0;
ll tmp=0;
for(int i=0; i<6; i++){
ans1+=a[i]*b[i];
tmp+=a[i];
}
for(int i=0; i<6; i++){
ans2+=a[i]*c[i];
}
ans1/=tmp*300;
ans2=ans2*5.0*pp;
ans2/=320.0*tmp;
ans2=max(0ll,ll(round(ans2)-4*pp));
print(ans1,ans2);
}
signed main()
{
//fio();
cin >> t;
//t=1;
while(t--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3956kb
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