AtCoder Grand Contest 017
翻译中…
Problem Statement
翻译中…
We have $N$ irregular jigsaw pieces. Each piece is composed of three rectangular parts of width $1$ and various heights joined together. More specifically:
翻译中…
- The
$i$-th piece is a part of height$H$, with another part of height$A_i$joined to the left, and yet another part of height$B_i$joined to the right, as shown below. Here, the bottom sides of the left and right parts are respectively at$C_i$and$D_i$units length above the bottom side of the center part.
翻译中…

翻译中…
Snuke is arranging these pieces on a square table of side $10^{100}$. Here, the following conditions must be held:
翻译中…
- All pieces must be put on the table.
- The entire bottom side of the center part of each piece must touch the front side of the table.
- The entire bottom side of the non-center parts of each piece must either touch the front side of the table, or touch the top side of a part of some other piece.
- The pieces must not be rotated or flipped.
翻译中…
Determine whether such an arrangement is possible.
翻译中…
Constraints
翻译中…
$1 \leq N \leq 100000$$1 \leq H \leq 200$$1 \leq A_i \leq H$$1 \leq B_i \leq H$$0 \leq C_i \leq H - A_i$$0 \leq D_i \leq H - B_i$- All input values are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N H
A_1 B_1 C_1 D_1
A_2 B_2 C_2 D_2
:
A_N B_N C_N D_N
翻译中…
Output
翻译中…
If it is possible to arrange the pieces under the conditions, print YES; if it is impossible, print NO.
翻译中…
样例
Input #1
3 4
1 1 0 0
2 2 0 1
3 3 1 0
Output #1
YES
The figure below shows a possible arrangement.

Input #2
4 2
1 1 0 1
1 1 0 1
1 1 0 1
1 1 0 1
Output #2
NO
Input #3
10 4
1 1 0 3
2 3 2 0
1 2 3 0
2 1 0 0
3 2 0 2
1 1 3 0
3 2 0 0
1 3 2 0
1 1 1 3
2 3 0 0
Output #3
YES
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。