Problem:
Score : 1200 points

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.

Sample Input 1

3 4
1 1 0 0
2 2 0 1
3 3 1 0

Sample Output 1

YES

The figure below shows a possible arrangement.

Sample Input 2

4 2
1 1 0 1
1 1 0 1
1 1 0 1
1 1 0 1

Sample Output 2

NO

Sample 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

Sample Output 3

YES

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <cstdio>
#include <algorithm>
#include <vector>
static const int MAXN = 100003;
static const int MAXH = 209;

static const int MAXV = MAXH * 2;
static const int MAXE = 1e6 + 10;

int n, h;
int head[MAXV], dest[MAXE], next[MAXE];
bool vis[MAXE] = { false };

int m = 0;
int in[MAXV] = { 0 }, out[MAXV] = { 0 };

inline void add_edge(int u, int v)
{
    dest[m] = v; next[m] = head[u]; head[u] = m++;
    ++out[u], ++in[v];
}

int cur[MAXV];

void dfs_quq(int u)
{
    for (int w = head[u]; w != -1; w = next[w]) if (!vis[w]) {
        vis[w] = true;
        dfs_quq(dest[w]);
    }
}
void dfs(int u)
{
    for (int &w = cur[u]; w != -1; w = next[w]) if (!vis[w]) {
        vis[w] = true;
        dfs(dest[w]);
    }
}

std::vector<int> as, bs;
bool marked[MAXV] = { false };

int main()
{
    scanf("%d%d", &n, &h);

    int verts = (h + 1) * 2;
    for (int i = 0; i < verts; ++i) head[i] = -1;

#define node_a(_h) ((_h) * 2)
#define node_b(_h) ((_h) * 2 + 1)
    for (int i = 0, a, b, c, d; i < n; ++i) {
        scanf("%d%d%d%d", &a, &b, &c, &d);
        int u, v;
        u = (c == 0 ? node_b(a) : node_a(c));
        v = (d == 0 ? node_a(b) : node_b(d));
        add_edge(u, v);
    }
    for (int i = 0; i <= h; ++i) {
        if (in[node_a(i)] < out[node_a(i)]) { puts("NO"); return 0; }
        if (in[node_b(i)] > out[node_b(i)]) { puts("NO"); return 0; }
        for (int r = 0; r < in[node_a(i)] - out[node_a(i)]; ++r) {
            as.push_back(node_a(i));
            marked[node_a(i)] = true;
        }
        for (int r = 0; r < out[node_b(i)] - in[node_b(i)]; ++r) {
            bs.push_back(node_b(i));
            marked[node_b(i)] = true;
        }
    }
    for (int u : as) {
        if (bs.empty()) { puts("NO"); return 0; }
        add_edge(u, bs.back());
        bs.pop_back();
    }

    for (int i = 0; i < verts; ++i) cur[i] = head[i];
    if (m <= 100000) {
        for (int i = 1; i < verts; i += 2) if (marked[i]) dfs_quq(i);
    } else {
        for (int i = 1; i < verts; i += 2) if (marked[i]) dfs(i);
    }
    for (int i = 0; i < m; ++i) if (!vis[i]) { puts("NO"); return 0; }
    puts("YES"); return 0;
}