Реальный ЕГЭ 2026 по информатике

(закомментирован код для файла А)

from math import dist

def dbscan(points, eps):
clusters = []
while points:
cluster = [points.pop()]
for star in cluster:
new = [point for point in points if dist(point[:2], star[:2]) <= eps]
cluster += new
for point in new: points.remove(point)
clusters.append(cluster)
return clusters

def get_centroid(cluster):
lst = []
for star in cluster:
lst.append((sum(dist(star[:2], point[:2]) for point in cluster), star))
return min(lst)[1]

def yellow_sverhgigants_in_cluster(cluster):
lst = []
for star in cluster:
if star[2][0] == 'Z' and star[2][-2:] == 'IV':
lst.append(star)
return lst

file = open('файл.txt')
points = []
for line in file:
x, y, tip = line.replace(',', '.').split()
points.append([float(x), float(y), tip])

# red_gigants = [point for point in points if point[2][0] == 'Y' and point[2][-3:] == 'III']

clusters = dbscan(points, 1)
print([len(c) for c in clusters])

yellow_sg_clusters = [yellow_sverhgigants_in_cluster(c) for c in clusters]
print([len(y) for y in yellow_sg_clusters])

b1 = 10**40
for ind_cl in range(3):
for i in range(len(yellow_sg_clusters[ind_cl])):
for j in range(i + 1, len(yellow_sg_clusters[ind_cl])):
b1 = min(b1, dist(yellow_sg_clusters[ind_cl][i][:2], yellow_sg_clusters[ind_cl][j][:2]))
b1 = int(abs(b1 * 10000) // 1)

centroids = [get_centroid(cluster) for cluster in clusters]

b2 = int(abs(dist(centroids[0][:2], centroids[1][:2]) * 10000) // 1)
print(b1, b2)

# dists = [dist(centroids[1][:2], rg[:2]) for rg in red_gigants]
# a1 = int(abs(min(dists) * 10000) // 1)
# a2 = int(abs(max(dists) * 10000) // 1)
# print(a1, a2)