codeforces #778 C.Alice and the Cake

最新推荐文章于 2023-01-01 00:19:41 发布

原创最新推荐文章于 2023-01-01 00:19:41 发布 · 610 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#算法

本文探讨了一种特殊的蛋糕切割问题，其中Alice按照特定规则将蛋糕切分成n块。每一步操作她选择一块重量大于等于2的蛋糕，将其切成两块，一块重量为地板函数(w/2)，另一块为天花板函数(w/2)。给定最终的蛋糕重量数组a，我们需要确定是否存在这样的初始蛋糕重量和切割序列。通过递归算法检查所有可能的切割组合，判断数组a是否可以由这些操作得出。示例给出了多个测试用例及对应答案，帮助理解问题和解决方案。

Alice has a cake, and she is going to cut it. She will perform the following operation n−1 times: choose a piece of the cake (initially, the cake is all one piece) with weight w≥2 and cut it into two smaller pieces of weight ⌊w2⌋ and ⌈w2⌉ (⌊x⌋ and ⌈x⌉ denote floor and ceiling functions, respectively).

After cutting the cake in n pieces, she will line up these n pieces on a table in an arbitrary order. Let ai be the weight of the i-th piece in the line.

You are given the array a. Determine whether there exists an initial weight and sequence of operations which results in a.

Input

The first line contains a single integer t(1≤t≤10^4) — the number of test cases.

The first line of each test case contains a single integer n(1≤n≤2⋅10^5).

The second line of each test case contains n integers a1,a2,…,an (1≤ai≤10^9).

It is guaranteed that the sum of n for all test cases does not exceed 2⋅10^5.

Output

For each test case, print a single line: print YES if the array aa could have resulted from Alice's operations, otherwise print NO.

You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).

Example

input

Copy

14
1
327
2
869 541
2
985214736 985214737
3
2 3 1
3
2 3 3
6
1 1 1 1 1 1
6
100 100 100 100 100 100
8
100 100 100 100 100 100 100 100
8
2 16 1 8 64 1 4 32
10
1 2 4 7 1 1 1 1 7 2
10
7 1 1 1 3 1 3 3 2 3
10
1 4 4 1 1 1 3 3 3 1
10
2 3 2 2 1 2 2 2 2 2
4
999999999 999999999 999999999 999999999

output

Copy

YES
NO
YES
YES
NO
YES
NO
YES
YES
YES
YES
NO
NO
YES

解题思路：

分别递归查看左半边蛋糕和右半边蛋糕是否符合规则。

代码：

#include <bits/stdc++.h>
using namespace std;
map<long long int,long long int> p;
int fun(long long int s)
{
    if(!s)
        return 0;
    if(p[s])
    {
        p[s]--;
        return 1;
    }
    return fun(s/2)&&fun(s-s/2);
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        p.clear();
        long long int n;
        cin>>n;
        long long int x;
        long long int sum=0;
        for(int i=1;i<=n;i++)
        {
            cin>>x;
            p[x]++;
            sum+=x;
        }
        if(fun(sum))
            cout<<"YES"<<endl;
        else
            cout <<"NO"<<endl;
    }
    return 0;
}