QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#739270 | #9620. osu!mania | NoT1m3Cons1d3r | AC ✓ | 1ms | 3844kb | C++20 | 1.8kb | 2024-11-12 21:17:45 | 2024-11-12 21:17:54 |
Judging History
answer
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <stdlib.h>
#include <vector>
#include <cstring>
#include <climits>
#include <iostream>
#include <algorithm>
using namespace std;
#define il inline
#define rr read()
#define wr puts()
#define bl putchar(' ')
#define in int
#define max(x, y) (x > y ? x : y)
#define min(x, y) (x < y ? x : y)
#define rep(i, l, n) for (in i = l; i >= n; i--)
#define int long long
il int read()
{
char ch;
bool f = 0;
while ((ch = getchar()) < '0' || ch > '9')
(ch == '-') && (f = 1);
in x = ch ^ '0';
while ((ch = getchar()) <= '9' && ch >= '0')
x = (x << 1) + (x << 3) + (ch ^ '0');
return f ? -x : x;
}
il void print(in x)
{
if (x < 0)
putchar('-'), x = -x;
if (x >= 10)
print(x / 10);
putchar(x % 10 ^ '0');
}
const double eps = 1e-9;
const int MAXN = 4e6 + 100;
void solve()
{
int ppmax;
double a, b, c, d, e, f;
cin >> ppmax >> a >> b >> c >> d >> e >> f;
double ans = (300 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f) / (300 * (a + b + c + d + e + f));
ans *= 100;
cout << fixed << setprecision(2) << ans << "% ";
double pp = max(0, ((320 * a + 300 * b + 200 * c + 100 * d + 50 * e + 0 * f) / (320 * (a + b + c + d + e + f)) - 0.8) * 5 * ppmax);
// cout << fixed << setprecision(10) << pp << " " << (int)pp << "\n";
if (pp - (int)pp - 0.5 + eps >= 0)
{
// cout << 1 << "\n";
cout << (int)pp + 1 << '\n';
}
else
cout << (int)pp << '\n';
}
signed main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3844kb
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