QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#778761#9620. osu!maniavictoryAC#AC ✓1ms3828kbC++14743b2024-11-24 16:11:102024-11-24 16:11:11

Judging History

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

  • [2024-11-24 16:11:11]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3828kb
  • [2024-11-24 16:11:10]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> PII;
#define endl '\n'
const int N=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
ll a[N];
void solve()
{
	double ppmax,a,b,c,d,e,f;
    cin>>ppmax>>a>>b>>c>>d>>e>>f;
    double ans1=(a*300+b*300+c*200+d*100+50*e)/(300*(a+b+c+d+e+f));
    double ans2=(320*a+300*b+200*c+100*d+50*e)*5*ppmax/(320*(a+b+c+d+e+f));
    ans2=round(ans2)-4*ppmax;
    if(ans2<0) ans2=0;
	ans2=(ll)ans2;
	cout<<fixed<<setprecision(2)<<ans1*100<<"% "<<(ll)ans2<<endl;
	return;	
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int _=1;
	cin>>_;
	while(_--)
	{
		solve();	
	}	
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3828kb

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