CF 1702F - Equate Multisets

Equate Multisets

Multiset —is a set of numbers in which there can be equal elements, and the order of the numbers does not matter. Two multisets are equal when each value occurs the same number of times. For example, the multisets {$2,2,4$} and {$2,4,2$} are equal, but the multisets {$1,2,2$} and {$1,1,2$} — are not.
You are given two multisets $a$ and $b$, each consisting of $n$ integers.
In a single operation, any element of the $b$ multiset can be doubled or halved (rounded down). In other words, you have one of the following operations available for an element $x$ of the $b$ multiset:

• replace $x$ with $x\cdot 2$,
• or replace $x$ with $\lfloor \frac{x}{2}\rfloor$ (round down).

Note that you cannot change the elements of the $a$ multiset.
See if you can make the multiset $b$ become equal to the multiset $a$ in an arbitrary number of operations (maybe $0$).
For example, if $n=4$, $a=${$4,24,5,2$}, $b=${$4,1,6,11$}, then the answer is yes. We can proceed as follows:

• Replace $1$ with $1\cdot 2=2$. We get $b=${$4,2,6,11$}.
• Replace $11$ with $\lfloor \frac{11}{2}\rfloor =5$. We get $b=${$4,2,6,5$}.
• Replace $6$ with $6\cdot 2=12$. We get $b=${$4,2,12,5$}.
• Replace $12$ with $12\cdot 2=24$. We get $b=${$4,2,24,5$}.
• Got equal multisets $a=${$4,24,5,2$} and $b=${$4,2,24,5$}.

 
Input
The first line of input data contains a single integer $t(1\le t\le 10^4)$ —the number of test cases.
Each test case consists of three lines.
The first line of the test case contains an integer $n(1\le n\le 2\cdot 10^5)$ —the number of elements in the multisets $a$ and $b$.
The second line gives $n$ integers: $a_1,a_2,\dots ,a_n(1\le a_1\le a_2\le \cdots \le a_n\le 10^9)$ —the elements of the multiset $a$. Note that the elements may be equal.
The third line contains $n$ integers: $b_1,b_2,\dots ,b_n(1\le b_1\le b_2\le \cdots \le b_n\le 10^9)$ — elements of the multiset $b$. Note that the elements may be equal.
It is guaranteed that the sum of $n$ values over all test cases does not exceed $2\cdot 10^5$.
 
Output
For each test case, print on a separate line:

• YES if you can make the multiset $b$ become equal to $a$,
• NO otherwise.

You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as positive answer).
 
Example
input

5
4
2 4 5 24
1 4 6 11
3
1 4 17
4 5 31
5
4 7 10 13 14
2 14 14 26 42
5
2 2 4 4 4
28 46 62 71 98
6
1 2 10 16 64 80
20 43 60 74 85 99

output

YES
NO
YES
YES
YES

Note
The first example is explained in the statement.
In the second example, it is impossible to get the value $31$ from the numbers of the multiset $b$ by available operations.
In the third example, we can proceed as follows:

• Replace $2$ with $2\cdot 2=4$. We get $b=${$4,14,14,26,42$}.
• Replace $14$ with $\lfloor \frac{14}{2}\rfloor =7$. We get $b=${$4,7,14,26,42$}.
• Replace $26$ with $\lfloor \frac{26}{2}\rfloor =13$. We get $b=${$4,7,14,13,42$}.
• Replace $42$ with $\lfloor \frac{42}{2}\rfloor =21$. We get $b=${$4,7,14,13,21$}.
• Replace $21$ with $\lfloor \frac{21}{2}\rfloor =10$. We get $b=${$4,7,14,13,10$}.
• Got equal multisets $a=${$4,7,10,13,14$} and $b=${$4,7,14,13,10$}.

题目大意
给你两个 $n$ 个元素集合 $a$、$b$ (非降序)，以集合中的出现的数及其出现次数来表示相不相同。能否把集合 $b$ 进行以下操作：

• 将某个元素乘 $2$ 。
• 就某个元素除以 $2$ ，并向下取整。

变得与集合 $a$ 相同，每个元素都可以操作任意次(也可以是 $0$ 次)，能就输出YES，否则输出NO
。
解题思路
显然，任何一个偶数都存在一个数乘 $2$ 得到。比较难得到的其实是奇数，那么我们就可以把集合 $a$ 中的元素都变成我们所需要的奇数，也就是将不是奇数，不断地进行除以 $2$ 操作变成奇数。接下来，我们只需要考虑集合 $b$ 的元素能否进行除以 2 操作得到集合 $a$ 所需要的奇数。

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t; cin>>t;
    while(t--)
    {
        int n; cin>>n;
        map<int, int> need; //记录需要的奇数及其个数
        for(int i=0; i<n; i++)
        {
            int x; cin>>x;
            while(x%2 == 0) x /= 2; //将偶数转化为所需的奇数 （由该奇数不断乘 2 得到的偶数
            need[x]++;
        }
        int cnt = 0; //记录集合 b 中能够转化到集合 a 的元素个数
        bool flag = false;
        for(int i=0; i<n; i++)
        {
            int x; cin>>x;
            while(x)
            {
                if(x%2 && need[x]) //转化到一个奇数. 并且是需要的奇数
                {
                    cnt++; //转化成功数 +1
                    need[x]--; //该奇数需要 -1
                    break;
                }
                x /= 2;
            }
        }
        if(cnt == n) flag = true; //都有对应的转化的奇数
        cout<<(flag? "YES\n": "NO\n");
    }
    return 0;
}