結果

問題 No.5018 Let's Make a Best-seller Book
ユーザー Kiri8128Kiri8128
提出日時 2023-10-01 18:05:03
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 142 ms / 400 ms
コード長 5,980 bytes
コンパイル時間 593 ms
コンパイル使用メモリ 87,384 KB
実行使用メモリ 93,252 KB
スコア 136,118
平均クエリ数 52.00
最終ジャッジ日時 2023-10-01 18:05:24
合計ジャッジ時間 19,125 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 137 ms
93,024 KB
testcase_01 AC 133 ms
92,544 KB
testcase_02 AC 142 ms
92,660 KB
testcase_03 AC 134 ms
92,364 KB
testcase_04 AC 136 ms
93,092 KB
testcase_05 AC 133 ms
92,524 KB
testcase_06 AC 137 ms
92,812 KB
testcase_07 AC 131 ms
93,160 KB
testcase_08 AC 130 ms
92,848 KB
testcase_09 AC 131 ms
92,812 KB
testcase_10 AC 131 ms
92,984 KB
testcase_11 AC 133 ms
93,156 KB
testcase_12 AC 133 ms
92,764 KB
testcase_13 AC 136 ms
92,576 KB
testcase_14 AC 131 ms
92,528 KB
testcase_15 AC 130 ms
92,860 KB
testcase_16 AC 133 ms
92,500 KB
testcase_17 AC 134 ms
93,252 KB
testcase_18 AC 132 ms
92,572 KB
testcase_19 AC 134 ms
92,416 KB
testcase_20 AC 132 ms
92,576 KB
testcase_21 AC 131 ms
92,644 KB
testcase_22 AC 133 ms
92,360 KB
testcase_23 AC 134 ms
92,692 KB
testcase_24 AC 136 ms
92,732 KB
testcase_25 AC 131 ms
92,820 KB
testcase_26 AC 133 ms
92,568 KB
testcase_27 AC 133 ms
92,964 KB
testcase_28 AC 132 ms
92,348 KB
testcase_29 AC 134 ms
92,332 KB
testcase_30 AC 133 ms
92,640 KB
testcase_31 AC 133 ms
93,188 KB
testcase_32 AC 134 ms
92,580 KB
testcase_33 AC 131 ms
92,520 KB
testcase_34 AC 133 ms
92,660 KB
testcase_35 AC 132 ms
92,640 KB
testcase_36 AC 131 ms
92,804 KB
testcase_37 AC 132 ms
92,992 KB
testcase_38 AC 130 ms
92,676 KB
testcase_39 AC 132 ms
92,636 KB
testcase_40 AC 133 ms
93,028 KB
testcase_41 AC 133 ms
92,780 KB
testcase_42 AC 132 ms
92,732 KB
testcase_43 AC 135 ms
93,048 KB
testcase_44 AC 134 ms
92,580 KB
testcase_45 AC 133 ms
92,836 KB
testcase_46 AC 131 ms
92,624 KB
testcase_47 AC 138 ms
92,624 KB
testcase_48 AC 131 ms
92,964 KB
testcase_49 AC 132 ms
92,420 KB
testcase_50 AC 133 ms
92,672 KB
testcase_51 AC 132 ms
92,476 KB
testcase_52 AC 133 ms
92,912 KB
testcase_53 AC 134 ms
92,704 KB
testcase_54 AC 133 ms
92,540 KB
testcase_55 AC 133 ms
93,012 KB
testcase_56 AC 132 ms
92,996 KB
testcase_57 AC 135 ms
92,548 KB
testcase_58 AC 139 ms
92,728 KB
testcase_59 AC 131 ms
92,680 KB
testcase_60 AC 130 ms
92,500 KB
testcase_61 AC 131 ms
92,792 KB
testcase_62 AC 132 ms
92,780 KB
testcase_63 AC 130 ms
92,996 KB
testcase_64 AC 134 ms
92,672 KB
testcase_65 AC 134 ms
92,996 KB
testcase_66 AC 134 ms
92,680 KB
testcase_67 AC 133 ms
92,968 KB
testcase_68 AC 132 ms
92,556 KB
testcase_69 AC 136 ms
92,364 KB
testcase_70 AC 133 ms
92,848 KB
testcase_71 AC 130 ms
92,524 KB
testcase_72 AC 131 ms
92,992 KB
testcase_73 AC 132 ms
92,712 KB
testcase_74 AC 133 ms
93,160 KB
testcase_75 AC 132 ms
92,644 KB
testcase_76 AC 130 ms
92,812 KB
testcase_77 AC 131 ms
92,888 KB
testcase_78 AC 132 ms
92,696 KB
testcase_79 AC 131 ms
92,916 KB
testcase_80 AC 131 ms
92,700 KB
testcase_81 AC 135 ms
92,840 KB
testcase_82 AC 131 ms
92,416 KB
testcase_83 AC 133 ms
92,936 KB
testcase_84 AC 131 ms
92,484 KB
testcase_85 AC 133 ms
93,004 KB
testcase_86 AC 132 ms
92,552 KB
testcase_87 AC 133 ms
93,124 KB
testcase_88 AC 131 ms
92,800 KB
testcase_89 AC 130 ms
92,548 KB
testcase_90 AC 134 ms
92,788 KB
testcase_91 AC 131 ms
92,496 KB
testcase_92 AC 136 ms
92,704 KB
testcase_93 AC 130 ms
93,084 KB
testcase_94 AC 132 ms
92,520 KB
testcase_95 AC 134 ms
92,768 KB
testcase_96 AC 135 ms
92,500 KB
testcase_97 AC 135 ms
92,588 KB
testcase_98 AC 131 ms
92,348 KB
testcase_99 AC 130 ms
93,028 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

if LOCAL:
    DEBUG = 1
    print("LOOP ?")
    LOOP = int(input())
else:
    DEBUG = 0
    LOOP = 1

def receive():
    global P
    global R
    global money
    global MI, MA
    global sell_count
    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 adj(n):
    if n < 4:
        return 3
    if n % 10 < 3:
        return n // 10 * 10
    if n % 10 < 6:
        return n // 10 * 10 + 3
    return n // 10 * 10 + 6
    
def Order():
    global P
    global R
    global money
    global best_allocation_flg
    target = 10
    buy_count = [0] * N
    
    best_allocation = [((MA[i] + MI[i]) / 2 * 1.05 ** P[i]) ** 2 for i in range(N)]
    su = sum(best_allocation)
    for i in range(N):
        best_allocation[i] *= 10 ** 8
        best_allocation[i] = adj(int(best_allocation[i]))
    best_allocation_flg = [0] * N
    for i in range(N):
        if t == 0:
            target = 3
        elif t < 5:
            target = adj(int((10 / 3 * 1.05 ** P[i] * (MA[i] * 0.0 + MI[i] * 1.0)) ** 2))
        elif t < 20:
            target = adj(int(100 / 9 * 1.05 ** P[i] * (MA[i] * 0.0 + MI[i] * 1.0)))
            # target = adj(int((10 / 3 * 1.05 ** P[i] * (MA[i] * 0.5 + MI[i] * 0.5)) ** 2))
        elif t < 30 and P[i] < 50:
            target = adj(int(100 / 4 * 1.05 ** P[i] * (MA[i] + MI[i]) / 2))
        elif t < 40 and P[i] < 50:
            target = adj(int(100 / 1 * 1.05 ** P[i] * (MA[i] + MI[i]) / 2))
        elif t < 100:
            target = best_allocation[i]
            best_allocation_flg[i] = 1
        elif t < 48:
            target = adj(int(100 / 0.3 * 1.05 ** P[i] * (MA[i] + MI[i]) / 2))
        else:
            target = adj(int(100 / 0.05 * 1.05 ** P[i] * (MA[i] + MI[i]) / 2))
        buy_count[i] = max(0, target - R[i])
    
    if 1:
        su_best = sum([a for a, f in zip(best_allocation, best_allocation_flg) if f])
        su_R = sum([r for r, f in zip(R, best_allocation_flg) if f])
        used = sum([max(t - r, 0) for t, r, f in zip(buy_count, R, best_allocation_flg) if not f])
        avail = max(0, money // 500 - used + su_R)
        for i in range(N):
            if best_allocation_flg[i]:
                buy_count[i] = adj(int(best_allocation[i] / su_best * avail - R[i]))
                # buy_count[i] = adj(int(best_allocation[i] / su_best * avail))
    
    while 1:
        r = sum(buy_count) * 500 / money
        if r <= 1:
            break
        
        
        for i in range(N):
            buy_count[i] = adj(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)

total_total = 0
for loop in range(LOOP):
    if DEBUG:
        T, N, money = 52, 10, 2 * 10 ** 6
        D = [random() + 0.5 for _ in range(N)]
        # D = [random() / 2 + 1.0 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
    sell_count = [0] * N
    best_allocation_flg = [0] * N
    MA = [1.5] * N
    MI = [0.5] * N
    P = [0] * N
    R = [0] * N
    for t in range(T):
        if (20 < t < 40 and money >= 2500000) and sorted(P)[-1] < 58:
            Advertise(3)
        elif (0 < t < 20 and money >= 1100000) and sorted(P)[-1] < 59:
            Advertise(2)
        elif (0 < t < 35 and money >= 1200000) and sorted(P)[-1] < 59:
            Advertise(2)
        elif t < 4 and money >= 6000000:
            Advertise(4)
        elif t < 4 and money >= 3000000:
            Advertise(3)
        else:
            Order()
        if DEBUG:
            if LOOP == 1:
                print("-" * 20)
                print("t =", t)
                print("Money =", money)
                
        receive()
        if DEBUG:
            if LOOP == 1:
                print("Money =", money)
                print("P =", P)
                print("R =", R)
                print("sell_count =", sell_count)
                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("Flg =", best_allocation_flg)
                print("Total =", sum(total_sell_count), total_sell_count)
    if LOCAL:
        total_total += sum(total_sell_count)
    if LOCAL and 20 >= LOOP > 1:
        print("loop =", loop, total_sell_count, sum(total_sell_count), round(total_total / (loop + 1)))
if LOCAL:
    print("LOOP =", LOOP, round(total_total / LOOP))
0