QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#752998#9620. osu!maniaD12EQD#AC ✓0ms3848kbC++171.2kb2024-11-16 10:52:132024-11-16 10:52:13

Judging History

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

  • [2024-11-16 10:52:13]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3848kb
  • [2024-11-16 10:52:13]
  • 提交

answer

#include <bits/stdc++.h>
#define min(a, b) (a > b ? b : a)
#define max(a, b) (a < b ? b : a)

#define YES (cout << "YES" << endl)
#define NO (cout << "NO" << endl)
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rrep(a, b, c) for (a = b; a >= c; a--)
#define rep(a, b, c) for (a = b; a <= c; a++)
#define int long long
#define IOS                  \
    ios::sync_with_stdio(0); \
    cout.tie(0);

using namespace std;

typedef double db;
typedef pair<int, int> pii;
typedef array<int, 3> a3;

const db eps = 1e-12;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int N = 200010;

void solve()
{
    float ppmax, a, b, c, d, e, f;
    cin >> ppmax >> a >> b >> c >> d >> e >> f;
    float x, y, z;
    x = 1.0 * (300 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (300 * (a + b + c + d + e + f));
    y = 1.0 * (320 * a + 300 * b + 200 * c + 100 * d + 50 * e) / (320 * (a + b + c + d + e + f));
    z = max(0.0, y - 0.8) * 5.0 * ppmax;

    printf("%.2lf%% %.0lf\n", x * 100, z);
}

signed main(){
    cin.tie(0);

    int T = 1;
    cin >> T;

    while (T--)
        solve();

}
/*

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

*/

详细

Test #1:

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

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