QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#754114 | #9620. osu!mania | steph_hl | AC ✓ | 0ms | 4060kb | C++23 | 1.2kb | 2024-11-16 14:14:57 | 2024-11-16 14:14:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll __int128
#define PII pair<int,int>
#define endl '\n'
#define mk make_pair
#define IOS ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
#define Pi acos(-1.0)
#define ull unsigned long long
int ls(int p){ return (p << 1) ;}
int rs(int p){ return (p << 1 | 1) ;}
inline int lowbit(int x) { return x & (-x) ;}
const int mod = 998244353;
const int N = 2e5 + 5;
void solve() {
int a ,b ,c ,d ,e ,f ,pp;
cin >> pp;
cin >> a >> b >> c >> d >> e >> f;
double ans1 = (300.0 * a + 300.0 * b + 200.0 * c + 100.0 * d + 50.0 * e) / (300.0 * (a + b + c + d + e + f));
double ans2 = max(0.0 ,((320.0 * a + 300.0 * b + 200.0 * c + 100.0 * d + 50.0 * e)/(320.0 * (a + b + c + d + e + f))) - 0.8) * 5 * pp;
string s= to_string(ans2);
string cc;
for(int i = 0 ; i < s.size() ; i++){
if(s[i] == '.'){
if((s[i + 1] - '0') >= 5){
cc[i - 1]++;
}
break;
}else cc+=s[i];
}
cout << fixed << setprecision(2) << ans1 * 100 << "%" << " " << cc << endl;
}
signed main(){
IOS
int O_O = 1;
cin >> O_O;
while(O_O--) solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 4060kb
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