codeforces - 578B - "Or" Game（模拟）

最新推荐文章于 2019-08-14 21:08:34 发布

原创最新推荐文章于 2019-08-14 21:08:34 发布 · 506 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

模拟专栏收录该内容

11 篇文章

订阅专栏

该博客讨论了一个编程问题，其中目标是在最多k次操作中，通过乘以x来最大化n个数字的按位OR值。博主探讨了错误的初始方法，然后转向使用前缀和技巧，成功解决了这个问题并实现了AC。

You are given n numbers a1, a2, ..., an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make $\text{[math]}$ as large as possible, where $\text{[math]}$ denotes the bitwise OR.

Find the maximum possible value of $\text{[math]}$ after performing at most k operations optimally.

Input

The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).

The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).

Output

Output the maximum value of a bitwise OR of sequence elements after performing operations.

Sample test(s)

input
3 1 2
1 1 1

output
3

input
4 2 3
1 2 4 8

output
79

Note

For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is $\text{[math]}$ .

For the second sample if we multiply 8 by 3 two times we'll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.

奇怪，发了一篇不见了= =

本来是打算求最大的数的K次运算，后来写着写着觉得不对，因为位运算好像不是这样的，而且自己不太理解，那就干脆全部求了一遍，也省事

不过一个一个求会超时，突然想起有次练习渣渣用过的前缀和，感觉靠谱，试了试，竟然过了

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;

long long a[200005];
long long qian[200005], hou[200005];

int main()
{
  long long n, k, x;
  while(scanf("%I64d%I64d%I64d", &n, &k, &x) != EOF)
  {
    for(long long i = 1; i <= n; i++)
    {
      scanf("%I64d", &a[i]);
    }
    for(long long i = 1; i <= n; i++)
      qian[i] = qian[i - 1] | a[i];  //求前缀位运算，英语渣渣用了拼音QAQ
    for(long long i = n; i >= 1; i--)
      hou[i] = hou[i + 1] | a[i];    //求后缀位运算
    long long mul = 1;
    for(long long i = 0; i < k; i++)
    {
      mul *= x;   //对x乘k次，这个值不会变，变得是a[i],所以不如直接求出乘积，省的后面一次次乘上去
    }
    long long mmax = 0;
    for(long long i = 1; i <= n; i++)
    {
      mmax = max(mmax, qian[i - 1] | hou[i + 1] | (mul * a[i]));  //求最大值，前缀位运算||后缀位运算||a[i]
    }
    printf("%I64d\n", mmax);
  }
  return 0;
}