結果
| 問題 | No.5018 Let's Make a Best-seller Book |
| ユーザー |
 merom686
|
| 提出日時 | 2023-10-01 15:28:20 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 4,329 bytes |
| コンパイル時間 | 2,844 ms |
| コンパイル使用メモリ | 245,340 KB |
| 実行使用メモリ | 24,504 KB |
| スコア | 0 |
| 平均クエリ数 | 1.00 |
| 最終ジャッジ日時 | 2023-10-01 15:28:43 |
| 合計ジャッジ時間 | 22,993 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
| testcase_36 | WA | - |
| testcase_37 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | WA | - |
| testcase_40 | WA | - |
| testcase_41 | WA | - |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | WA | - |
| testcase_45 | WA | - |
| testcase_46 | WA | - |
| testcase_47 | WA | - |
| testcase_48 | WA | - |
| testcase_49 | WA | - |
| testcase_50 | WA | - |
| testcase_51 | WA | - |
| testcase_52 | WA | - |
| testcase_53 | WA | - |
| testcase_54 | WA | - |
| testcase_55 | WA | - |
| testcase_56 | WA | - |
| testcase_57 | WA | - |
| testcase_58 | WA | - |
| testcase_59 | WA | - |
| testcase_60 | WA | - |
| testcase_61 | WA | - |
| testcase_62 | WA | - |
| testcase_63 | WA | - |
| testcase_64 | WA | - |
| testcase_65 | WA | - |
| testcase_66 | WA | - |
| testcase_67 | WA | - |
| testcase_68 | WA | - |
| testcase_69 | WA | - |
| testcase_70 | WA | - |
| testcase_71 | WA | - |
| testcase_72 | WA | - |
| testcase_73 | WA | - |
| testcase_74 | WA | - |
| testcase_75 | WA | - |
| testcase_76 | WA | - |
| testcase_77 | WA | - |
| testcase_78 | WA | - |
| testcase_79 | WA | - |
| testcase_80 | WA | - |
| testcase_81 | WA | - |
| testcase_82 | WA | - |
| testcase_83 | WA | - |
| testcase_84 | WA | - |
| testcase_85 | WA | - |
| testcase_86 | WA | - |
| testcase_87 | WA | - |
| testcase_88 | WA | - |
| testcase_89 | WA | - |
| testcase_90 | WA | - |
| testcase_91 | WA | - |
| testcase_92 | WA | - |
| testcase_93 | WA | - |
| testcase_94 | WA | - |
| testcase_95 | WA | - |
| testcase_96 | WA | - |
| testcase_97 | WA | - |
| testcase_98 | WA | - |
| testcase_99 | WA | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
double rnd() {
static mt19937 e(1);
static double t = pow(0.5, 32.0);
return e() * t;
}
int main() {
#define TEST 1
#if TEST == 0
int t, n, m;
cin >> t >> n >> m;
{
int s[10] = {}, p[10] = {}, r[10] = {};
while (t--) {
#else
int tn = 1000, s0 = 1 << 30, s1 = -1, ss = 0;
for (int tt = 0; tt < tn; tt++) {
int t = 52, n = 10, m = 2000000;
int p[10] = {}, r[10] = {};
double s3[10] = {}, r3[10] = {};
int s4[10] = {};
int sc = 0;
double d[10];
for (int i = 0; i < n; i++) {
d[i] = 0.5 + rnd();
if (tn == 1) {
cout << d[i] << " \n"[i == n - 1];
}
}
while (t--) {
#endif
int l[10] = {};
int x = 0;
if (t < 10) {
double k = 0;
for (int i = 0; i < n; i++) {
double d1 = s3[i] / r3[i];
k += pow(d1 * pow(1.05, p[i]), 2);
}
for (int i = 0; i < n; i++) {
double d1 = s3[i] / r3[i];
int x = m * pow(d1 * pow(1.05, p[i]), 2) / k / 500;
//x = max(x, 5);
//l[i] = max(x - r[i], 0);
l[i] = x;
}
} else {
for (int i = 0; i < n; i++) {
int x = 9;
if (r3[i] > 0) {
double d1 = s3[i] / r3[i];
x = (int)round(pow(pow(1.05, p[i]) * d1 / 0.5, 2));
//x = (x + 10) / 2;
x = max(x, 5);
}
//cout << x << " \n"[i == n - 1];
l[i] = min(m / (500 * n), max(x - r[i], 0));
}
if (t >= 52 - 1) x = 2;
}
#if TEST == 0
if (x == 0) {
cout << 1;
for (int i = 0; i < n; i++) {
cout << ' ' << l[i];
}
cout << endl;
} else {
cout << 2 << ' ' << x << endl;
}
cin >> m;
if (m < 0) exit(0);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
cin >> r[i];
}
}
}
#else
if (x == 0) {
for (int i = 0; i < n; i++) {
r[i] += l[i];
m -= l[i] * 500;
if (m < 0) throw;
}
} else {
m -= 250000 << x;
if (m < 0) throw;
for (int i = 0; i < n; i++) {
p[i] += x;
p[i] = min(p[i], 60);
}
}
int s[10] = {};
for (int i = 0; i < n; i++) {
s[i] = min(r[i], (int)floor(sqrt(r[i]) * pow(1.05, p[i]) * d[i] * (0.75 + 0.5 * rnd())));
m += s[i] * 1000;
sc += s[i];
s4[i] += s[i];
s3[i] += (s[i] + 0.0) * pow(1.05, -p[i]);
r3[i] += sqrt(r[i]);
}
for (int i = 0; i < n; i++) {
if (r[i] > 0) {
int u = 10 * s[i] / r[i];
p[i] += u >= 3;
p[i] -= u < 1;
p[i] = clamp(p[i], -60, 60);
}
}
for (int i = 0; i < n; i++) {
r[i] -= s[i];
}
if (tn == 1) {
cout << m << '\n';
for (int i = 0; i < n; i++) {
cout << s[i] << " \n"[i == n - 1];
}
for (int i = 0; i < n; i++) {
cout << p[i] << " \n"[i == n - 1];
}
for (int i = 0; i < n; i++) {
cout << r[i] << " \n"[i == n - 1];
}
}
}
s0 = min(s0, sc);
s1 = max(s1, sc);
ss += sc;
}
cout << s0 << ' ' << ss / tn << ' ' << s1 << endl;
#endif
return 0;
}