QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#737303 | #9620. osu!mania | liaoyd | AC ✓ | 0ms | 3716kb | C++23 | 795b | 2024-11-12 15:24:13 | 2024-11-12 15:24:16 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vii vector<vi>
#define pb push_back
#define pir pair<int,int>
const int P = 1e9 + 7;
const int N = 1e6+7;
const int inf = 0x3f3f3f3f3f3f3f3f;//longlong
const int ing = 1e18;
const int mod = 1e9+7;
int n,m;
int ax, bx,ay,by;
void solve()
{
long double ppmax,a,b,c,d,e,f;
cin>>ppmax>>a>>b>>c>>d>>e>>f;
long double acc=(a*300+b*300+c*200+d*100+50*e)/(3*(a+b+c+d+e+f));
long double pp=max((long double)0,(a*320+b*300+c*200+d*100+e*50)/(320*(a+b+c+d+e+f))-0.8)*5*ppmax;
cout << fixed << setprecision(2) << acc << "% ";
cout<<(int)(pp+0.5+1e-8)<<"\n";
}
signed main()
{
cin.tie(0)->sync_with_stdio(0);
int _ = 1;
cin >> _;
while (_--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3716kb
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