QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#811281#9620. osu!maniaTosakaUCW#WA 0ms3756kbC++201.8kb2024-12-12 17:22:532024-12-12 17:22:54

Judging History

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

  • [2024-12-12 17:22:54]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3756kb
  • [2024-12-12 17:22:53]
  • 提交

answer

#include <bits/stdc++.h>
using i64 = long long;
#define int i64
#define pb push_back
#define ep emplace
#define eb emplace_back
using std::cerr;
// using namespace std::views;
// using namespace std::ranges;
using std::max, std::min, std::swap, std::array;
using std::cin, std::cout, std::string, std::vector;
using std::ostream;
template <class T1, class T2> ostream &operator<<(ostream &os, const std::pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << '\n'; }
using pii = std::pair<int, int>;
#define fi first
#define se second

double eps = 1e-7;

void solve() {
    double ppmax, a, b, c, d, e, f;
    cin >> ppmax >> a >> b >> c >> d >> e >> f;

    double pp = 0;
    pp = (320.0 * a + 300.0 * b + 200.0 * c + 100.0 * d + 50.0 * e) / (320.0 * (a + b + c + d + e + f));
    pp -= 0.8;
    if (pp < 0 - eps) pp = 0;
    pp *= 5.0 * ppmax;
    // pp = round(pp);
    // cout << pp << '\n';
    // pp = round(pp);
    int ppans = int(pp + 0.5);

    double acc = 0;
    acc += 300 * a;
    acc += 300 * b;
    acc += 200 * c;
    acc += 100 * d;
    acc += 50 * e;
    acc /= 300.0 * (a + b + c + d + e + f);

    acc *= 100.0;

    printf("%.2f%% %d\n", acc, ppans);

    // cout << acc << ' ' << ppans << '\n';
}

signed main() {
    // std::ios::sync_with_stdio(false);
    // std::cin.tie(nullptr);
    int T; cin >> T;
    for (; T--; solve());
    // solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3756kb

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% 2687
100.00% 1792
100.00% 3000
52.78% 0
0.00% 0

result:

wrong answer 14th lines differ - expected: '100.00% 2688', found: '100.00% 2687'