QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#757873#9620. osu!maniaKnownError_#AC ✓0ms3908kbC++14897b2024-11-17 14:12:472024-11-17 14:12:47

Judging History

你现在查看的是最新测评结果

  • [2024-11-17 14:12:47]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3908kb
  • [2024-11-17 14:12:47]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n) for(int i=0;i<(n);++i)
#define sizc(x) ((int)(x).size())
#define allc(x) (x).begin(),(x).end()
#define fir first
#define sec second

void solve(){
    ll ppmax,a,b,c,d,e,f;
    cin>>ppmax>>a>>b>>c>>d>>e>>f;
    ld acc=(300*a+300*b+200*c+100*d+50*e)/(300.l*(a+b+c+d+e+f))*100;
    cout<<fixed<<setprecision(2)<<acc<<"% ";
    ld pp=max(0.l,(320*a+300*b+200*c+100*d+50*e)/(320.l*(a+b+c+d+e+f))-0.8l)*5*ppmax;
    cout<<(int)round(pp)<<'\n';
}

signed main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    int T;cin>>T;
    while(T--)solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3908kb

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