結果

問題 No.94 圏外です。(EASY)
ユーザー ckawatak
提出日時 2019-04-24 23:02:09
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 260 ms / 5,000 ms
コード長 1,178 bytes
コンパイル時間 305 ms
コンパイル使用メモリ 82,376 KB
実行使用メモリ 77,740 KB
最終ジャッジ日時 2024-11-15 18:13:34
合計ジャッジ時間 3,531 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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

from math import sqrt
from collections import deque
N = int(input())
points = []
for _ in range(N):
points.append(list(map(int, input().split())))
G = []
for i in range(N):
graph = []
for j in range(N):
distance = (points[i][0]-points[j][0])**2 + \
(points[i][1]-points[j][1])**2
if distance <= 100:
graph.append(j)
G.append(graph)
def dfs(start):
reached = []
visited = [False for _ in range(N)]
que = deque()
que.append(start)
while len(que) != 0:
adjacent = que.popleft()
visited[adjacent] = True
reached.extend(G[adjacent])
for point in G[adjacent]:
if not visited[point]:
que.appendleft(point)
longest = 0
for end in reached:
distance = sqrt((points[start][0]-points[end][0])**2 + \
(points[start][1]-points[end][1])**2)
longest = max(longest, distance)
return longest
longest = 0
for i in range(N):
longest = max(longest, dfs(i))
if longest == 0:
if len(points) == 0:
print(1)
else:
print(2)
else:
print(longest+2)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0