結果

問題 No.5018 Let's Make a Best-seller Book
ユーザー Kiri8128Kiri8128
提出日時 2023-10-01 15:46:43
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 153 ms / 400 ms
コード長 3,352 bytes
コンパイル時間 277 ms
コンパイル使用メモリ 86,976 KB
実行使用メモリ 92,316 KB
スコア 36,840
平均クエリ数 52.00
最終ジャッジ日時 2023-10-01 15:47:09
合計ジャッジ時間 18,445 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます

ソースコード

diff # 

from random import gauss, random, randrange
try:
    LOCAL
except NameError:
    LOCAL = 0

if LOCAL:
    DEBUG = 1
else:
    DEBUG = 0

def receive():
    global P
    global R
    global money
    global MI, MA
    if DEBUG:
        sell_count = [min(R[i], int(R[i] ** 0.5 * 1.05 ** P[i] * D[i] * (0.75 + random() * 0.5))) for i in range(N)]
        money += 1000 * sum(sell_count)
    else:
        money = int(input())
        sell_count = [int(a) for a in input().split()]
    
    for i in range(N):
        if R[i]:
            ma = (sell_count[i] + 1) / (R[i] ** 0.5 * 0.75 * 1.05 ** P[i])
            mi = sell_count[i] / (R[i] ** 0.5 * 1.25 * 1.05 ** P[i])
            MI[i] = max(mi, MI[i])
            if sell_count[i] < R[i]:
                MA[i] = min(ma, MA[i])
    for i in range(N):
        if R[i]:
            if sell_count[i] * 10 >= 3 * R[i]:
                P[i] = min(P[i] + 1, 60)
            elif sell_count[i] * 10 < R[i]:
                P[i] = max(P[i] - 1, -60)
    
    if DEBUG:
        for i in range(N):
            R[i] -= sell_count[i]
    else:
        for i, a in enumerate(input().split()):
            P[i] = int(a)
        for i, a in enumerate(input().split()):
            R[i] = int(a)
    
    for i in range(N):
        total_sell_count[i] += sell_count[i]
    
def Order():
    global P
    global R
    global money
    target = 10
    buy_count = [0] * N
    for i in range(N):
        if t < 5:
            target = max(1, int(100 / 9 * 1.05 ** P[i] * (MA[i] + MI[i]) / 2 / 10)) * 10
        elif t < 20:
            target = max(1, int(100 / 9 * 1.05 ** P[i] * (MA[i] + MI[i]) / 2 / 10)) * 10
        elif t < 30:
            target = max(1, int(100 / 9 * 1.05 ** P[i] * (MA[i] + MI[i]) / 2 / 10)) * 10
        else:
            target = max(1, int(100 / 0.8 * 1.05 ** P[i] * (MA[i] + MI[i]) / 2 / 10)) * 10
        buy_count[i] = max(0, target - R[i])
    while 1:
        r = sum(buy_count) * 500 / money
        if r <= 1:
            break
        for i in range(N):
            buy_count[i] = int(buy_count[i] / r)
    
    money -= sum(buy_count) * 500
    if money < 0:
        while 1:
            pass
    assert money >= 0
    for i in range(N):
        R[i] += buy_count[i]
    if not DEBUG:
        print(1, *buy_count)
    
def Advertise(x):
    global money
    money -= 500000 << x - 1
    if money < 0:
        while 1:
            pass
    assert money >= 0
    for i in range(N):
        P[i] = min(P[i] + x, 60)
    if not DEBUG:
        print(2, x)

if DEBUG:
    T, N, money = 52, 10, 2 * 10 ** 6
    D = [random() + 0.5 for _ in range(N)]
    
else:
    T, N, money = map(int, input().split())
    D = [random() + 0.5 for _ in range(N)]
total_sell_count = [0] * N
MA = [1.5] * N
MI = [0.5] * N
P = [0] * N
R = [0] * N
for t in range(T):
    if t == 0 or (t < 30 and money >= 1500000):
        Advertise(2)
    elif t < 45 and money >= 8000000:
        Advertise(4)
    else:
        Order()
    receive()
    if DEBUG:
        print("-" * 20)
        print("t =", t)
        print("Money =", money)
        print("P =", P)
        print("R =", R)
        print("MI =", ["{:.2f}".format(a) for a in MI])
        print("MA =", ["{:.2f}".format(a) for a in MA])
        print("D  =", ["{:.2f}".format(a) for a in D])
        print("Total =", sum(total_sell_count), total_sell_count)
0