Not Splitting
There is a $$$k \times k$$$ grid, where $$$k$$$ is even. The square in row $$$r$$$ and column $$$c$$$ is denoted by $$$(r,c)$$$. Two squares $$$(r_1, c_1)$$$ and $$$(r_2, c_2)$$$ are considered adjacent if $$$\lvert r_1 - r_2 \rvert + \lvert c_1 - c_2 \rvert = 1$$$.An array of adjacent pairs of squares is called strong if it is possible to cut the grid along grid lines into two connected, congruent pieces so that each pair is part of the same piece. Two pieces are congruent if one can be matched with the other by translation, rotation, and reflection, or a combination of these.  The picture above represents the first test case. Arrows indicate pairs of squares, and the thick black line represents the cut. You are given an array $$$a$$$ of $$$n$$$ pairs of adjacent squares. Find the size of the largest strong subsequence of $$$a$$$. An array $$$p$$$ is a subsequence of an array $$$q$$$ if $$$p$$$ can be obtained from $$$q$$$ by deletion of several (possibly, zero or all) elements.
In the first test case, the array $$$a$$$ is not good, but if we take the subsequence $$$[a_1, a_2, a_3, a_4, a_5, a_6, a_8]$$$, then the square can be split as shown in the statement.In the second test case, we can take the subsequence consisting of the last four elements of $$$a$$$ and cut the square with a horizontal line through its center.
The input consists of multiple test cases. The first line contains an integer $$$t$$$ ($$$1 \leq t \leq 100$$$) — the number of test cases. The description of the test cases follows.The first line of each test case contains two space-separated integers $$$n$$$ and $$$k$$$ ($$$1 \leq n \leq 10^5$$$; $$$2 \leq k \leq 500$$$, $$$k$$$ is even) — the length of $$$a$$$ and the size of the grid, respectively.Then $$$n$$$ lines follow. The $$$i$$$-th of these lines contains four space-separated integers $$$r_{i,1}$$$, $$$c_{i,1}$$$, $$$r_{i,2}$$$, and $$$c_{i,2}$$$ ($$$1 \leq r_{i,1}, c_{i,1}, r_{i,2}, c_{i,2} \leq k$$$) — the $$$i$$$-th element of $$$a$$$, represented by the row and column of the first square $$$(r_{i,1}, c_{i,1})$$$ and the row and column of the second square $$$(r_{i,2}, c_{i,2})$$$. These squares are adjacent.It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^5$$$, and the sum of $$$k$$$ over all test cases does not exceed $$$500$$$.
For each test case, output a single integer — the size of the largest strong subsequence of $$$a$$$.
import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
from heapq import heappop, heappush
for _ in range(int(input())):
    (q, n) = map(int, input().split())
    graph = [[[] for j in range(n + 1)] for i in range(n + 1)]
    for x in range(n + 1):
        for y in range(n + 1):
            if x - 1 >= 0:
                graph[x - 1][y] += [[x, y, 0]]
            if x + 1 < n:
                graph[x + 1][y] += [[x, y, 0]]
            if y - 1 >= 0:
                graph[x][y - 1] += [[x, y, 0]]
            if y + 1 < n:
                graph[x][y + 1] += [[x, y, 0]]

    def update(x1, y1, x2, y2):
        for i in range(len(graph[x1][y1])):
            if (graph[x1][y1][i][0], graph[x1][y1][i][1]) == (x2, y2):
                graph[x1][y1][i][2] += 1
        for i in range(len(graph[x2][y2])):
            if (graph[x2][y2][i][0], graph[x2][y2][i][1]) == (x1, y1):
                graph[x2][y2][i][2] += 1
    for i in range(q):
        (x1, y1, x2, y2) = map(int, input().split())
        if x1 == x2:
            (y1, y2) = (min(y1, y2), max(y1, y2))
            update(x1 - 1, y1, x1, y1)
            update(n - (x1 - 1), n - y1, n - x1, n - y1)
        else:
            (x1, x2) = (min(x1, x2), max(x1, x2))
            update(x1, y1 - 1, x1, y1)
            update(n - x1, n - (y1 - 1), n - x1, n - y1)
    dist = [[float('inf')] * (n + 1) for __ in range(n + 1)]
    queue = []
    heappush(queue, (0, n // 2, n // 2))
    dist[n // 2][n // 2] = 0
    while queue:
        (length, x, y) = heappop(queue)
        if x == 0 or y == 0:
            print(q - length)
            break
        if dist[x][y] != length:
            continue
        for (x2, y2, w) in graph[x][y]:
            if dist[x2][y2] > dist[x][y] + w:
                dist[x2][y2] = dist[x][y] + w
                heappush(queue, (dist[x2][y2], x2, y2))
import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
from heapq import heappop, heappush
for _ in range(int(input())):
    (q, n) = map(int, input().split())
    graph = [[[] for j in range(n + 1)] for i in range(n + 1)]
    for x in range(n + 1):
        for y in range(n + 1):
            if x - 1 >= 0:
                graph[x - 1][y] += [[x, y, 0]]
            if x + 1 < n:
                graph[x + 1][y] += [[x, y, 0]]
            if y - 1 >= 0:
                graph[x][y - 1] += [[x, y, 0]]
            if y + 1 < n:
                graph[x][y + 1] += [[x, y, 0]]

    def update(x1, y1, x2, y2):
        for i in range(len(graph[x1][y1])):
            if (graph[x1][y1][i][0], graph[x1][y1][i][1]) == (x2, y2):
                graph[x1][y1][i][2] += 1
        for i in range(len(graph[x2][y2])):
            if (graph[x2][y2][i][0], graph[x2][y2][i][1]) == (x1, y1):
                graph[x2][y2][i][2] += 1
    for i in range(q):
        (x1, y1, x2, y2) = map(int, input().split())
        if x1 == x2:
            (y1, y2) = (min(y1, y2), max(y1, y2))
            update(x1 - 1, y1, x1, y1)
            update(n - (x1 - 1), n - y1, n - x1, n - y1)
        else:
            (x1, x2) = (min(x1, x2), max(x1, x2))
            update(x1, y1 - 1, x1, y1)
            update(n - x1, n - (y1 - 1), n - x1, n - y1)
    dist = [[float('inf')] * (n + 1) for __ in range(n + 1)]
    queue = []
    heappush(queue, (0, n // 2, n // 2))
    dist[n // 2][n // 2] = 0
    while queue:
        (length, x, y) = heappop(queue)
        if x == 0 or y == 0:
            print(q - length)
            break
        if dist[x][y] != length:
            continue
        for (x2, y2, w) in graph[x][y]:
            if dist[x2][y2] > dist[x][y] + w:
                dist[x2][y2] = dist[x][y] + w
                heappush(queue, (dist[x2][y2], x2, y2))
import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
from heapq import heappop, heappush
for _ in range(int(input())):
    (q, n) = map(int, input().split())
    graph = [[[] for j in range(n + 1)] for i in range(n + 1)]
    for x in range(n + 1):
        for y in range(n + 1):
            if x - 1 >= 0:
                graph[x - 1][y] += [[x, y, 0]]
            if x + 1 < n:
                graph[x + 1][y] += [[x, y, 0]]
            if y - 1 >= 0:
                graph[x][y - 1] += [[x, y, 0]]
            if y + 1 < n:
                graph[x][y + 1] += [[x, y, 0]]

    def update(x1, y1, x2, y2):
        for i in range(len(graph[x1][y1])):
            if (graph[x1][y1][i][0], graph[x1][y1][i][1]) == (x2, y2):
                graph[x1][y1][i][2] += 1
        for i in range(len(graph[x2][y2])):
            if (graph[x2][y2][i][0], graph[x2][y2][i][1]) == (x1, y1):
                graph[x2][y2][i][2] += 1
    for i in range(q):
        (x1, y1, x2, y2) = map(int, input().split())
        if x1 == x2:
            (y1, y2) = (min(y1, y2), max(y1, y2))
            update(x1 - 1, y1, x1, y1)
            update(n - (x1 - 1), n - y1, n - x1, n - y1)
        else:
            (x1, x2) = (min(x1, x2), max(x1, x2))
            update(x1, y1 - 1, x1, y1)
            update(n - x1, n - (y1 - 1), n - x1, n - y1)
    dist = [[float('inf')] * (n + 1) for __ in range(n + 1)]
    queue = []
    heappush(queue, (0, n // 2, n // 2))
    dist[n // 2][n // 2] = 0
    while queue:
        (length, x, y) = heappop(queue)
        if x == 0 or y == 0:
            print(q - length)
            break
        if dist[x][y] != length:
            continue
        for (x2, y2, w) in graph[x][y]:
            if dist[x2][y2] > dist[x][y] + w:
                dist[x2][y2] = dist[x][y] + w
                heappush(queue, (dist[x2][y2], x2, y2))