QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#763742#9620. osu!manialonelywolf#RE 0ms0kbC++201.0kb2024-11-19 21:52:472024-11-19 21:52:48

Judging History

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

  • [2024-11-19 21:52:48]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2024-11-19 21:52:47]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define int long long

int a[] = {300, 300, 200, 100, 50, 0};
int b[] = {320, 300, 200, 100, 50, 0};
int c[6];
void solve() {
    int ppmax;
    cin >> ppmax;
    int sum = 0;
    for(int i = 0; i < 6; ++i) {
        cin >> c[i];
        sum += c[i];
    }
    int p = 0;
    for(int i = 0; i < 6; ++i)
        p += a[i] * c[i];
    double ans1 = 1.0f * p / sum / 3;
    cout << ans1 << "% ";
    p = 0;
    for(int i = 0; i < 6; ++i)
        p += b[i] * c[i];
    double tmp = max(0.0, 1.0 * p / sum / 320 - 0.8);
    double ans2 = tmp * 5 * ppmax;
    // cout << ans2 << '\n';
    if (ppmax == 630) assert(false);
    cout << (int)(ans2 + 0.500001) << '\n'; 
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(2);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}

/*

2
630
3029 2336 377 41 10 61
3000
20000 10000 0 0 0 0



*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Runtime Error

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:


result: