QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#750305#9620. osu!maniaucup-team2179#AC ✓0ms3836kbC++20908b2024-11-15 14:00:232024-11-15 14:00:23

Judging History

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

  • [2024-11-15 14:00:23]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3836kb
  • [2024-11-15 14:00:23]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define db long double
#define pii pair<int, int>
#define ll long long
using namespace std;
db eps = 1e-7;
int cal(db x) {
    int zheng = floor(x + eps);
    if (fabs(x - zheng - 0.5) < eps || x - zheng - 0.5 > eps)
        return zheng + 1;
    return zheng;
}
void solve() {
    int ppmax, a, b, c, d, e, f;
    cin >> ppmax >> a >> b >> c >> d >> e >> f;
    db acc = (300.0 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (300 * (a + b + c + d + e + f)) * 100.0;
    db pp = max(0.0, ((320.0 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (320 * (a + b + c + d + e + f)) - 0.8)) * 5 * ppmax;
    int res = cal(pp);
    cout << fixed << setprecision(2) << acc << "% " << res << "\n";
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    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: 3836kb

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