【CF】Codeforces 1702F

最新推荐文章于 2024-09-13 16:27:15 发布

vandijk0625

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量223

点赞数 2

文章标签：算法

本文链接：https://blog.csdn.net/m0_72720401/article/details/125751315

版权

本文介绍了一种名为EquateMultisets的问题，涉及如何通过有限次数的元素加倍或减半操作，使得两个多集（允许重复元素且顺序不重要）变得相等。通过实例演示了算法步骤和关键操作的使用，以及如何判断是否可能达成目标。

摘要由CSDN通过智能技术生成

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 $\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 $\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 $\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\}$ .

输入格式

The first line of input data contains a single integer $t$ ( $\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$ ( $\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$ ( $\le a_1 \le a_2 \le \dots \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$ ( $\le b_1 \le b_2 \le \dots \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 $\cdot 10^5$ .

输出格式

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).

样例 #1

样例输入 #1

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

样例输出 #1

YES
NO
YES
YES
YES

提示

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 $\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$ ，定义x的一次操作（二选一） $：$

把 $x$ 替换成 $\cdot 2$ ,
把 $x$ 替换成 $\lfloor \frac{x}{2} \rfloor$ (下取整).

$a$ 数组不能做操作， $b$ 数组不能做操作。

问经过若干操作，能否讲 $b$ 数组变成 $a$ 数组？（数的顺序可以不一样）。

题解

先把 $a$ 数组一直除以 $2$ (能除得尽就除），用一个 $m a p$ 统计个数，然后贪心地处理每个 $b_i$ ,能用就用。

#include<bits/stdc++.h>
using namespace std;
int n,a[200010],b[200010];
map<int,int> mp;
void solve(){
	mp.clear();
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		while(a[i]%2==0){
			a[i]/=2;
		}
		mp[a[i]]++;
	}
	for(int i=1;i<=n;i++)cin>>b[i];
	for(int i=1;i<=n;i++){
		int tmp=b[i];
		bool flag=0;
		while(tmp){
			if(!mp[tmp]){
				tmp/=2;
				continue;
			}
			mp[tmp]--;
			flag=1;
			break;
		}
		if(!flag){
			puts("NO");
			return ;
		}
	}
	for(auto it:mp){
		if(it.second>0){
			puts("NO");
		}
	}
	puts("YES");
	return ;
}
int main(){
	int TTT;
	cin>>TTT;
	while(TTT--){
		solve();
	}
	return 0;
}