QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#792869#9620. osu!maniahappy_lazier#AC ✓0ms3800kbC++20961b2024-11-29 14:48:542024-11-29 14:48:54

Judging History

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

  • [2024-11-29 14:48:54]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3800kb
  • [2024-11-29 14:48:54]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,l,r) for(ll i=l;i<=r;++i)
#define rep_(i,r,l) for(ll i=r;i>=l;--i)
const ll N = 2e5 + 7;
const ll P = 1e9 + 7;
void solve() {
	double ppmax; cin >> ppmax;
	ll a, b, c, d, e, f;
	cin >> a >> b >> c >> d >> e >> f;
	double acc;
	acc = (double)(300 * (a + b) + 200 * c + 100 * d + 50 * e) / (double)(300 * (a + b + c + d + e + f));
	double accc = (double)(320 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (double)(320 * (a + b + c + d + e + f));
	double pp;
	pp = (double)max(0.0, 5 * accc - 4.0) * ppmax;
	ll ans1 = (ll)(acc * 10000 + 0.500001);
	cout << ans1 / 100 << "." << ans1 %100 /10 << ans1 % 10 << "% ";
	//cout << pp << endl;
	ll ans2 = (ll)(pp + 0.50001);
	cout << ans2 << endl;

}
int main() {
	//cout << fixed << setprecision(0) << 0.500 << endl;
	ios::sync_with_stdio(0);
	cin.tie(0);
	int T(1);
	cin >> T;
	while (T--) {
		solve();
	}
}

詳細信息

Test #1:

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

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