結果

問題 No.2179 Planet Traveler
ユーザー Navier_Boltzmann
提出日時 2023-01-20 11:16:07
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,995 bytes
コンパイル時間 148 ms
コンパイル使用メモリ 82,764 KB
実行使用メモリ 98,048 KB
最終ジャッジ日時 2024-06-23 01:56:13
合計ジャッジ時間 14,267 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 25 WA * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from collections import *
from itertools import *
from functools import *
from heapq import *
import math,sys
input = sys.stdin.readline
N = int(input())
dist = [[0]*N for _ in range(N)]
XYT = [tuple(map(int,input().split())) for _ in range(N)]
for i in range(N-1):
xi,yi,ti = XYT[i]
for j in range(i+1,N):
xj,yj,tj = XYT[j]
if ti==tj:
td = (xi-xj)**2 + (yi-yj)**2
else:
td = (math.sqrt(xi**2+yi**2)-math.sqrt(xj**2+yj**2))**2
dist[i][j]=td
dist[j][i]=td
class DSU:
def __init__(self, n):
self._n = n
self.parent_or_size = [-1] * n
def merge(self, a, b):
assert 0 <= a < self._n
assert 0 <= b < self._n
x, y = self.leader(a), self.leader(b)
if x == y: return x
if -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, x
self.parent_or_size[x] += self.parent_or_size[y]
self.parent_or_size[y] = x
return x
def same(self, a, b):
assert 0 <= a < self._n
assert 0 <= b < self._n
return self.leader(a) == self.leader(b)
def leader(self, a):
assert 0 <= a < self._n
if self.parent_or_size[a] < 0: return a
self.parent_or_size[a] = self.leader(self.parent_or_size[a])
return self.parent_or_size[a]
def size(self, a):
assert 0 <= a < self._n
return -self.parent_or_size[self.leader(a)]
def groups(self):
leader_buf = [self.leader(i) for i in range(self._n)]
result = [[] for _ in range(self._n)]
for i in range(self._n): result[leader_buf[i]].append(i)
return [r for r in result if r != []]
def is_ok(s):
D = DSU(N)
for i in range(N-1):
for j in range(i+1,N):
if dist[i][j]<=s:
D.merge(i,j)
return D.same(0,N-1)
x = -1
y = 10**18
while y-x>1:
mid = (y+x)//2
if is_ok(mid):
y = mid
else:
x = mid
print(y)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0