A11279 | Bitwise Paradox
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given two arrays $a$ and $b$ of size $n$ along with a fixed integer $v$ .
An interval $[l, r]$ is called a good interval if $(b_l \mid b_{l+1} \mid \ldots \mid b_r) \ge v$ , where $|$ denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). The beauty of a good interval is defined as $\max(a_l, a_{l+1}, \ldots, a_r)$ .
You are given $q$ queries of two types:
- "1 i x": assign $b_i := x$ ;
- "2 l r": find the minimum beauty among all good intervals $[l_0,r_0]$ satisfying $l \le l_0 \le r_0 \le r$ . If there is no suitable good interval, output $-1$ instead.
Please process all queries.
An interval $[l, r]$ is called a good interval if $(b_l \mid b_{l+1} \mid \ldots \mid b_r) \ge v$ , where $|$ denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). The beauty of a good interval is defined as $\max(a_l, a_{l+1}, \ldots, a_r)$ .
You are given $q$ queries of two types:
- "1 i x": assign $b_i := x$ ;
- "2 l r": find the minimum beauty among all good intervals $[l_0,r_0]$ satisfying $l \le l_0 \le r_0 \le r$ . If there is no suitable good interval, output $-1$ instead.
Please process all queries.
输入格式
Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 10^5$ ). The description of the test cases follows.
The first line of each test case contains two integers $n$ and $v$ ( $1 \le n \le 2 \cdot 10^5$ , $1 \le v \le 10^9$ ).
The second line of each testcase contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \le a_i \le 10^9$ ).
The third line of each testcase contains $n$ integers $b_1, b_2, \ldots, b_n$ ( $1 \le b_i \le 10^9$ ).
The fourth line of each testcase contains one integer $q$ ( $1 \le q \le 2 \cdot 10^5$ ).
The $i$ -th of the following $q$ lines contains the description of queries. Each line is of one of two types:
- "1 i x" ( $1 \le i \le n$ , $1 \le x \le 10^9)$ ;
- "2 l r" ( $1 \le l \le r \le n$ ).
It is guaranteed that both the sum of $n$ and the sum of $q$ over all test cases do not exceed $2 \cdot 10^5$ .
The first line of each test case contains two integers $n$ and $v$ ( $1 \le n \le 2 \cdot 10^5$ , $1 \le v \le 10^9$ ).
The second line of each testcase contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \le a_i \le 10^9$ ).
The third line of each testcase contains $n$ integers $b_1, b_2, \ldots, b_n$ ( $1 \le b_i \le 10^9$ ).
The fourth line of each testcase contains one integer $q$ ( $1 \le q \le 2 \cdot 10^5$ ).
The $i$ -th of the following $q$ lines contains the description of queries. Each line is of one of two types:
- "1 i x" ( $1 \le i \le n$ , $1 \le x \le 10^9)$ ;
- "2 l r" ( $1 \le l \le r \le n$ ).
It is guaranteed that both the sum of $n$ and the sum of $q$ over all test cases do not exceed $2 \cdot 10^5$ .
输出格式
For each test case, output the answers for all queries of the second type.
输入输出样例
输入 #1
3 3 7 2 1 3 2 2 3 4 2 1 3 1 2 5 2 2 3 2 1 3 4 5 5 1 2 4 4 2 3 3 6 2 1 4 1 3 15 2 3 4 2 2 4 1 2 13 2 1 4 1 5 6 4 1 2 1 1
输出 #1
-1 3 2 5 2 2 1 -1
In the first test case, $a = [2, 1, 3]$ , $b = [2, 2, 3]$ , and $v = 7$ .
The first query is of the second type and has $l = 1$ and $r = 3$ . The largest interval available is $[1, 3]$ , and its bitwise OR is $b_1 \mid b_2 \mid b_3 = 3$ which is less than $v$ . Thus, no good interval exists.
The second query asks to change $b_2$ to $5$ , so $b$ becomes $[2, 5, 3]$ .
The third query is of the second type and has $l = 2$ and $r = 3$ . There are three possible intervals: $[2, 2]$ , $[3, 3]$ , and $[2, 3]$ . However, $b_2 = 5 < v$ , $b_3 = 3 < v$ . So only the last interval is good: it has $b_2 \mid b_3 = 7$ . The answer is thus $\max(a_2, a_3) = 3$ .
The fourth query is of the second type and has $l = 1$ and $r = 3$ . There are three good intervals: $[1, 2]$ , $[2, 3]$ , and $[1, 3]$ . Their beauty is $2$ , $3$ , $3$ correspondingly. The answer is thus $2$ .
In the second test case, $a = [5, 1, 2, 4]$ , $b = [4, 2, 3, 3]$ , and $v = 5$ .
The first query has $l = 1$ and $r = 4$ . The only good intervals are: $[1, 2]$ , $[1, 3]$ , $[1, 4]$ . Their beauty is $5$ , $5$ , $5$ correspondingly. The answer is thus $5$ .
The first query is of the second type and has $l = 1$ and $r = 3$ . The largest interval available is $[1, 3]$ , and its bitwise OR is $b_1 \mid b_2 \mid b_3 = 3$ which is less than $v$ . Thus, no good interval exists.
The second query asks to change $b_2$ to $5$ , so $b$ becomes $[2, 5, 3]$ .
The third query is of the second type and has $l = 2$ and $r = 3$ . There are three possible intervals: $[2, 2]$ , $[3, 3]$ , and $[2, 3]$ . However, $b_2 = 5 < v$ , $b_3 = 3 < v$ . So only the last interval is good: it has $b_2 \mid b_3 = 7$ . The answer is thus $\max(a_2, a_3) = 3$ .
The fourth query is of the second type and has $l = 1$ and $r = 3$ . There are three good intervals: $[1, 2]$ , $[2, 3]$ , and $[1, 3]$ . Their beauty is $2$ , $3$ , $3$ correspondingly. The answer is thus $2$ .
In the second test case, $a = [5, 1, 2, 4]$ , $b = [4, 2, 3, 3]$ , and $v = 5$ .
The first query has $l = 1$ and $r = 4$ . The only good intervals are: $[1, 2]$ , $[1, 3]$ , $[1, 4]$ . Their beauty is $5$ , $5$ , $5$ correspondingly. The answer is thus $5$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted