QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#788612 | #9620. osu!mania | Texcavator# | AC ✓ | 1ms | 3872kb | C++23 | 1.4kb | 2024-11-27 17:40:09 | 2024-11-27 17:40:10 |
Judging History
answer
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include <iomanip>
#include<random>
#include<set>
/*
*/
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
using namespace std;
typedef long long LL;
typedef __int128 i128;
typedef unsigned long long ULL;
typedef double db;
//精度输出std::cout << std::fixed << std::setprecision(10) << ans << std::endl;
#define int long long
long double ppmax , a , b , c , d , e , f;
void Asuka()
{
cin >> ppmax;
cin >> a >> b >> c >> d >> e >> f;
long double Acc = (300 * a + 300 * b + 200 * c + 100 * d + 50 * e);
Acc /= (300 * (a + b + c + d + e + f));
Acc *= 100;
long double pp = (320 * a + 300 * b + 200 * c + 100 * d + 50 * e);
pp /= (320 * (a + b + c + d + e + f));
pp -= 0.8;
pp = max((long double)0 , pp);
pp *= 5 * ppmax;
cout << fixed << setprecision(2) << (double)Acc << "% ";
pp += 1e-12;
cout << fixed << setprecision(0) << (double)pp << '\n';
// cout << (int)(pp + 0.5) << '\n';
return;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while(t --){
Asuka();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3872kb
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