K-Means Clustering

题面

实现 2D 点的 k‑means 聚类：迭代执行“分配最近质心”和“按簇均值更新质心”。

Implementation Requirements

• External libraries are not permitted
• The solve function signature must remain unchanged
• 输出写入 labels、final_centroid_x、final_centroid_y

Examples

见页面示例（sample_size=4, k=2）。

Constraints

• 1 ≤ sample_size ≤ 1,000,000；1 ≤ k ≤ 1000
• 数组为 float32，labels 为 int32
• Performance: k=5, max_iterations=30, sample_size=10,000