QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#741131#9620. osu!maniasupepapupu#AC ✓0ms3872kbC++231.2kb2024-11-13 13:29:312024-11-13 13:29:31

Judging History

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

  • [2024-11-13 13:29:31]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3872kb
  • [2024-11-13 13:29:31]
  • 提交

answer

#include <bits/stdc++.h>

#define DEBUG
#ifdef DEBUG
#define debug(x) cerr << #x << ": " << (x) << endl
#define print(x) cerr << x << ' '
#define println(x) cerr << x << endl
#else
#define debug(x)
#define print(x)
#define println(x)
#endif
#define x first
#define y second
#define el '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

int acc[]{300, 300, 200, 100, 50, 0};
int pp[]{320, 300, 200, 100, 50, 0};

void solve() {
    int ppmax; cin >> ppmax;
    int a[6];
    for (int i = 0; i < 6; ++i) cin >> a[i];
    int tot = accumulate(a, a + 6, 0);
    int ACC = 0;
    for (int i = 0; i < 6; ++i) ACC += acc[i] * a[i];
    cout << fixed << setprecision(2) << (long double)ACC / (300 * tot) * 100 << "% ";
    int P = 0;
    for (int i = 0; i < 6; ++i) P += pp[i] * a[i];
    long double PP = (long double)P / (320 * tot);
    PP = max((long double)0., PP - 0.8);
    PP *= 5 * ppmax;
    cout << fixed << setprecision(0) << PP + 1e-12 << el;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}

详细

Test #1:

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

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