Interview(位运算)
来源:互联网 发布:好家伙 盗亦有道 知乎 编辑:程序博客网 时间:2024/06/10 12:03
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 integersxl, xl + 1, ..., xr, wherexi is thei-th element of the array x. You are given two arrays a andb of length n. You need to determine the maximum value of sumf(a, l, r) + f(b, l, r) among all possible1 ≤ 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 possible1 ≤ 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
Sample Output
Hint
Bitwise OR of two non-negative integers a andb is the number c = aORb,such that each of its digits in binary notation is1 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 andr = 4, because f(a, 2, 4) + f(b, 2, 4) = (2OR 4 OR 3) + (3 OR 3 OR 12) = 7 + 15 = 22. Other ways to get maximum value is to choosel = 1 and r = 4,l = 1 and r = 5,l = 2 and r = 4,l = 2 and r = 5,l = 3 and r = 4, orl = 3 and r = 5.
In the second sample, the maximum value is obtained for l = 1 and r = 9.
注;这题主要考查位运算:每一列中,得出最大一个数,这个数的每个二进制位上的1,在这一列数中都能找到一个或多个数在相同的二进制位置上的1与之对应。
之前想着循环除以2得到每个数的2进制位,不过感觉会超时,所以就百度别人的题解,发现直接用或运算很简便。
My solution:
#include<stdio.h>int main(){int i,j,n,m,k;int a[1100],b[1100];while(scanf("%d",&n)==1){for(i=1;i<=n;i++)scanf("%d",&a[i]);for(i=1;i<=n;i++)scanf("%d",&b[i]);for(i=2;i<=n;i++){a[1]|=a[i];//与运算 b[1]|=b[i];}k=a[1]+b[1];printf("%d\n",k); }return 0;}
- Interview(位运算)
- Codeforces--631A--Interview(位运算)
- CF631 A. Interview【位运算】
- Codeforces 631A Interview(分析&&位运算| )
- Codeforces Round #344 (Div. 2) A. Interview (位运算)
- CodeForces 631A:Interview【位运算】
- 位运算(技巧)
- 位运算(2)
- 位运算(3)
- 位运算(1)
- 位运算(2)
- 位运算知识点 (& ^ | )
- (6)位运算
- 位运算(1)
- & | ^ ~ << >> >>>(java位运算)
- java 位运算(位操作)
- POJ 3748 位操作(位运算)
- 位运算符(一):C/C++位运算符
- android:clipChildren属性
- cocos2dx3.X项目重写(七)观察者模式以及schedule引起的bug
- java判断“==”和equals的区别
- HDU 3538 R(N)
- 人工智能——神经网络算法初体验 【精华】
- Interview(位运算)
- Python 正整数任意进制互转换代码示例
- 记忆化搜索简介
- yield用法以及IEnumerable转数组
- 第三周项目4-穷举法-三色球问题
- 合法IP
- c++第1次试验1
- 回文数判断
- 工具的使用——PyCharm (二)