1D Sokoban

题意翻译

这是一个一维推箱子的游戏，你站在0这个位置，然后在这个轴上有n个箱子。 保证没有箱子在0这个位置，然后有 m 个特殊的位置，你每次推箱子都是推动一个单位，如果你把箱子推向的下一个单位上有箱子，那么那个箱子也会往后挪动一个单位。 问：经过你的努力，你最多可以让多少个箱子在特殊位置上。

题目描述

You are playing a game similar to Sokoban on an infinite number line. The game is discrete, so you only consider integer positions on the line. You start on a position $ 0 $ . There are $ n $ boxes, the $ i $ -th box is on a position $ a_i $ . All positions of the boxes are distinct. There are also $ m $ special positions, the $ j $ -th position is $ b_j $ . All the special positions are also distinct. In one move you can go one position to the left or to the right. If there is a box in the direction of your move, then you push the box to the next position in that direction. If the next position is taken by another box, then that box is also pushed to the next position, and so on. You can't go through the boxes. You can't pull the boxes towards you. You are allowed to perform any number of moves (possibly, zero). Your goal is to place as many boxes on special positions as possible. Note that some boxes can be initially placed on special positions.

输入输出格式

输入格式

The first line contains a single integer $ t $ ( $ 1 \le t \le 1000 $ ) — the number of testcases. Then descriptions of $ t $ testcases follow. The first line of each testcase contains two integers $ n $ and $ m $ ( $ 1 \le n, m \le 2 \cdot 10^5 $ ) — the number of boxes and the number of special positions, respectively. The second line of each testcase contains $ n $ distinct integers in the increasing order $ a_1, a_2, \dots, a_n $ ( $ -10^9 \le a_1 < a_2 < \dots < a_n \le 10^9 $ ; $ a_i \neq 0 $ ) — the initial positions of the boxes. The third line of each testcase contains $ m $ distinct integers in the increasing order $ b_1, b_2, \dots, b_m $ ( $ -10^9 \le b_1 < b_2 < \dots < b_m \le 10^9 $ ; $ b_i \neq 0 $ ) — the special positions. The sum of $ n $ over all testcases doesn't exceed $ 2 \cdot 10^5 $ . The sum of $ m $ over all testcases doesn't exceed $ 2 \cdot 10^5 $ .

输出格式

For each testcase print a single integer — the maximum number of boxes that can be placed on special positions.

输入输出样例

输入样例 #1

5
5 6
-1 1 5 11 15
-4 -3 -2 6 7 15
2 2
-1 1
-1000000000 1000000000
2 2
-1000000000 1000000000
-1 1
3 5
-1 1 2
-2 -1 1 2 5
2 1
1 2
10

输出样例 #1

4
2
0
3
1

说明

In the first testcase you can go $ 5 $ to the right: the box on position $ 1 $ gets pushed to position $ 6 $ and the box on position $ 5 $ gets pushed to position $ 7 $ . Then you can go $ 6 $ to the left to end up on position $ -1 $ and push a box to $ -2 $ . At the end, the boxes are on positions $ [-2, 6, 7, 11, 15] $ , respectively. Among them positions $ [-2, 6, 7, 15] $ are special, thus, the answer is $ 4 $ . In the second testcase you can push the box from $ -1 $ to $ -10^9 $ , then the box from $ 1 $ to $ 10^9 $ and obtain the answer $ 2 $ . The third testcase showcases that you are not allowed to pull the boxes, thus, you can't bring them closer to special positions. In the fourth testcase all the boxes are already on special positions, so you can do nothing and still obtain the answer $ 3 $ . In the fifth testcase there are fewer special positions than boxes. You can move either $ 8 $ or $ 9 $ to the right to have some box on position $ 10 $ .