結果

問題 No.5020 Averaging
ユーザー 寝癖寝癖
提出日時 2024-02-25 13:31:24
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 1,979 bytes
コンパイル時間 276 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 86,860 KB
スコア 32,234,052
最終ジャッジ日時 2024-02-25 13:32:15
合計ジャッジ時間 50,644 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 941 ms
85,832 KB
testcase_01 AC 941 ms
85,564 KB
testcase_02 AC 941 ms
86,260 KB
testcase_03 AC 941 ms
86,520 KB
testcase_04 AC 941 ms
85,388 KB
testcase_05 AC 942 ms
86,144 KB
testcase_06 AC 942 ms
86,192 KB
testcase_07 RE -
testcase_08 AC 941 ms
84,944 KB
testcase_09 AC 941 ms
85,864 KB
testcase_10 AC 943 ms
85,508 KB
testcase_11 AC 940 ms
86,148 KB
testcase_12 AC 941 ms
85,420 KB
testcase_13 AC 957 ms
86,056 KB
testcase_14 AC 941 ms
85,908 KB
testcase_15 AC 974 ms
85,704 KB
testcase_16 AC 941 ms
85,820 KB
testcase_17 AC 940 ms
86,232 KB
testcase_18 AC 943 ms
85,472 KB
testcase_19 AC 940 ms
85,548 KB
testcase_20 AC 942 ms
86,284 KB
testcase_21 AC 940 ms
86,460 KB
testcase_22 AC 942 ms
85,180 KB
testcase_23 AC 941 ms
85,420 KB
testcase_24 AC 941 ms
85,748 KB
testcase_25 AC 942 ms
86,012 KB
testcase_26 AC 941 ms
86,860 KB
testcase_27 RE -
testcase_28 AC 943 ms
85,184 KB
testcase_29 AC 941 ms
85,388 KB
testcase_30 AC 941 ms
85,680 KB
testcase_31 AC 942 ms
86,388 KB
testcase_32 AC 941 ms
85,764 KB
testcase_33 AC 941 ms
85,716 KB
testcase_34 AC 942 ms
86,136 KB
testcase_35 AC 942 ms
85,312 KB
testcase_36 AC 941 ms
86,152 KB
testcase_37 AC 941 ms
86,308 KB
testcase_38 AC 944 ms
86,288 KB
testcase_39 AC 940 ms
85,820 KB
testcase_40 AC 940 ms
86,092 KB
testcase_41 AC 940 ms
86,240 KB
testcase_42 AC 945 ms
86,032 KB
testcase_43 AC 943 ms
85,208 KB
testcase_44 AC 940 ms
86,172 KB
testcase_45 AC 941 ms
86,232 KB
testcase_46 AC 945 ms
86,348 KB
testcase_47 RE -
testcase_48 AC 943 ms
86,372 KB
testcase_49 AC 941 ms
85,632 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from math import log10, floor, exp
from random import randint, random
from time import time

time_start = time()

N = int(input())
init_A, init_B = [list(i) for i in zip(*[list(map(int, input().split())) for _ in range(N)])]

def calc_socre(op):
    A, B = exec_op(op)
    X = len(op)

    V1, V2 = abs(5*10**17-A[0]), abs(5*10**17-B[0])
    V = max(V1, V2)
    if V == 0:
        return 2000050 - X
    else:
        return floor(2000000.0 - 100000.0 * log10(V+1))

def exec_op(op):
    A, B = init_A[:], init_B[:]
    for u, v in op:
        a, b = A[u-1], A[v-1]
        A[u-1], A[v-1] = (a+b)//2, (a+b)//2
        c, d = B[u-1], B[v-1]
        B[u-1], B[v-1] = (c+d)//2, (c+d)//2
    return A, B

X = 50
op = []
for _ in range(X):
    u = randint(1, N-1)
    v = randint(u+1, N)
    op.append((u, v))

# 山登り法
# score = calc_socre(op)
# while time() - time_start < 0.90:
#     if randint(0, 1):
#         u = randint(1, N-1)
#         v = randint(u+1, N)
#         op[randint(0, X-1)] = (u, v)
#     else:
#         u, v = randint(0, X-1), randint(0, X-1)
#         op[u], op[v] = op[v], op[u]
#     new_score = calc_socre(op)
#     if new_score > score:
#         score = new_score
#     else:
#         op[u], op[v] = op[v], op[u]
    
# 焼きなまし
score = calc_socre(op)
start_temp = 2000
end_temp = 10
TIME_LIMIT = 0.90

while True:
    now_time = time() - time_start
    if now_time > TIME_LIMIT:
        break
    new_op = op[:]
    if randint(0, 1):
        u = randint(1, N-1)
        v = randint(u+1, N)
        new_op[randint(0, X-1)] = (u, v)
    else:
        u, v = randint(0, X-1), randint(0, X-1)
        new_op[u], new_op[v] = new_op[v], new_op[u]
    new_score = calc_socre(new_op)
    temp = start_temp + (end_temp - start_temp) * now_time / TIME_LIMIT
    prob = exp((new_score - score) / temp)
    if new_score > score or random() < prob:
        op = new_op
        score = new_score

# print(score)

print(X)
for u, v in op:
    print(u, v)
0