QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#740928#9620. osu!maniaticking_away#AC ✓0ms3724kbC++201.6kb2024-11-13 12:27:422024-11-13 12:27:43

Judging History

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

  • [2024-11-13 12:27:43]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3724kb
  • [2024-11-13 12:27:42]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

using db = double;
void solve()
{
    db ppmax;
    db a, b, c, d, e, f;
    cin >> ppmax >> a >> b >> c >> d >> e >> f;
    db ans1 = 0;
    ans1 = 300 * a + 300 * b + 200 * c + 100 * d + 50 * e;
    ans1 = ans1 / (300 * (a + b + c + d + e + f));
    ans1 *= 100.0;
    printf("%.2lf", ans1);
    cout << "% ";
    db t1 = 320 * a + 300 * b + 200 * c + 100 * d + 50 * e;
    t1 /= 1.0 * (320 * (a + b + c + d + e + f));
    t1 -= 0.8;
    t1 = max(t1, 0.0);
    db pp = round(t1 * 5.0 * (ppmax * 1.0) + 0.00000001);
    cout << pp << endl;
}
signed main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}

详细

Test #1:

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

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