QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#760370 | #9620. osu!mania | Afterlife# | AC ✓ | 1ms | 3660kb | C++20 | 778b | 2024-11-18 16:32:53 | 2024-11-18 16:32:54 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll rnd(ll a,int b) {
if(a < 0) return 0;
ll c = a / b;
if(abs(1LL * c * b - a) >= abs(1LL * (c + 1) * b - a)) c++ ;
return c;
}
void solv() {
int pm ;
int a,b,c,d,e,f;
cin >> pm >> a >> b >> c >> d >> e >> f;
int acc = rnd(10000LL * (300 * a + 300 * b + 200 * c + 100 * d + 50 * e) , 300 * (a + b + c + d + e + f)) ;
int s = a + b + c + d + e + f;
int pp = rnd(5LL * pm * (320*a+300*b+200*c+100*d+50*e - 256 * s) , 320 * s) ;
cout << (acc / 100) << "." << (acc / 10)%10 << (acc % 10) << "% " ;
cout << pp << '\n' ;
return ;
}
int main() {
ios::sync_with_stdio(false) ; cin.tie(0) ;
int t;cin >> t;
while(t--) solv() ;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3660kb
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