CF 1669H - Maximal AND

最新推荐文章于 2024-09-08 15:12:17 发布

花生ono

最新推荐文章于 2024-09-08 15:12:17 发布

阅读量77

点赞数 2

分类专栏： Codeforces 文章标签：算法

本文链接：https://blog.csdn.net/qq_37440669/article/details/131616827

版权

Codeforces 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Maximal AND

Let AND denote the bitwise AND operation, and OR denote the bitwise OR operation.
You are given an array $a$ of length n and a non-negative integer $k$ . You can perform at most $k$ operations on the array of the following type:

Select an index $i (1 \leq i \leq n)$ and replace $a_i$ with $a_i$ OR $2^j$ where $j$ is any integer between $0$ and $30$ inclusive. In other words, in an operation you can choose an index $i (1 \leq i \leq n)$ and set the $j$ -th bit of $a_i$ to $1 (0 \leq j \leq 30)$ .

Output the maximum possible value of $a_1$ AND $a_2$ AND … AND $a_n$ after performing at most $k$ operations.
Input
The first line of the input contains a single integer $t (1 \leq t \leq 100)$ — the number of test cases. The description of test cases follows.
The first line of each test case contains the integers $n$ and $k (1≤n≤2⋅10^5, 0≤k≤10^9)$ .
Then a single line follows, containing $n$ integers describing the arrays $a (0≤a_i<2^{31})$ .
It is guaranteed that the sum of $n$ over all test cases does not exceed $2⋅10^5$ .
Output
For each test case, output a single line containing the maximum possible AND value of $a_1$ AND $a_2$ AND … AND $a_n$ after performing at most $k$ operations.
Example
input
4
3 2
2 1 1
7 0
4 6 6 28 6 6 12
1 30
0
4 4
3 1 3 1
output
2
4
2147483646
1073741825
Note
For the first test case, we can set the bit $1 (2^1)$ of the last $2$ elements using the $2$ operations, thus obtaining the array $[2, 3, 3]$ , which has AND value equal to $2$ .
For the second test case, we can’t perform any operations so the answer is just the AND of the whole array which is $4$ .

题目大意
可以进行 $k$ 次操作，将数组 $a$ 中的一个数 OR 一个 $2^j$ (等价于在该数对应的二进制第 $j$ 位变成 $1$ )， $k$ 次操作后使得数组 $a$ 中所有数 AND 后最大，并输出。
解题思路
在输入的时候我们可以把每个数对应二进制位为 $1$ 的进行计数，因为要 AND 后最大，所以我们尽量使二进制较高位且数量较多的数进行 OR 操作，使其的数量达到 $n$ (达到数组个数 AND 这一位才有效，也就是尽量使得在某一位 OR 上 $0$ ~ $k$ 次后的数量达到 $n$ )，最后把二进制对应位的数量达到 $n$ 的为 $1$ ，否则为 $0$ ，然后转化为十进制就是我们要的答案。

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

int main()
{
    int t; cin>>t;
    while(t--)
    {
        int n, k; cin>>n>>k;
        int bit[31] = {0};
        for(int i=0; i<n; i++)
        {
            int x; cin>>x;
            //记录所有数对应二进制对应位为 1 的个数
            for(int j=0; j<31; j++)
                if((x>>j) & 1) bit[j]++;
        }
        for(int i=30; i>=0; i--)
        {
            //尽量将二进制较高位为 1 的数量补充到 n
            if(bit[i]+k >= n)
            {
                k -= n-bit[i];
                bit[i] = n;
            }
            if(!k) break;
        }
        int ans = 0;
        //将二进制转化为十进制
        for(int i=0; i<31; i++) //数量达到 n 的为 1 ，否则为 0 
            if(bit[i] == n) ans |= (1<<i);
        cout<<ans<<'\n';
    }
    return 0;
}