A8275 | New Year Snowflake
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
The first line contains two integers $n$ and $k$ ( $1<=n<=200000$ , $0<=k<=10$ ) — the number of the surviving snowflake crystals and the maximum number of melted crystals, correspondingly. Next $n$ lines contain the coordinates of the crystals that are left in the following form: " $x_{i}$ $y_{i}$ ". The coordinates are integers and do not exceed $5·10^{8}$ in absolute value. All given points are different.
输入格式
The first line contains an integer $c$ — the number of possible symmetry centers. Next $c$ lines should contain the centers' descriptions. Each symmetry center is described by a couple of coordinates " $x$ $y$ ", separated by a space. Print the coordinates with absolute error not exceeding $10^{-6}$ . You are allowed to print the symmetry centers in any order. All printed points should be different. If there exist an infinite number of possible symmetry centers, print the single number "-1".
输出格式
无
输入输出样例
输入 #1
4 0 0 0 0 1 1 0 1 1
输出 #1
1 0.5 0.5
输入 #2
4 2 0 0 0 1 1 0 1 1
输出 #2
5 0.0 0.5 0.5 0.0 0.5 0.5 0.5 1.0 1.0 0.5
输入 #3
4 4 0 0 0 1 1 0 1 1
输出 #3
-1
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted