結果

問題 No.5018 Let's Make a Best-seller Book
ユーザー trineutrontrineutron
提出日時 2023-10-01 00:27:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 245 ms / 400 ms
コード長 5,002 bytes
コンパイル時間 2,278 ms
コンパイル使用メモリ 210,224 KB
実行使用メモリ 24,372 KB
スコア 201,054
平均クエリ数 52.00
最終ジャッジ日時 2023-10-01 12:34:26
合計ジャッジ時間 31,413 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 244 ms
24,024 KB
testcase_01 AC 241 ms
24,252 KB
testcase_02 AC 240 ms
23,832 KB
testcase_03 AC 238 ms
24,348 KB
testcase_04 AC 242 ms
24,012 KB
testcase_05 AC 242 ms
23,628 KB
testcase_06 AC 242 ms
23,388 KB
testcase_07 AC 242 ms
23,844 KB
testcase_08 AC 236 ms
23,616 KB
testcase_09 AC 241 ms
23,376 KB
testcase_10 AC 237 ms
23,376 KB
testcase_11 AC 240 ms
23,388 KB
testcase_12 AC 243 ms
23,520 KB
testcase_13 AC 236 ms
24,264 KB
testcase_14 AC 239 ms
23,652 KB
testcase_15 AC 240 ms
23,664 KB
testcase_16 AC 239 ms
23,412 KB
testcase_17 AC 242 ms
23,652 KB
testcase_18 AC 238 ms
23,364 KB
testcase_19 AC 240 ms
23,652 KB
testcase_20 AC 243 ms
23,412 KB
testcase_21 AC 241 ms
24,336 KB
testcase_22 AC 241 ms
23,424 KB
testcase_23 AC 242 ms
23,844 KB
testcase_24 AC 237 ms
23,388 KB
testcase_25 AC 237 ms
23,412 KB
testcase_26 AC 241 ms
23,628 KB
testcase_27 AC 241 ms
24,024 KB
testcase_28 AC 238 ms
23,364 KB
testcase_29 AC 240 ms
23,664 KB
testcase_30 AC 241 ms
24,372 KB
testcase_31 AC 237 ms
23,820 KB
testcase_32 AC 240 ms
23,832 KB
testcase_33 AC 236 ms
23,520 KB
testcase_34 AC 237 ms
23,628 KB
testcase_35 AC 240 ms
23,628 KB
testcase_36 AC 238 ms
24,012 KB
testcase_37 AC 243 ms
23,652 KB
testcase_38 AC 238 ms
23,376 KB
testcase_39 AC 236 ms
24,036 KB
testcase_40 AC 240 ms
23,532 KB
testcase_41 AC 237 ms
24,312 KB
testcase_42 AC 238 ms
23,412 KB
testcase_43 AC 239 ms
23,628 KB
testcase_44 AC 237 ms
23,376 KB
testcase_45 AC 233 ms
24,336 KB
testcase_46 AC 240 ms
23,652 KB
testcase_47 AC 237 ms
24,360 KB
testcase_48 AC 238 ms
23,832 KB
testcase_49 AC 242 ms
23,976 KB
testcase_50 AC 239 ms
23,412 KB
testcase_51 AC 241 ms
23,376 KB
testcase_52 AC 241 ms
23,628 KB
testcase_53 AC 240 ms
24,324 KB
testcase_54 AC 236 ms
23,424 KB
testcase_55 AC 239 ms
24,012 KB
testcase_56 AC 235 ms
23,628 KB
testcase_57 AC 239 ms
23,952 KB
testcase_58 AC 242 ms
24,012 KB
testcase_59 AC 242 ms
24,264 KB
testcase_60 AC 236 ms
23,616 KB
testcase_61 AC 236 ms
23,376 KB
testcase_62 AC 240 ms
23,376 KB
testcase_63 AC 242 ms
23,640 KB
testcase_64 AC 239 ms
23,628 KB
testcase_65 AC 239 ms
24,012 KB
testcase_66 AC 241 ms
23,964 KB
testcase_67 AC 234 ms
24,252 KB
testcase_68 AC 237 ms
24,372 KB
testcase_69 AC 236 ms
23,388 KB
testcase_70 AC 241 ms
23,520 KB
testcase_71 AC 239 ms
23,388 KB
testcase_72 AC 245 ms
23,376 KB
testcase_73 AC 241 ms
24,360 KB
testcase_74 AC 239 ms
23,832 KB
testcase_75 AC 240 ms
23,640 KB
testcase_76 AC 241 ms
24,060 KB
testcase_77 AC 242 ms
24,036 KB
testcase_78 AC 240 ms
23,652 KB
testcase_79 AC 242 ms
24,324 KB
testcase_80 AC 239 ms
23,844 KB
testcase_81 AC 242 ms
24,036 KB
testcase_82 AC 239 ms
23,376 KB
testcase_83 AC 233 ms
23,832 KB
testcase_84 AC 240 ms
23,532 KB
testcase_85 AC 241 ms
23,412 KB
testcase_86 AC 239 ms
24,012 KB
testcase_87 AC 242 ms
24,336 KB
testcase_88 AC 239 ms
23,532 KB
testcase_89 AC 236 ms
23,400 KB
testcase_90 AC 240 ms
23,388 KB
testcase_91 AC 237 ms
23,640 KB
testcase_92 AC 238 ms
23,616 KB
testcase_93 AC 238 ms
23,520 KB
testcase_94 AC 239 ms
23,508 KB
testcase_95 AC 238 ms
23,400 KB
testcase_96 AC 237 ms
23,664 KB
testcase_97 AC 238 ms
23,520 KB
testcase_98 AC 236 ms
23,412 KB
testcase_99 AC 237 ms
23,664 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

class xrand {
    uint64_t x;

   public:
    using result_type = uint32_t;
    static constexpr result_type min() {
        return std::numeric_limits<result_type>::min();
    }
    static constexpr result_type max() {
        return std::numeric_limits<result_type>::max();
    }
    xrand(uint64_t k) : x(k) {}
    xrand() : xrand(1) {}
    result_type operator()() {
        x ^= x << 9;
        x ^= x >> 7;
        return (x * 0x123456789abcdef) >> 32;
    }
};

xrand rng;
uniform_real_distribution<double> dist_d(0.5, 1.5);

constexpr int T = 52, N = 10;
constexpr int sample_size = 2000;

double calc_p(int s, int p, int r, double d) {
    assert(s <= r);
    const double base = sqrt(r) * pow(1.05, p) * d;
    double low = clamp(s / base, 0.75, 1.25);
    double high = clamp((s + 1) / base, 0.75, 1.25);
    if (s == r) {
        high = 1.25;
    }
    return (high - low) * 2;
}

int convert(int x) {
    const int r = x % 10;
    if (r == 0) return x;
    if (r <= 3) return x + 3 - r;
    if (r <= 6) return x + 6 - r;
    return x + 10 - r;
}

int main() {
    int t, n, money;
    cin >> t >> n >> money;
    money /= 500;
    array<int, N> s, p, r;
    s.fill(0);
    p.fill(0);
    r.fill(0);

    array<array<double, sample_size>, N> d_particle;
    for (int i = 0; i < N; i++) {
        for (auto &&x : d_particle[i]) {
            x = dist_d(rng);
        }
    }

    int score = 0, prev_ad = -1;

    for (int week = 0; week < T; week++) {
        for (int i = 0; i < N; i++) {
            sort(d_particle[i].begin(), d_particle[i].end());
        }

        array<double, N> d2_avg;
        d2_avg.fill(0.0);
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < sample_size; j++) {
                d2_avg[i] += d_particle[i][j] * d_particle[i][j];
            }
            d2_avg[i] /= sample_size;
        }
        array<double, N> weight;
        for (int i = 0; i < N; i++) {
            weight[i] = pow(1.05, 2 * p[i]) * d2_avg[i];
        }
        double v = 0.0, v_l = 0.0, v_r = 1e5;
        while (v_r - v_l > 1e-5) {
            double mid = 0.5 * (v_l + v_r);
            int count = 0;
            for (int i = 0; i < N; i++) {
                count += max(0, int(weight[i] * mid) - r[i]);
            }
            if (count <= money) {
                v_l = mid;
            } else {
                v_r = mid;
            }
        }
        v = v_l;

        bool ad_flag = false;
        if (week < 24 and week >= prev_ad + 2 and money >= 2100) {
            ad_flag = true;
        }
        if (week < 33 and week >= prev_ad + 2 and money >= 2500) {
            ad_flag = true;
        }
        if (week >= prev_ad + 2 and money >= 4000) {
            ad_flag = true;
        }

        if (week >= 42) {
            cout << 1;
            for (int i = 0; i < 10; i++) {
                cout << ' ' << max(0, int(weight[i] * v) - r[i]);
            }
            cout << endl;
        } else if (ad_flag) {
            cout << "2 2" << endl;
            prev_ad = week;
        } else {
            cout << 1;
            for (int i = 0; i < 10; i++) {
                double d_min = d_particle[i][0];
                cout << ' '
                     << max(0, min(int(weight[i] * v) - r[i],
                                   convert(7 * d_min * d_min *
                                           pow(1.05, 2 * p[i])) -
                                       r[i]));
            }
            cout << endl;
        }

        cin >> money;
        money /= 500;

        for (int i = 0; i < N; i++) {
            cin >> s[i];
            score += s[i];
        }
        double p2_sum = 0;
        for (int i = 0; i < N; i++) {
            cin >> p[i];
            double p_expect = p[i];
            for (int w = week + 1; w < T; w++) {
                if (w < 44) {
                    p_expect += 1.2;
                } else {
                    p_expect -= 0.7;
                }
                p2_sum += pow(1.05, 2 * p_expect) * d2_avg[i];
            }
        }
        for (auto &&x : r) {
            cin >> x;
        }
        for (int i = 0; i < N; i++) {
            array<double, sample_size> d_prob;
            for (int j = 0; j < sample_size; j++) {
                d_prob[j] = calc_p(s[i], p[i], r[i] + s[i], d_particle[i][j]);
            }
            discrete_distribution dist_idx(d_prob.begin(), d_prob.end());
            array<double, sample_size> d_new;
            for (int j = 0; j < sample_size; j++) {
                d_new[j] = d_particle[i][dist_idx(rng)];
            }
            d_particle[i] = move(d_new);
        }
        // cerr << score + 7 * p2_sum << endl;
        // if (week == T - 1) {
        //     for (int i = 0; i < N; i++) {
        //         cerr << reduce(d_particle[i].begin(), d_particle[i].end()) /
        //                     sample_size
        //              << endl;
        //     }
        // }
    }

    return 0;
}
0