CF1927C.Choose the Different Ones!

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

Given an array aa of nn integers, an array bb of mm integers, and an even number kk .

Your task is to determine whether it is possible to choose exactly k2\frac{k}{2} elements from both arrays in such a way that among the chosen elements, every integer from 11 to kk is included.

For example:

  • If a=[2,3,8,5,6,5]a=[2, 3, 8, 5, 6, 5] , b=[1,3,4,10,5]b=[1, 3, 4, 10, 5] , k=6k=6 , then it is possible to choose elements with values 2,3,62, 3, 6 from array aa and elements with values 1,4,51, 4, 5 from array bb . In this case, all numbers from 11 to k=6k=6 will be included among the chosen elements.
  • If a=[2,3,4,5,6,5]a=[2, 3, 4, 5, 6, 5] , b=[1,3,8,10,3]b=[1, 3, 8, 10, 3] , k=6k=6 , then it is not possible to choose elements in the required way.

Note that you are not required to find a way to choose the elements — your program should only check whether it is possible to choose the elements in the required way.

输入格式

The first line of the input contains a single integer tt ( 1t1041 \le t \le 10^4 ) — the number of test cases. The descriptions of the test cases follow.

The first line of each test case contains three integers nn , mm , and kk ( 1n,m21051 \le n, m \le 2\cdot10^5 , 2k2min(n,m)2 \le k \le 2 \cdot \min(n, m) , kk is even) — the length of array aa , the length of array bb , and the number of elements to be chosen, respectively.

The second line of each test case contains nn integers a1,a2,,ana_1, a_2, \dots, a_n ( 1ai1061 \le a_i \le 10^6 ) — the elements of array aa .

The third line of each test case contains mm integers b1,b2,,bmb_1, b_2, \dots, b_m ( 1bj1061 \le b_j \le 10^6 ) — the elements of array bb .

It is guaranteed that the sum of values nn and mm over all test cases in a test does not exceed 41054 \cdot 10^5 .

输出格式

Output tt lines, each of which is the answer to the corresponding test case. As the answer, output "YES" if it is possible to choose k2\frac{k}{2} numbers from each array in such a way that among the chosen elements, every integer from 11 to kk is included. Otherwise, output "NO".

You can output each letter in any case (lowercase or uppercase). For example, the strings "yEs", "yes", "Yes", and "YES" will be accepted as a positive answer.

输入输出样例

  • 输入#1

    6
    6 5 6
    2 3 8 5 6 5
    1 3 4 10 5
    6 5 6
    2 3 4 5 6 5
    1 3 8 10 3
    3 3 4
    1 3 5
    2 4 6
    2 5 4
    1 4
    7 3 4 4 2
    1 4 2
    2
    6 4 4 2
    1 5 2
    3
    2 2 1 4 3

    输出#1

    YES
    NO
    YES
    YES
    NO
    NO

说明/提示

In the first test case of the example, it is possible to choose elements equal to 22 , 33 , and 66 from array aa and elements equal to 11 , 44 , and 55 from array bb . Thus, all numbers from 11 to k=6k=6 are included among the chosen elements.

In the second test case of the example, it can be shown that it is not possible to choose exactly three elements from each array in the required way.

In the third test case of the example, it is possible to choose elements equal to 11 and 33 from array aa and elements equal to 22 and 44 from array bb . Thus, all numbers from 11 to k=4k=4 are included among the chosen elements.

首页