QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#753881#9620. osu!maniaIcedpiggy#AC ✓0ms3792kbC++14755b2024-11-16 13:47:422024-11-16 13:47:44

Judging History

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

  • [2024-11-16 13:47:44]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3792kb
  • [2024-11-16 13:47:42]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define i64 long long
inline i64 rd()
{
	i64 num=0;char ch=getchar();bool op=0;
	for(;!isdigit(ch);ch=getchar())if(ch=='-')op=1;
	for(;isdigit(ch);ch=getchar())num=num*10+(ch-'0');
	return op?-num:num;
}
#define f128 long double
const int N=1e5+10;

inline void work()
{
	vector<int> a(7,0);for(int &x:a)x=rd();
	f128 acc=1.0L*(300*a[1]+300*a[2]+200*a[3]+100*a[4]+50*a[5])/(300*(a[1]+a[2]+a[3]+a[4]+a[5]+a[6]));
	int pp=(int)(fmax(0.0L,1.0L*(320*a[1]+300*a[2]+200*a[3]+100*a[4]+50*a[5])/(320*(a[1]+a[2]+a[3]+a[4]+a[5]+a[6]))-0.8L)*5.0L*a[0]+0.5);
	int val=(acc*1e4+0.5);
	printf("%d.%02d%% %d\n",val/100,val%100,pp);
}

int main()
{
	for(int test=rd();test;test--)work();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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