結果

問題 No.5018 Let's Make a Best-seller Book
ユーザー trineutrontrineutron
提出日時 2023-09-24 01:08:51
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 51 ms / 400 ms
コード長 1,637 bytes
コンパイル時間 86 ms
コンパイル使用メモリ 10,764 KB
実行使用メモリ 24,476 KB
スコア 4,377
平均クエリ数 52.00
最終ジャッジ日時 2023-10-01 12:31:58
合計ジャッジ時間 9,292 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#
T, N, money = map(int, input().split())
assert T == 52
assert N == 10
assert money == 2000000
S = [0] * N
P = [0] * N
R = [0] * N
#
for week in range(T):
# ()
if min(R) > 0 and money >= 500000:
x = min(5, (money // 500000).bit_length())
money_prev = money - 500000 * 2 ** (x - 1)
assert money_prev >= 0
P_prev = [min(60, P[i] + x) for i in range(N)]
R_prev = R
else:
L = [money // (500 * N)] * N
assert min(L) >= 0
money_prev = money - 500 * sum(L)
assert money_prev >= 0
P_prev = P
R_prev = [R[i] + L[i] for i in range(N)]
print("1", *L, flush=True)
# ()
money = int(input())
S = list(map(int, input().split()))
P = list(map(int, input().split()))
R = list(map(int, input().split()))
assert len(S) == N
assert len(P) == N
assert len(R) == N
assert money == money_prev + 1000 * sum(S)
assert -60 <= min(P) and max(P) <= 60
assert min(R) >= 0
def calc_S(i, d, r):
return int(min(R_prev[i], R_prev[i] ** 0.5 * 1.05 ** P_prev[i] * d * r))
for i in range(N):
assert calc_S(i, 0.5, 0.75) <= S[i] <= calc_S(i, 1.5, 1.25)
P_expected = P_prev[i]
if R_prev[i] != 0 and 10 * S[i] >= 3 * R_prev[i]:
P_expected += 1
if R_prev[i] != 0 and 10 * S[i] < R_prev[i]:
P_expected -= 1
P_expected = max(-60, min(60, P_expected))
assert P[i] == P_expected
assert R[i] == R_prev[i] - S[i]
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0