QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#738995#9620. osu!maniatwomuAC ✓1ms3892kbC++141.0kb2024-11-12 20:29:312024-11-12 20:29:38

Judging History

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

  • [2024-11-12 20:29:38]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3892kb
  • [2024-11-12 20:29:31]
  • 提交

answer

#include<iostream>
#include<cmath>

#include<iomanip>
#define int long long 
using namespace std;
int t;
signed main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>t;
	while(t--){
		int  ppmax;
		double pp ; 
		cin>>ppmax;
		int a,b,c,d,e,f;
		cin>>a>>b>>c>>d>>e>>f;
		int num = (300*a+300*b+200*c+100*d+50*e);
		int bnum = (300*(a+b+c+d+e+f));
	//	cout<<num<<" "<<bnum; 
		double acc;
		acc =( double(num)/double (bnum))*100;
		cout<<fixed<<setprecision(2)<<acc<<"%"<<" ";
		int num1 = (320*a+300*b+200*c+100*d+50*e);
		int bnum1 = (320*(a+b+c+d+e+f));
		//cout<<num1<<" "<<bnum1<<endl;
		if(num1*10/8>bnum1){
		  pp = ( ((double) num1  / (double )bnum1)*1000 -(double) 0.800*1000)/1000 * (double)5.0000 *(double) ppmax ;		
		 string  s=to_string(pp);
		 auto pos = s.find('.');
		 if (pos != string::npos) 
		{
		 if('9'>=s[pos+1]&&s[pos+1]>='5') {
		 	cout<< (int)ceil(pp)<<endl;
		 }
		 else cout<<(int)floor(pp)<<endl;
		}
	    else cout<<s<<endl; 
	}
	else cout<<0<<endl;
   }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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