A10168 | Interview
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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 $x_{l},x_{l+1},...,x_{r}$ , where $x_{i}$ 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 sum $f(a,l,r)+f(b,l,r)$ among all possible $1<=l<=r<=n$ .
We define function $f(x,l,r)$ as a bitwise OR of integers $x_{l},x_{l+1},...,x_{r}$ , where $x_{i}$ 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 sum $f(a,l,r)+f(b,l,r)$ among all possible $1<=l<=r<=n$ .
输入格式
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 $a_{i}$ ( $0<=a_{i}<=10^{9}$ ).
The third line contains $n$ integers $b_{i}$ ( $0<=b_{i}<=10^{9}$ ).
The second line contains $n$ integers $a_{i}$ ( $0<=a_{i}<=10^{9}$ ).
The third line contains $n$ integers $b_{i}$ ( $0<=b_{i}<=10^{9}$ ).
输出格式
Print a single integer — the maximum value of sum $f(a,l,r)+f(b,l,r)$ among all possible $1<=l<=r<=n$ .
输入输出样例
输入 #1
5 1 2 4 3 2 2 3 3 12 1
输出 #1
22
输入 #2
10 13 2 7 11 8 4 9 8 5 1 5 7 18 9 2 3 0 11 8 6
输出 #2
46
Bitwise OR of two non-negative integers $a$ and $b$ is the number $c=a\ OR\ b$ , 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\ 4\ OR\ 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$ .
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\ 4\ OR\ 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$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted