A11110 | Two TVs
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Polycarp is a great fan of television.
He wrote down all the TV programs he is interested in for today. His list contains $n$ shows, $i$ -th of them starts at moment $l_{i}$ and ends at moment $r_{i}$ .
Polycarp owns two TVs. He can watch two different shows simultaneously with two TVs but he can only watch one show at any given moment on a single TV. If one show ends at the same moment some other show starts then you can't watch them on a single TV.
Polycarp wants to check out all $n$ shows. Are two TVs enough to do so?
He wrote down all the TV programs he is interested in for today. His list contains $n$ shows, $i$ -th of them starts at moment $l_{i}$ and ends at moment $r_{i}$ .
Polycarp owns two TVs. He can watch two different shows simultaneously with two TVs but he can only watch one show at any given moment on a single TV. If one show ends at the same moment some other show starts then you can't watch them on a single TV.
Polycarp wants to check out all $n$ shows. Are two TVs enough to do so?
输入格式
The first line contains one integer $n$ ( $1<=n<=2·10^{5}$ ) — the number of shows.
Each of the next $n$ lines contains two integers $l_{i}$ and $r_{i}$ ( $0<=l_{i}<r_{i}<=10^{9}$ ) — starting and ending time of $i$ -th show.
Each of the next $n$ lines contains two integers $l_{i}$ and $r_{i}$ ( $0<=l_{i}<r_{i}<=10^{9}$ ) — starting and ending time of $i$ -th show.
输出格式
If Polycarp is able to check out all the shows using only two TVs then print "YES" (without quotes). Otherwise, print "NO" (without quotes).
输入输出样例
输入 #1
3 1 2 2 3 4 5
输出 #1
YES
输入 #2
4 1 2 2 3 2 3 1 2
输出 #2
NO
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted