結果

問題 No.5016 Worst Mayor
ユーザー Kiri8128Kiri8128
提出日時 2023-04-29 15:10:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 257 ms / 2,000 ms
コード長 2,859 bytes
コンパイル時間 859 ms
コンパイル使用メモリ 87,256 KB
実行使用メモリ 94,780 KB
スコア 9,416,171,969
平均クエリ数 400.00
最終ジャッジ日時 2023-04-29 15:11:12
合計ジャッジ時間 15,602 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 233 ms
94,124 KB
testcase_01 AC 229 ms
94,672 KB
testcase_02 AC 229 ms
94,668 KB
testcase_03 AC 252 ms
94,616 KB
testcase_04 AC 227 ms
94,348 KB
testcase_05 AC 226 ms
94,412 KB
testcase_06 AC 220 ms
94,352 KB
testcase_07 AC 229 ms
94,076 KB
testcase_08 AC 245 ms
94,232 KB
testcase_09 AC 221 ms
94,016 KB
testcase_10 AC 223 ms
93,968 KB
testcase_11 AC 226 ms
94,780 KB
testcase_12 AC 230 ms
93,792 KB
testcase_13 AC 254 ms
94,284 KB
testcase_14 AC 231 ms
94,496 KB
testcase_15 AC 230 ms
94,008 KB
testcase_16 AC 229 ms
94,512 KB
testcase_17 AC 229 ms
94,124 KB
testcase_18 AC 257 ms
93,832 KB
testcase_19 AC 229 ms
93,908 KB
testcase_20 AC 232 ms
94,124 KB
testcase_21 AC 230 ms
93,888 KB
testcase_22 AC 234 ms
94,308 KB
testcase_23 AC 245 ms
94,084 KB
testcase_24 AC 226 ms
94,124 KB
testcase_25 AC 228 ms
94,400 KB
testcase_26 AC 229 ms
94,288 KB
testcase_27 AC 253 ms
94,356 KB
testcase_28 AC 229 ms
94,120 KB
testcase_29 AC 230 ms
93,732 KB
testcase_30 AC 226 ms
94,580 KB
testcase_31 AC 224 ms
94,404 KB
testcase_32 AC 251 ms
93,760 KB
testcase_33 AC 226 ms
94,460 KB
testcase_34 AC 227 ms
93,816 KB
testcase_35 AC 231 ms
93,780 KB
testcase_36 AC 252 ms
94,128 KB
testcase_37 AC 229 ms
94,464 KB
testcase_38 AC 231 ms
94,020 KB
testcase_39 AC 231 ms
94,540 KB
testcase_40 AC 227 ms
93,628 KB
testcase_41 AC 236 ms
94,024 KB
testcase_42 AC 222 ms
94,484 KB
testcase_43 AC 231 ms
94,336 KB
testcase_44 AC 228 ms
93,828 KB
testcase_45 AC 229 ms
94,492 KB
testcase_46 AC 229 ms
93,896 KB
testcase_47 AC 231 ms
94,332 KB
testcase_48 AC 231 ms
94,452 KB
testcase_49 AC 229 ms
94,044 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def calc_cost():
    a = int(10 ** 7 / supporter ** 0.5 + 2)
    while supporter * a ** 2 > 10 ** 14:
        a -= 1
    return a
def execute(key, param = None):
    global supporter, money
    if key == 1:
        print(1, *param)
        money -= cost
    elif key == 2:
        print(2)
        supporter += 1
    elif key == 3:
        print(3)
        money += 50000
    else:
        assert 0, "Execute Key Error"
from random import randrange
DEBUG = 0
N, T = map(int, input().split())
supporter = 1
money = 10 ** 6
for _ in range(N):
    a, b, c, d = map(int, input().split())

M = 14
done = [[[0] * M for _ in range(M - 1)], [[0] * (M - 1) for _ in range(M)]]
# priority = [(0, 6, 6), (1, 6, 6), (0, 6, 7)]
priority = [(0, 6, 0), (1, 6, 0), (0, 6, 1), (1, 7, 1), (0, 6, 2), (1, 6, 2), (0, 6, 3), (1, 7, 3), (0, 6, 4), (1, 6, 4), (0, 6, 5), (1, 7, 5), (0, 6, 6), (1, 6, 6), (0, 6, 7), (1, 7, 7), (0, 6, 8), (1, 6, 8), (0, 6, 9), (1, 7, 9), (0, 6, 10), (1, 6, 10), (0, 6, 11), (1, 7, 11), (0, 6, 12), (1, 6, 12), (0, 6, 13), (0, 0, 0), (1, 0, 0), (0, 0, 1), (1, 1, 1), (0, 0, 2), (1, 0, 2), (0, 0, 3), (1, 1, 3), (0, 0, 4), (1, 0, 4), (0, 0, 5), (1, 1, 5), (0, 0, 6), (1, 0, 6), (0, 0, 7), (1, 1, 7), (0, 0, 8), (1, 0, 8), (0, 0, 9), (1, 1, 9), (0, 0, 10), (1, 0, 10), (0, 0, 11), (1, 1, 11), (0, 0, 12), (1, 0, 12), (0, 0, 13), (0, 12, 0), (1, 12, 0), (0, 12, 1), (1, 13, 1), (0, 12, 2), (1, 12, 2), (0, 12, 3), (1, 13, 3), (0, 12, 4), (1, 12, 4), (0, 12, 5), (1, 13, 5), (0, 12, 6), (1, 12, 6), (0, 12, 7), (1, 13, 7), (0, 12, 8), (1, 12, 8), (0, 12, 9), (1, 13, 9), (0, 12, 10), (1, 12, 10), (0, 12, 11), (1, 13, 11), (0, 12, 12), (1, 12, 12), (0, 12, 13), (0, 1, 7), (1, 2, 6), (0, 2, 6), (1, 3, 6), (0, 3, 7), (1, 4, 6), (0, 4, 6), (1, 5, 6), (0, 5, 7), (0, 7, 6), (1, 8, 6), (0, 8, 7), (1, 9, 6), (0, 9, 6), (1, 10, 6), (0, 10, 7), (1, 11, 6), (0, 11, 6), (0, 1, 1), (1, 2, 0), (0, 2, 0), (1, 3, 0), (0, 3, 1), (1, 4, 0), (0, 4, 0), (1, 5, 0), (0, 5, 1), (0, 7, 0), (1, 8, 0), (0, 8, 1), (1, 9, 0), (0, 9, 0), (1, 10, 0), (0, 10, 1), (1, 11, 0), (0, 11, 0), (0, 1, 13), (1, 2, 12), (0, 2, 12), (1, 3, 12), (0, 3, 13), (1, 4, 12), (0, 4, 12), (1, 5, 12), (0, 5, 13), (0, 7, 12), (1, 8, 12), (0, 8, 13), (1, 9, 12), (0, 9, 12), (1, 10, 12), (0, 10, 13), (1, 11, 12), (0, 11, 12)][::-1]
for q in range(T):
    u, v = map(int, input().split())
    cost = calc_cost()
    if DEBUG:
        print("cost =", cost, "u, v =", u, v)
    if u >= cost:
        if cost > (T - 1 - q) * 4000111110:
            execute(3)
            continue
        if priority:
            t, i, j = priority.pop()
            done[t][i][j] = 1
            if t == 0:
                ni, nj = i + 1, j
            else:
                ni, nj = i, j + 1
            execute(1, (i + 1, j + 1, ni + 1, nj + 1))
        else:
            execute(3)
    else:
        execute(2)
0