結果
問題 | No.2179 Planet Traveler |
ユーザー | Navier_Boltzmann |
提出日時 | 2023-01-20 11:18:04 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,006 bytes |
コンパイル時間 | 808 ms |
コンパイル使用メモリ | 87,140 KB |
実行使用メモリ | 87,104 KB |
最終ジャッジ日時 | 2023-09-05 05:27:56 |
合計ジャッジ時間 | 11,178 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 110 ms
72,456 KB |
testcase_01 | AC | 109 ms
72,612 KB |
testcase_02 | AC | 110 ms
72,804 KB |
testcase_03 | AC | 109 ms
72,612 KB |
testcase_04 | AC | 108 ms
72,676 KB |
testcase_05 | AC | 108 ms
72,760 KB |
testcase_06 | AC | 110 ms
72,436 KB |
testcase_07 | AC | 125 ms
77,760 KB |
testcase_08 | AC | 145 ms
79,668 KB |
testcase_09 | AC | 150 ms
79,788 KB |
testcase_10 | AC | 132 ms
77,568 KB |
testcase_11 | AC | 442 ms
86,628 KB |
testcase_12 | AC | 457 ms
86,204 KB |
testcase_13 | WA | - |
testcase_14 | AC | 410 ms
86,076 KB |
testcase_15 | AC | 419 ms
87,104 KB |
testcase_16 | AC | 417 ms
87,104 KB |
testcase_17 | AC | 433 ms
86,464 KB |
testcase_18 | AC | 429 ms
85,960 KB |
testcase_19 | AC | 445 ms
86,432 KB |
testcase_20 | AC | 212 ms
81,876 KB |
testcase_21 | AC | 423 ms
85,720 KB |
testcase_22 | AC | 336 ms
84,252 KB |
testcase_23 | AC | 330 ms
84,040 KB |
testcase_24 | AC | 386 ms
85,236 KB |
testcase_25 | AC | 348 ms
84,240 KB |
testcase_26 | AC | 438 ms
85,776 KB |
testcase_27 | AC | 210 ms
81,272 KB |
testcase_28 | AC | 294 ms
83,616 KB |
testcase_29 | AC | 431 ms
85,608 KB |
ソースコード
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.ceil((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)