QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#736679 | #9620. osu!mania | chenjiaqiy | AC ✓ | 0ms | 3772kb | C++20 | 1.3kb | 2024-11-12 12:30:16 | 2024-11-12 12:30:17 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ll long long
#define double long double
#define endl '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define x first
#define y second
#define debug(_x) cout << #_x << '=' << _x << endl
typedef pair<int, int> PII;
using i64 = long long;
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
void solve()
{
int ppmax, a, b, c, d, e, f;
cin >> ppmax >> a >> b >> c >> d >> e >> f;
double ans1 = 0, ans2 = 0;
cout << fixed << setprecision(2);
double tmp1 = 300 * a + 300 * b + 200 * c + 100 * d + 50 * e;
double tmp2 = 300 * (a + b + c + d + e + f);
ans1 = tmp1 / tmp2;
ans1 *= 100;
tmp1 = 320 * a + 300 * b + 200 * c + 100 * d + 50 * e;
tmp2 = 320 * (a + b + c + d + e + f);
// debug(tmp2);
// debug((double)tmp1 / tmp2);
ans2 = max((double)0, (double)tmp1 / tmp2 - 0.8) * 5 * ppmax;
cout << ans1 << "% ";
// cout << fixed << setprecision(1);
double k1 = ans2;
int k2 = ans2;
double cha = k1 - k2;
if (cha >= 0.499999999999)
k2++;
cout << k2 << endl;
}
int main()
{
/*ios::sync_with_stdio(false);
cin.tie(nullptr);*/
int _ = 1;
cin >> _;
while (_--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3772kb
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