QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#737630#9620. osu!maniaMOQEE#AC ✓0ms3844kbC++20996b2024-11-12 16:28:082024-11-12 16:28:08

Judging History

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

  • [2024-11-12 16:28:08]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3844kb
  • [2024-11-12 16:28:08]
  • 提交

answer

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define llu unsigned long long
#define endl "\n"

typedef pair<int, int> PII;

int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const long long inf = 1LL << 60;
const int mod = 998244353;
const int N = 1e6 + 7;

void solve()
{
	float ppmax, a, b, c, d, e, f;
	cin >> ppmax >> a >> b >> c >> d >> e >> f;
	float Acc = (300 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (300 * (a + b + c + d + e + f));
	float ppAcc = (320 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (320 * (a + b + c + d + e + f));
	float pp = max((float)0.0, (float)(ppAcc - 0.8)) * 5 * ppmax;
	Acc *= 100;
	pp += (float)0.5;
	int x = pp;
	cout << Acc << "% " << x << endl;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(2);
	int T = 1;
	cin >> T;
	while (T--)
		solve();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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