A11720 | Pair Of Lines
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given $n$ points on Cartesian plane. Every point is a lattice point (i. e. both of its coordinates are integers), and all points are distinct.
You may draw two straight lines (not necessarily distinct). Is it possible to do this in such a way that every point lies on at least one of these lines?
You may draw two straight lines (not necessarily distinct). Is it possible to do this in such a way that every point lies on at least one of these lines?
输入格式
The first line contains one integer $n$ $(1<=n<=10^{5})$ — the number of points you are given.
Then $n$ lines follow, each line containing two integers $x_{i}$ and $y_{i}$ $(|x_{i}|,|y_{i}|<=10^{9})$ — coordinates of $i$ -th point. All $n$ points are distinct.
Then $n$ lines follow, each line containing two integers $x_{i}$ and $y_{i}$ $(|x_{i}|,|y_{i}|<=10^{9})$ — coordinates of $i$ -th point. All $n$ points are distinct.
输出格式
If it is possible to draw two straight lines in such a way that each of given points belongs to at least one of these lines, print YES. Otherwise, print NO.
输入输出样例
输入 #1
5 0 0 0 1 1 1 1 -1 2 2
输出 #1
YES
输入 #2
5 0 0 1 0 2 1 1 1 2 3
输出 #2
NO
In the first example it is possible to draw two lines, the one containing the points $1$ , $3$ and $5$ , and another one containing two remaining points.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted