結果

問題 No.5007 Steiner Space Travel
ユーザー brthyyjpbrthyyjp
提出日時 2023-04-27 22:40:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 961 ms / 1,000 ms
コード長 4,676 bytes
コンパイル時間 813 ms
コンパイル使用メモリ 87,180 KB
実行使用メモリ 84,736 KB
スコア 8,288,936
最終ジャッジ日時 2023-04-27 22:41:30
合計ジャッジ時間 32,882 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 945 ms
83,532 KB
testcase_01 AC 947 ms
83,068 KB
testcase_02 AC 947 ms
83,080 KB
testcase_03 AC 944 ms
83,244 KB
testcase_04 AC 944 ms
82,784 KB
testcase_05 AC 946 ms
83,904 KB
testcase_06 AC 947 ms
83,472 KB
testcase_07 AC 950 ms
84,248 KB
testcase_08 AC 942 ms
84,088 KB
testcase_09 AC 944 ms
84,256 KB
testcase_10 AC 943 ms
84,012 KB
testcase_11 AC 943 ms
83,580 KB
testcase_12 AC 944 ms
84,736 KB
testcase_13 AC 943 ms
83,260 KB
testcase_14 AC 945 ms
83,952 KB
testcase_15 AC 961 ms
83,552 KB
testcase_16 AC 942 ms
83,936 KB
testcase_17 AC 944 ms
83,728 KB
testcase_18 AC 948 ms
84,292 KB
testcase_19 AC 944 ms
83,840 KB
testcase_20 AC 946 ms
83,672 KB
testcase_21 AC 942 ms
84,396 KB
testcase_22 AC 946 ms
84,364 KB
testcase_23 AC 945 ms
84,192 KB
testcase_24 AC 947 ms
83,600 KB
testcase_25 AC 944 ms
83,896 KB
testcase_26 AC 946 ms
82,824 KB
testcase_27 AC 947 ms
82,872 KB
testcase_28 AC 946 ms
84,036 KB
testcase_29 AC 943 ms
84,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import math
import random
import os
import io
import sys
from time import time
start_time = time()

input = sys.stdin.readline


random.seed(42)
alpha = 5
mx = 1000
INF = float('inf')
Ts = 50
Te = 10
TIME_LIMIT = 0.85

max_iter = 50

limit = 700

n, m = map(int, input().split())
XY = []
for i in range(n):
    x, y = map(int, input().split())
    XY.append((x, y))


def kMeans(XY, k):
    n = len(XY)
    clusters = [random.randint(0, k-1) for i in range(n)]
    for _ in range(max_iter):
        centroidX = [0]*k
        centroidY = [0]*k
        clusterCnt = [0]*k
        for i, c in enumerate(clusters):
            clusterCnt[c] += 1
            centroidX[c] += XY[i][0]
            centroidY[c] += XY[i][1]
        for c in range(k):
            if clusterCnt[c] == 0:
                centroidX[c] = random.randint(0, mx)
                centroidY[c] = random.randint(0, mx)
            else:
                centroidX[c] //= clusterCnt[c]
                centroidY[c] //= clusterCnt[c]
        newClusters = [-1]*n
        for i in range(n):
            mn = INF
            nc = -1
            x, y = XY[i]
            for c in range(k):
                d = (x-centroidX[c])**2+(y-centroidY[c])**2
                if d < mn:
                    mn = d
                    nc = c
            newClusters[i] = nc
        clusters = newClusters
    return centroidX, centroidY


CD = []
centroidX, centroidY = kMeans(XY, m)
for c, d in zip(centroidX, centroidY):
    CD.append((c, d))

XY += CD


def calc_energy(i, j):
    xi, yi = XY[i]
    xj, yj = XY[j]
    d2 = (xi-xj)**2+(yi-yj)**2
    if 0 <= i < n and 0 <= j < n:
        return (alpha**2)*d2
    elif n <= i < n+m and n <= j < n+m:
        return d2
    else:
        return alpha*d2


g = [[] for i in range(n+m)]
dist_table = [[INF]*(n+m) for i in range(n+m)]
for i in range(n+m):
    for j in range(n+m):
        if i == j:
            continue
        x1, y1 = XY[j]
        dist = calc_energy(i, j)
        g[i].append((dist, j))
        dist_table[i][j] = dist


def calc_dist(path, dist_table):
    res = 0
    for v, nv in zip(path, path[1:]):
        res += dist_table[v][nv]
    return res


def nearest_neighbor(s, g):
    nonvisit = set(range(n))
    path = []
    path.append(s)
    nonvisit.remove(s)
    while nonvisit:
        min_dist = INF
        nx = -1
        for d, v in g[path[-1]]:
            if not v in nonvisit:
                continue
            if d < min_dist:
                min_dist = d
                nx = v
        path.append(nx)
        nonvisit.remove(nx)
    return path+[s]


def anealing(path, dist_table, Ts, Te, time_limit, threshold):
    while True:
        now_time = time()
        if now_time - start_time > time_limit:
            return path
        # insert station
        if random.random() > threshold:
            i = random.randint(0, len(path)-2)
            u, v = path[i], path[i+1]
            min_dist = dist_table[u][v]
            nx = -1
            for k in range(m):
                w = n+k
                dist = dist_table[u][w]+dist_table[w][v]
                if dist <= min_dist:
                    min_dist = dist
                    nx = w
            diff = min_dist-dist_table[u][v]
            temp = Ts+(Te-Ts)*(time()-start_time)/time_limit
            prob = math.exp(min(700, -diff / temp))
            if prob > random.random():
                if nx != -1:
                    path = path[0:i+1]+[nx]+path[i+1:]
        # 2-opto
        else:
            i = random.randint(0, len(path)-4)
            p1 = path[i]
            p2 = path[i+1]
            p_dist = dist_table[p1][p2]
            j = random.randint(i+2, len(path)-2)
            q1 = path[j]
            q2 = path[j+1]
            q_dist = dist_table[q1][q2]
            q_dist = dist_table[q1][q2]
            cur_dist = p_dist + q_dist
            new_dist = dist_table[p1][q1]+dist_table[p2][q2]
            diff = new_dist-cur_dist
            temp = Ts+(Te-Ts)*(time()-start_time)/time_limit
            prob = math.exp(min(700, -diff / temp))
            if prob > random.random():
                sep1, sep2, sep3 = path[:i+1], path[i+1:j+1], path[j+1:]
                sep2.reverse()
                path = sep1+sep2+sep3


path = nearest_neighbor(0, g)
path = anealing(path, dist_table, Ts, Te, 0.5, 1)
path = anealing(path, dist_table, Ts, Te, TIME_LIMIT, 0.7)

s = calc_dist(path, dist_table)
score = round(10**9/(1000+math.sqrt(s)))
print(score, file=sys.stderr, flush=True)

for c, d in CD:
    print(c, d)

print(len(path))
for k in range(len(path)):
    r = path[k]
    if 0 <= r < n:
        print(1, r+1)
    else:
        print(2, r-n+1)
0