题目详情题解（0）讨论（0）提交记录（0）

CF1444D.Rectangular Polyline

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

One drew a closed polyline on a plane, that consisted only of vertical and horizontal segments (parallel to the coordinate axes). The segments alternated between horizontal and vertical ones (a horizontal segment was always followed by a vertical one, and vice versa). The polyline did not contain strict self-intersections, which means that in case any two segments shared a common point, that point was an endpoint for both of them (please consult the examples in the notes section).

Unfortunately, the polyline was erased, and you only know the lengths of the horizonal and vertical segments. Please construct any polyline matching the description with such segments, or determine that it does not exist.

输入格式

The first line contains one integer tt ( 1≤t≤2001 \leq t \leq 200 ) —the number of test cases.

The first line of each test case contains one integer hh ( 1≤h≤10001 \leq h \leq 1000 ) — the number of horizontal segments. The following line contains hh integers l1,l2,…,lhl_1, l_2, \dots, l_h ( 1≤li≤10001 \leq l_i \leq 1000 ) — lengths of the horizontal segments of the polyline, in arbitrary order.

The following line contains an integer vv ( 1≤v≤10001 \leq v \leq 1000 ) — the number of vertical segments, which is followed by a line containing vv integers p1,p2,…,pvp_1, p_2, \dots, p_v ( 1≤pi≤10001 \leq p_i \leq 1000 ) — lengths of the vertical segments of the polyline, in arbitrary order.

Test cases are separated by a blank line, and the sum of values h+vh + v over all test cases does not exceed 10001000 .

输出格式

For each test case output Yes, if there exists at least one polyline satisfying the requirements, or No otherwise. If it does exist, in the following nn lines print the coordinates of the polyline vertices, in order of the polyline traversal: the ii -th line should contain two integers xix_i and yiy_i — coordinates of the ii -th vertex.

Note that, each polyline segment must be either horizontal or vertical, and the segments should alternate between horizontal and vertical. The coordinates should not exceed 10910^9 by their absolute value.

输入输出样例

  • 输入#1

    2
2
1 1
2
1 1

2
1 2
2
3 3

    输出#1

    Yes
1 0
1 1
0 1
0 0
No

  • 输入#2

    2
4
1 1 1 1
4
1 1 1 1

3
2 1 1
3
2 1 1

    输出#2

    Yes
1 0
1 1
2 1
2 2
1 2
1 1
0 1
0 0
Yes
0 -2
2 -2
2 -1
1 -1
1 0
0 0

  • 输入#3

    2
4
1 4 1 2
4
3 4 5 12

4
1 2 3 6
2
1 3

    输出#3

    Yes
2 0
2 3
3 3
3 7
4 7
4 12
0 12
0 0
No

说明/提示

In the first test case of the first example, the answer is Yes — for example, the following picture illustrates a square that satisfies the requirements:

In the first test case of the second example, the desired polyline also exists. Note that, the polyline contains self-intersections, but only in the endpoints:

In the second test case of the second example, the desired polyline could be like the one below:

Note that the following polyline is not a valid one, since it contains self-intersections that are not endpoints for some of the segments:

首页