{"problem":{"name":"[POI 2020/2021 R3] 星间通信 / Komunikacja międzyplanetarn","description":{"content":"二维平面上有 $n$ 个点。 对于每个点，算出它到其他所有点的欧氏距离之和。 相对误差不超过 $0.1\\%$ 即可。","description_type":"Markdown"},"platform":"Luogu","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":{"LuoguStyle":"P7"},"is_remote":true,"is_sync":true,"sync_url":null,"sign":"LGP9405"},"statements":[{"statement_type":"Markdown","content":"二维平面上有 $n$ 个点。\n\n对于每个点，算出它到其他所有点的欧氏距离之和。\n\n相对误差不超过 $0.1\\%$ 即可。\n\n## Input\n\n第一行一个整数 $n$。\n\n接下来 $n$ 行，每行两个整数 $x,y$，表示一个点的坐标。\n\n## Output\n\n$n$ 行，每行一个实数，表示每个点的答案。\n\n[samples]\n\n## Background\n\n译自 [XXVIII Olimpiada Informatyczna - III etap](https://sio2.mimuw.edu.pl/c/oi28-3/dashboard/) [Komunikacja międzyplanetarn](https://szkopul.edu.pl/problemset/problem/43LcdhShos7i99wnVNtQYUUK/statement/)。\n\nd2t1。\n\n## Note\n\n对于所有数据，$2\\leq n\\leq 100000$，$-10^6\\leq x,y\\leq 10^6$。\n\n| 子任务编号 | 附加限制 | 分数 |\n| :----------: | :----------: | :----------: |\n| 1 | $n\\leq 1000$ | 4 |\n| 2 | 所有点共线 | 16 |\n| 3 | 点的坐标随机，相对误差不超过 $2\\%$ 即可 | 20 |\n| 4 | | 60 |","is_translate":false,"language":"English"}],"meta":{"iden":"LGP9405","tags":["数学","2020","POI（波兰）","Special Judge","微积分","其它技巧"],"sample_group":[["4\n-1 0\n0 0\n3 3\n-1 1\n","7.000000000000\n6.656854249492\n13.714776642119\n6.886349517373\n"],["25\n-2 -2\n-2 -1\n-2 0\n-2 1\n-2 2\n-1 -2\n-1 -1\n-1 0\n-1 1\n-1 2\n0 -2\n0 -1\n0 0\n0 1\n0 2\n1 -2\n1 -1\n1 0\n1 1\n1 2\n2 -2\n2 -1\n2 0\n2 1\n2 2\n","79.340412611230\n68.023981606779\n64.155694316737\n68.023981606779\n79.340412611230\n68.023981606779\n55.532407162959\n51.265774235248\n55.532407162959\n68.023981606779\n64.155694316737\n51.265774235248\n46.859106568475\n51.265774235248\n64.155694316737\n68.023981606779\n55.532407162958\n51.265774235248\n55.532407162959\n68.023981606779\n79.340412611230\n68.023981606779\n64.155694316737\n68.023981606779\n79.340412611230\n"],["见附件","见附件"]],"created_at":"2026-03-03 11:09:25"}}