Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] D 前缀后缀维护
2016-07-12 14:41
281 查看
链接:戳这里
D. "Or" Game
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 as large as possible, where denotes the bitwise OR.
Find the maximum possible value of 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.
Examples
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 .
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.
题意:
给出n个数,k个操作,每个操作是将ai乘以x,问在最多k次操作后 所有n个数的抑或最大 输出答案
思路:
k次操作,且(2<=x<=8) 那么这个数只可能增大而且越来越大
我们肯定是将这个数值(x^k)直接乘到一个数去 这里应该很好理解
接下来时乘到哪个数上去呢?一开始我直接放在最大的那个数上,发现并不能最优
那么我们就直接On枚举,每个数看看放上去使得答案取max
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define maxn 0x3f3f3f3f
#define MAX 1000100
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef unsigned long long ull;
#define INF (1ll<<60)-1
using namespace std;
int n,k,x;
ll a[200100],pre[200100],last[200100];
int main(){
scanf("%d%d%d",&n,&k,&x);
for(int i=1;i<=n;i++) {
scanf("%I64d",&a[i]);
pre[i]=pre[i-1]|a[i];
}
ll num=1;
while(k--) num*=x;
ll ans=0;
for(int i=n;i>=1;i--) last[i]=last[i+1]|a[i];
for(int i=1;i<=n;i++){
ans=max(ans,num*a[i]|last[i+1]|pre[i-1]);
}
printf("%I64d\n",ans);
return 0;
}
D. "Or" Game
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 as large as possible, where denotes the bitwise OR.
Find the maximum possible value of 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.
Examples
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 .
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.
题意:
给出n个数,k个操作,每个操作是将ai乘以x,问在最多k次操作后 所有n个数的抑或最大 输出答案
思路:
k次操作,且(2<=x<=8) 那么这个数只可能增大而且越来越大
我们肯定是将这个数值(x^k)直接乘到一个数去 这里应该很好理解
接下来时乘到哪个数上去呢?一开始我直接放在最大的那个数上,发现并不能最优
那么我们就直接On枚举,每个数看看放上去使得答案取max
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define maxn 0x3f3f3f3f
#define MAX 1000100
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef unsigned long long ull;
#define INF (1ll<<60)-1
using namespace std;
int n,k,x;
ll a[200100],pre[200100],last[200100];
int main(){
scanf("%d%d%d",&n,&k,&x);
for(int i=1;i<=n;i++) {
scanf("%I64d",&a[i]);
pre[i]=pre[i-1]|a[i];
}
ll num=1;
while(k--) num*=x;
ll ans=0;
for(int i=n;i>=1;i--) last[i]=last[i+1]|a[i];
for(int i=1;i<=n;i++){
ans=max(ans,num*a[i]|last[i+1]|pre[i-1]);
}
printf("%I64d\n",ans);
return 0;
}
相关文章推荐
- 在linux中挂载盘/格式化磁盘
- ros-indigo-desktop-full安装到ubuntu14.04
- Linux安全体系的文件权限管理
- #pragma warning( pop ) 和#pragma warning( push )有什么用
- linux 修改用户密码
- centos6.7上使用nginx实现负载均衡
- linux操作系统-find的详细用法
- Linux下安装PCRE
- constructor-arg的使用以及Properties的使用
- tomcat机器重启自启动
- linux下解压zip文件时,文件名乱码的解决
- linux缺页异常处理--用户空间【转】
- linux缺页异常处理--内核空间【转】
- openjudge-最好的草
- 高并发网站更新数据库数据比较高效的方式
- linux进程地址空间--vma的基本操作【转】
- OpenWRT移植到三星S5PV210处理器上
- 家用监控系统
- linux命令
- linux rm -f rm -rf 命令:删除文件和文件夹