CodeForces - 631A Interview (思想)水
来源:互联网 发布:塔利班和中国关系 知乎 编辑:程序博客网 时间:2024/05/29 08:32
Description
Blake is a CEO of a large company called "Blake Technologies". He loves his company very much and he thinks that his company should be the best. That is why every candidate needs to pass through the interview that consists of the following problem.
We define function f(x, l, r) as a bitwise OR of integers xl, xl + 1, ..., xr, where xi is the i-th element of the array x. You are given two arrays a and b of length n. You need to determine the maximum value of sumf(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the length of the arrays.
The second line contains n integers ai (0 ≤ ai ≤ 109).
The third line contains n integers bi (0 ≤ bi ≤ 109).
Output
Print a single integer — the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.
Sample Input
51 2 4 3 22 3 3 12 1
22
1013 2 7 11 8 4 9 8 5 15 7 18 9 2 3 0 11 8 6
46
Hint
Bitwise OR of two non-negative integers a and b is the number c = aORb, such that each of its digits in binary notation is 1 if and only if at least one of a or b have 1 in the corresponding position in binary notation.
In the first sample, one of the optimal answers is l = 2 and r = 4, because f(a, 2, 4) + f(b, 2, 4) = (2 OR 4OR 3) + (3 OR 3 OR 12) = 7 + 15 = 22. Other ways to get maximum value is to choose l = 1 and r = 4,l = 1 and r = 5, l = 2 and r = 4, l = 2 and r = 5, l = 3 and r = 4, or l = 3 and r = 5.
In the second sample, the maximum value is obtained for l = 1 and r = 9.
Source
#include<stdio.h>#include<string.h>#include<algorithm>#define INF 0x3f3f3f3f#define ll long long#define N 1010#define M 1000000007#define PI acos(-1.0)using namespace std;int a[N];int b[N];int main(){int i,j,k;int n;while(scanf("%d",&n)!=EOF){int aa=0,bb=0;for(i=0;i<n;i++){scanf("%d",&a[i]);aa=aa|a[i];}for(i=0;i<n;i++){scanf("%d",&b[i]);bb=bb|b[i];}printf("%d\n",aa+bb);}return 0;}
- CodeForces - 631A Interview (思想)水
- CodeForces 631 A.Interview(水~)
- CodeForces 631A-Interview
- Codeforces 631A - Interview
- CodeForces 631A--Interview
- CodeForces 631A Interview
- 【Codeforces 631 A Interview】
- codeforces 631A Interview
- Codeforces 631A Interview【模拟水题】
- Codeforces--631A--Interview(位运算)
- CodeForces 631A Interview(水题)
- Codeforces 631A Interview 【水题】
- CodeForces 631A 631A - Interview
- CodeForces 631 A A. Interview【枚举】
- Codeforces 631A Interview(分析&&位运算| )
- CodeForces 631A:Interview【位运算】
- Codeforces Round #344 (Div. 2) 631A Interview (DP)
- Codeforces Round #344 (Div. 2) A. Interview (位运算)
- uva10801
- Backbone源码分析-Backbone架构+流程图
- day13—HTML DOM编程
- 我的环境云初体验
- ionic + 高德地图定位
- CodeForces - 631A Interview (思想)水
- VIM
- 初识JavaScript
- 项目开发技巧
- Dubbo与Zookeeper、SpringMVC整合和使用(负载均衡、容错)
- 搭建Hadoop2.7.2开发环境1(编译Eclipse中hadoop插件hadoop2x-eclipse-plugin)
- Linux 下SVN 命令行的使用
- 陶陶的难题
- 开发中遇到的错误