QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#777904 | #9620. osu!mania | tjf4# | AC ✓ | 0ms | 3772kb | C++20 | 1017b | 2024-11-24 10:57:12 | 2024-11-24 10:57:13 |
Judging History
answer
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
typedef long double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pii;
typedef vector<pii> vii;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<char> vc;
const int inf=0x3f;
const int N=1e6+10;
const db eps=1e-9;
ll ppmax,a,b,c,d,e,f;
ll ceii(db w) {
ll c1=w;
ll c2=(w+1);
db d1=c1,d2=c2;
if((d2-w)-(w-d1)<eps) return c2;
return c1;
}
int main() {
int T;
cin>>T;
while(T--) {
cin>>ppmax;
cin>>a>>b>>c>>d>>e>>f;
db Acc=1.0*(300*a+300*b+200*c+100*d+50*e)/(300*(a+b+c+d+e+f));
db acc=1.0*(320*a+300*b+200*c+100*d+50*e)/(320*(a+b+c+d+e+f));
db w=acc-0.8; if(w<0) w=0;
db pp=w*5*ppmax;
ll w_Acc=ceii(Acc*10000);
Acc=w_Acc/100.0;
printf("%.2Lf",Acc);
cout<<"% ";
ll ans=ceii(pp);
printf("%lld\n",ans);
}
return 0;
}
//2
//630
//3029 2336 377 41 10 61
//3000
//20000 10000 0 0 0 0
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3772kb
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