Hello 2020
D
New Year and Conference
Codeforces
2100
原题
← CE →
翻译中…

Filled with optimism, Hyunuk will host a conference about how great this new year will be!

翻译中…

The conference will have $n$ lectures. Hyunuk has two candidate venues $a$ and $b$. For each of the $n$ lectures, the speaker specified two time intervals $[sa_i, ea_i]$ ($sa_i \le ea_i$) and $[sb_i, eb_i]$ ($sb_i \le eb_i$). If the conference is situated in venue $a$, the lecture will be held from $sa_i$ to $ea_i$, and if the conference is situated in venue $b$, the lecture will be held from $sb_i$ to $eb_i$. Hyunuk will choose one of these venues and all lectures will be held at that venue.

翻译中…

Two lectures are said to overlap if they share any point in time in common. Formally, a lecture held in interval $[x, y]$ overlaps with a lecture held in interval $[u, v]$ if and only if $\max(x, u) \le \min(y, v)$.

翻译中…

We say that a participant can attend a subset $s$ of the lectures if the lectures in $s$ do not pairwise overlap (i.e. no two lectures overlap). Note that the possibility of attending may depend on whether Hyunuk selected venue $a$ or venue $b$ to hold the conference.

翻译中…

A subset of lectures $s$ is said to be venue-sensitive if, for one of the venues, the participant can attend $s$, but for the other venue, the participant cannot attend $s$.

翻译中…

A venue-sensitive set is problematic for a participant who is interested in attending the lectures in $s$ because the participant cannot be sure whether the lecture times will overlap. Hyunuk will be happy if and only if there are no venue-sensitive sets. Determine whether Hyunuk will be happy.

翻译中…

Input

翻译中…

The first line contains an integer $n$ ($1 \le n \le 100\,000$), the number of lectures held in the conference.

翻译中…

Each of the next $n$ lines contains four integers $sa_i$, $ea_i$, $sb_i$, $eb_i$ ($1 \le sa_i, ea_i, sb_i, eb_i \le 10^9$, $sa_i \le ea_i, sb_i \le eb_i$).

翻译中…

Output

翻译中…

Print "YES" if Hyunuk will be happy. Print "NO" otherwise.

翻译中…

You can print each letter in any case (upper or lower).

翻译中…

Note

翻译中…

In second example, lecture set $\{1, 3\}$ is venue-sensitive. Because participant can't attend this lectures in venue $a$, but can attend in venue $b$.

翻译中…

In first and third example, venue-sensitive set does not exist.

翻译中…

样例

Input #1
2
1 2 3 6
3 4 7 8
Output #1
YES
InputCopy OutputCopy
Input #2
3
1 3 2 4
4 5 6 7
3 4 5 5
Output #2
NO
InputCopy OutputCopy
Input #3
6
1 5 2 9
2 4 5 8
3 6 7 11
7 10 12 16
8 11 13 17
9 12 14 18
Output #3
YES
InputCopy OutputCopy
题目信息
题号
1284D
所属比赛
时间限制
2 s
内存限制
1024 MB
标签
二分
数据结构
哈希
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。