提出 #33128807

---

ソースコード 拡げる

import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)



def isOverlap(c1, c2):
    kyori = (c1[0]-c2[0])**2+(c1[1]-c2[1])**2
    return kyori<= (c1[2]+c2[2])**2 and kyori>= (c1[2]-c2[2])**2
    

def DFS(G, v):
    seen[v] = True
    for next_v in G[v]: 
         
        if seen[next_v]:
            continue
        DFS(G, next_v)            


n = int(input().strip())

sx, sy, tx, ty = map(int, input().strip().split())

circles = []

G = [[] for i in range(n)]


for i in range(n):
    x, y, r = map(int, input().strip().split())
    if (sx-x)**2+(sy-y)**2 == r**2:
        s = i
    if (tx-x)**2+(ty-y)**2 == r**2:
        t = i
    for j, c in enumerate(circles):
        if isOverlap([x, y, r], c):
            G[i].append(j)
            G[j].append(i)
    circles.append([x, y, r])


seen = [False for i in range(n)]
DFS(G, s)

if seen[t]:
    print("Yes")
else:
    print("No")

提出情報

ジャッジ結果