A11433 | Symmetric Projections
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a set of $n$ points on the plane. A line containing the origin is called good, if projection of the given set to this line forms a symmetric multiset of points. Find the total number of good lines.
Multiset is a set where equal elements are allowed.
Multiset is called symmetric, if there is a point $P$ on the plane such that the multiset is [centrally symmetric](https://en.wikipedia.org/wiki/Point_reflection) in respect of point $P$ .
Multiset is a set where equal elements are allowed.
Multiset is called symmetric, if there is a point $P$ on the plane such that the multiset is [centrally symmetric](https://en.wikipedia.org/wiki/Point_reflection) in respect of point $P$ .
输入格式
The first line contains a single integer $n$ ( $1<=n<=2000$ ) — the number of points in the set.
Each of the next $n$ lines contains two integers $x_{i}$ and $y_{i}$ ( $-10^{6}<=x_{i},y_{i}<=10^{6}$ ) — the coordinates of the points. It is guaranteed that no two points coincide.
Each of the next $n$ lines contains two integers $x_{i}$ and $y_{i}$ ( $-10^{6}<=x_{i},y_{i}<=10^{6}$ ) — the coordinates of the points. It is guaranteed that no two points coincide.
输出格式
If there are infinitely many good lines, print -1.
Otherwise, print single integer — the number of good lines.
Otherwise, print single integer — the number of good lines.
输入输出样例
输入 #1
3 1 2 2 1 3 3
输出 #1
3
输入 #2
2 4 3 1 2
输出 #2
-1
Picture to the first sample test:

In the second sample, any line containing the origin is good.

In the second sample, any line containing the origin is good.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted