QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#738046 | #9620. osu!mania | wxy2005# | AC ✓ | 0ms | 3840kb | C++14 | 697b | 2024-11-12 17:33:40 | 2024-11-12 17:33:44 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(i=j;i<=k;++i)
#define dow(i,j,k) for(i=j;i>=k;--i)
#define LL long long
int main(){
//freopen("in.txt","r",stdin);
int T;
scanf("%d",&T);
while(T--){
long long ppmax,a,b,c,d,e,f;
scanf("%lld",&ppmax);
scanf("%lld%lld%lld%lld%lld%lld",&a,&b,&c,&d,&e,&f);
LL up=10000ll*(300*a+300*b+200*c+100*d+50*e)+150*(a+b+c+d+e+f);
LL down=300*(a+b+c+d+e+f);
printf("%lld.%02lld%% ",up/down/100,up/down%100);
up=320*a+300*b+200*c+100*d+50*e-256*(a+b+c+d+e+f);
if(up<0)printf("0\n");
else{
up*=5*ppmax;
up+=160*(a+b+c+d+e+f);
down=320*(a+b+c+d+e+f);
printf("%lld\n",up/down);
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3840kb
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