#913812 (C++14) No.5018 Let's Make a Best-seller Book

提出ソース

結果

問題	No.5018 Let's Make a Best-seller Book
ユーザー	e869120
提出日時	2023-09-18 14:38:07
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	41 ms / 400 ms
コード長	5,048 bytes
コンパイル時間	764 ms
コンパイル使用メモリ	82,384 KB
実行使用メモリ	24,408 KB
スコア	71,734
平均クエリ数	52.00
最終ジャッジ日時	2023-10-01 12:30:39
合計ジャッジ時間	9,114 ms
ジャッジサーバーID （参考情報）	judge14 / judge15
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	39 ms 24,000 KB
testcase_01	AC	33 ms 24,264 KB
testcase_02	AC	32 ms 24,048 KB
testcase_03	AC	32 ms 24,024 KB
testcase_04	AC	32 ms 23,640 KB
testcase_05	AC	34 ms 24,360 KB
testcase_06	AC	33 ms 24,024 KB
testcase_07	AC	34 ms 23,520 KB
testcase_08	AC	32 ms 23,376 KB
testcase_09	AC	33 ms 23,652 KB
testcase_10	AC	33 ms 24,264 KB
testcase_11	AC	32 ms 23,652 KB
testcase_12	AC	33 ms 23,640 KB
testcase_13	AC	35 ms 23,520 KB
testcase_14	AC	32 ms 24,036 KB
testcase_15	AC	37 ms 23,832 KB
testcase_16	AC	33 ms 23,640 KB
testcase_17	AC	33 ms 23,820 KB
testcase_18	AC	33 ms 23,412 KB
testcase_19	AC	33 ms 24,360 KB
testcase_20	AC	33 ms 24,060 KB
testcase_21	AC	32 ms 23,664 KB
testcase_22	AC	33 ms 23,232 KB
testcase_23	AC	41 ms 24,384 KB
testcase_24	AC	33 ms 23,844 KB
testcase_25	AC	33 ms 23,508 KB
testcase_26	AC	33 ms 24,396 KB
testcase_27	AC	33 ms 24,024 KB
testcase_28	AC	33 ms 23,628 KB
testcase_29	AC	32 ms 24,012 KB
testcase_30	AC	33 ms 23,412 KB
testcase_31	AC	32 ms 24,396 KB
testcase_32	AC	34 ms 24,024 KB
testcase_33	AC	32 ms 23,388 KB
testcase_34	AC	32 ms 24,348 KB
testcase_35	AC	33 ms 23,508 KB
testcase_36	AC	34 ms 24,264 KB
testcase_37	AC	32 ms 23,400 KB
testcase_38	AC	32 ms 23,412 KB
testcase_39	AC	32 ms 23,520 KB
testcase_40	AC	34 ms 24,024 KB
testcase_41	AC	33 ms 23,628 KB
testcase_42	AC	32 ms 24,384 KB
testcase_43	AC	32 ms 23,376 KB
testcase_44	AC	32 ms 24,384 KB
testcase_45	AC	33 ms 23,388 KB
testcase_46	AC	35 ms 24,000 KB
testcase_47	AC	32 ms 23,520 KB
testcase_48	AC	32 ms 23,628 KB
testcase_49	AC	33 ms 24,324 KB
testcase_50	AC	34 ms 23,628 KB
testcase_51	AC	33 ms 23,352 KB
testcase_52	AC	33 ms 23,424 KB
testcase_53	AC	32 ms 24,024 KB
testcase_54	AC	32 ms 24,408 KB
testcase_55	AC	35 ms 24,276 KB
testcase_56	AC	33 ms 23,376 KB
testcase_57	AC	32 ms 23,952 KB
testcase_58	AC	32 ms 24,264 KB
testcase_59	AC	36 ms 23,364 KB
testcase_60	AC	32 ms 24,000 KB
testcase_61	AC	32 ms 24,264 KB
testcase_62	AC	32 ms 24,060 KB
testcase_63	AC	32 ms 23,508 KB
testcase_64	AC	33 ms 23,424 KB
testcase_65	AC	32 ms 23,628 KB
testcase_66	AC	31 ms 24,252 KB
testcase_67	AC	32 ms 23,532 KB
testcase_68	AC	33 ms 23,652 KB
testcase_69	AC	34 ms 23,820 KB
testcase_70	AC	32 ms 23,844 KB
testcase_71	AC	32 ms 24,324 KB
testcase_72	AC	32 ms 23,832 KB
testcase_73	AC	32 ms 24,384 KB
testcase_74	AC	32 ms 23,532 KB
testcase_75	AC	33 ms 23,388 KB
testcase_76	AC	32 ms 23,364 KB
testcase_77	AC	33 ms 24,324 KB
testcase_78	AC	34 ms 24,360 KB
testcase_79	AC	34 ms 23,616 KB
testcase_80	AC	32 ms 24,012 KB
testcase_81	AC	32 ms 24,240 KB
testcase_82	AC	35 ms 24,264 KB
testcase_83	AC	34 ms 23,844 KB
testcase_84	AC	32 ms 24,312 KB
testcase_85	AC	33 ms 23,640 KB
testcase_86	AC	32 ms 23,628 KB
testcase_87	AC	32 ms 24,324 KB
testcase_88	AC	32 ms 24,012 KB
testcase_89	AC	32 ms 23,520 KB
testcase_90	AC	32 ms 23,832 KB
testcase_91	AC	32 ms 24,264 KB
testcase_92	AC	33 ms 23,424 KB
testcase_93	AC	33 ms 23,424 KB
testcase_94	AC	35 ms 23,820 KB
testcase_95	AC	33 ms 23,376 KB
testcase_96	AC	33 ms 24,360 KB
testcase_97	AC	32 ms 23,388 KB
testcase_98	AC	32 ms 23,400 KB
testcase_99	AC	33 ms 24,024 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

// =============================================================== デバッグ用の出力 ===============================================================
class DebugMode {
public:
	int T = 52;
	int N = 10;
	int CurrentTurn;
	int CurrentMoney;
	int Score;
	vector<int> Sales;
	vector<int> Remain;
	vector<int> Popula;
	vector<double> D;
	vector<vector<double>> Z;

	double Randouble() {
		double s = 1, t = 0;
		for (int i = 0; i < 3; i++) {
			s /= 1024.0;
			t += 1.0 * (rand() % 1024) * s;
		}
		return t;
	}

	void Initialize() {
		CurrentMoney = 2000000;
		CurrentTurn = 0;
		Score = 0;
		Sales = vector<int>(N, 0);
		Remain = vector<int>(N, 0);
		Popula = vector<int>(N, 0);
		D = vector<double>(N, 0);
		Z = vector<vector<double>>(T, vector<double>(N, 0));
		for (int i = 0; i < N; i++) D[i] = Randouble() * 1.0 + 0.5;
		for (int i = 0; i < T; i++) {
			for (int j = 0; j < N; j++) Z[i][j] = Randouble() * 0.5 + 0.75;
		}
	}

	void Refresh() {
		int i = CurrentTurn;
		for (int j = 0; j < N; j++) Sales[j] = min(Remain[j], (int)(1.0 * pow(Remain[j], 0.5) * pow(1.05, Popula[j]) * D[j] * Z[i][j]));
		for (int j = 0; j < N; j++) {
			if (10 * Sales[j] >= 3 * Remain[j]) Popula[j] = min(+60, Popula[j] + 1);
			if (10 * Sales[j] < 1 * Remain[j]) Popula[j] = max(-60, Popula[j] - 1);
		}
		for (int j = 0; j < N; j++) Score += Sales[j];
		for (int j = 0; j < N; j++) CurrentMoney += 1000LL * Sales[j];
		for (int j = 0; j < N; j++) Remain[j] -= Sales[j];
		CurrentTurn += 1;
	}
};

// =============================================================== デバッグ用の出力 ===============================================================
const int DEBUG = 1;
int T, N;
int Money;
int S[19], P[19], R[19];
int Prev_Ad;
double Expected_D[19], Sum_D[19], Cnt_D[19];
DebugMode COMP;

void Initialize() {
	T = 0; N = 0; Money = 0; Prev_Ad = 0;
	for (int i = 0; i < 19; i++) {
		Expected_D[i] = 0; Sum_D[i] = 0; Cnt_D[i] = 0;
		S[i] = 0; P[i] = 0; R[i] = 0;
	}
}

void Ask(int Type, vector<int> vec) {
	if (DEBUG == 1) {
		cout << Type;
		for (int i = 0; i < vec.size(); i++) cout << " " << vec[i];
		cout << endl;
	}
	if (DEBUG == 2 && Type == 1) {
		for (int i = 0; i < N; i++) COMP.CurrentMoney -= 500 * vec[i];
		for (int i = 0; i < N; i++) COMP.Remain[i] += vec[i];
	}
	if (DEBUG == 2 && Type == 2) {
		COMP.CurrentMoney -= 500000 * (1 << (vec[0] - 1));
		for (int i = 0; i < N; i++) COMP.Popula[i] += vec[0];
	}
}

void Decide(int turn) {
	// 広告を打つ場合
	if (turn >= 6 && Money >= 1500000 && turn - Prev_Ad >= 2) {
		Ask(2, vector<int>{2});
		Prev_Ad = turn;
	}

	// 広告を打たない場合
	else {
		vector<int> L(N, 0);
		int NeedMoney = 0;
		for (int i = 1; i <= N; i++) {
			double keisuu = 9.0;
			if (P[i] >= 50) keisuu = 75.0;
			int Goal = keisuu * pow(1.05, 1.0 * P[i]) * Expected_D[i] * pow(1.05, 1.0 * P[i]);
			Goal = max(1, Goal - R[i]);
			L[i - 1] = Goal;
			NeedMoney += 500 * Goal;
		}
		if (NeedMoney > Money) {
			for (int i = 1; i <= N; i++) L[i - 1] = (1LL * L[i - 1] * Money / NeedMoney);
		}
		Ask(1, L);
	}
}

int main() {
	// 最初の入力
	if (DEBUG == 1) cin >> T >> N >> Money;
	if (DEBUG == 2) { T = 52; N = 10; Money = 2000000; COMP.Initialize(); }
	for (int i = 1; i <= N; i++) Expected_D[i] = 1.0;

	// インタラクティブ開始
	for (int t = 1; t <= T; t++) {
		// (あ) 行動を決める
		Decide(t);

		// (い) 売上部数などを入力する
		if (DEBUG == 1) {
			cin >> Money;
			for (int i = 1; i <= N; i++) cin >> S[i];
			for (int i = 1; i <= N; i++) cin >> P[i];
			for (int i = 1; i <= N; i++) cin >> R[i];
			cerr << "Turn = " << t << ":" << endl;
			cerr << Money << endl;
			for (int i = 1; i <= N; i++) cerr << S[i] << " "; cerr << endl;
			for (int i = 1; i <= N; i++) cerr << P[i] << " "; cerr << endl;
			for (int i = 1; i <= N; i++) cerr << R[i] << " "; cerr << endl;
			cerr << endl;
		}
		if (DEBUG == 2) {
			COMP.Refresh();
			Money = COMP.CurrentMoney;
			for (int i = 1; i <= N; i++) S[i] = COMP.Sales[i - 1];
			for (int i = 1; i <= N; i++) P[i] = COMP.Popula[i - 1];
			for (int i = 1; i <= N; i++) R[i] = COMP.Remain[i - 1];
			cerr << "Turn = " << t << ":" << endl;
			cerr << Money << endl;
			for (int i = 1; i <= N; i++) cerr << S[i] << " "; cerr << endl;
			for (int i = 1; i <= N; i++) cerr << P[i] << " "; cerr << endl;
			for (int i = 1; i <= N; i++) cerr << R[i] << " "; cerr << endl;
			cerr << endl;
		}

		// D の値を更新
		for (int i = 1; i <= N; i++) {
			if (S[i] == 0) continue;
			int moto_popular = P[i];
			if (10 * S[i] >= 3 * (S[i] + R[i])) moto_popular -= 1;
			if (10 * S[i] < 1 * (S[i] + R[i])) moto_popular += 1;
			double expected = (0.5 + S[i]) / (pow(1.0 * (S[i] + R[i]), 0.5) * pow(1.05, moto_popular));
			Sum_D[i] += expected;
			Cnt_D[i] += 1.0;
			Expected_D[i] = min(1.45, max(0.55, Sum_D[i] / Cnt_D[i]));
		}
	}

	// 最終スコアを出力
	if (DEBUG == 2) cout << "Final Score = " << COMP.Score << endl;
	return 0;
}

yukicoder

結果

テストケース

ソースコード