QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#745237#9620. osu!manialrher#AC ✓1ms3840kbC++141.4kb2024-11-14 08:30:192024-11-14 08:30:20

Judging History

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

  • [2024-11-14 08:30:20]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3840kb
  • [2024-11-14 08:30:19]
  • 提交

answer

#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,##__VA_ARGS__)
#define int long long
#define endl '\n'
#define pb push_back
#define pii pair<int,int>
using namespace std;
bool Men;
const int mod=998244353;
const int N=200005;

inline void write(int x){if(x<0) putchar('-'),x=-x;if(x>9) write(x/10);putchar(x%10+'0');return;}
inline int read() {int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9') { if(ch=='-') f=-1; ch=getchar();}while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();return x*f;}
void add(int &x,int y){x=(x+y)%mod;}
int ksc(int m,int n,int p){int ans=0;while(n){if(n%2==1){n=n-1;ans=(ans+m)%p;}n=n/2;m=(m+m)%p;}return ans;}
int ksm(int base,int power,int p){int result=1;while(power>0){if(power&1){result=result*base%p;}power>>=1;base=(base*base)%p;}return result;}
int mod_inverse(int a){return ksm(a,mod-2,mod);}
int inv(int numerator,int denominator){int inverse_denominator = mod_inverse(denominator);int result=(1LL*numerator*inverse_denominator)%mod;return result;}


bool Mbe;
signed main(){
	int T=read();
	while(T--){
		int pp=read();
		int a=read(),b=read(),c=read(),d=read(),e=read(),f=read();
		long double acc=1.0*(300*a+300*b+200*c+100*d+50*e)/(1.0*300*(a+b+c+d+e+f));
		acc=acc*100.0;
		long double p=((fmax(0.0,(((320*a+300*b+200*c+100*d+50*e)/(1.0*320*(a+b+c+d+e+f)))-0.8))*5*pp)+0.50001);
		int use=p;
		cout<<fixed<<setprecision(2)<<acc<<"% "<<use<<endl;
	}
	
	return 0;
}

详细

Test #1:

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

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