A14381 | Equilibrium
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
William has two arrays $a$ and $b$ , each consisting of $n$ items.
For some segments $l..r$ of these arrays William wants to know if it is possible to equalize the values of items in these segments using a balancing operation. Formally, the values are equalized if for each $i$ from $l$ to $r$ holds $a_i = b_i$ .
To perform a balancing operation an even number of indices must be selected, such that $l \le pos_1 < pos_2 < \dots < pos_k \le r$ . Next the items of array a at positions $pos_1, pos_3, pos_5, \dots$ get incremented by one and the items of array b at positions $pos_2, pos_4, pos_6, \dots$ get incremented by one.
William wants to find out if it is possible to equalize the values of elements in two arrays for each segment using some number of balancing operations, and what is the minimal number of operations required for that. Note that for each segment the operations are performed independently.
For some segments $l..r$ of these arrays William wants to know if it is possible to equalize the values of items in these segments using a balancing operation. Formally, the values are equalized if for each $i$ from $l$ to $r$ holds $a_i = b_i$ .
To perform a balancing operation an even number of indices must be selected, such that $l \le pos_1 < pos_2 < \dots < pos_k \le r$ . Next the items of array a at positions $pos_1, pos_3, pos_5, \dots$ get incremented by one and the items of array b at positions $pos_2, pos_4, pos_6, \dots$ get incremented by one.
William wants to find out if it is possible to equalize the values of elements in two arrays for each segment using some number of balancing operations, and what is the minimal number of operations required for that. Note that for each segment the operations are performed independently.
输入格式
The first line contains a two integers $n$ and $q$ ( $2 \le n \le 10^5$ , $1 \le q \le 10^5$ ), the size of arrays $a$ and $b$ and the number of segments.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ $(0 \le a_i \le 10^9)$ .
The third line contains $n$ integers $b_1, b_2, \dots, b_n$ $(0 \le b_i \le 10^9)$ .
Each of the next $q$ lines contains two integers $l_i$ and $r_i$ $(1 \le l_i < r_i \le n)$ , the edges of segments.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ $(0 \le a_i \le 10^9)$ .
The third line contains $n$ integers $b_1, b_2, \dots, b_n$ $(0 \le b_i \le 10^9)$ .
Each of the next $q$ lines contains two integers $l_i$ and $r_i$ $(1 \le l_i < r_i \le n)$ , the edges of segments.
输出格式
For each segment output a single number — the minimal number of balancing operations needed or "-1" if it is impossible to equalize segments of arrays.
输入输出样例
输入 #1
8 5 0 1 2 9 3 2 7 5 2 2 1 9 4 1 5 8 2 6 1 7 2 4 7 8 5 8
输出 #1
1 3 1 -1 -1
For the first segment from $2$ to $6$ you can do one operation with $pos = [2, 3, 5, 6]$ , after this operation the arrays will be: $a = [0, 2, 2, 9, 4, 2, 7, 5]$ , $b = [2, 2, 2, 9, 4, 2, 5, 8]$ . Arrays are equal on a segment from $2$ to $6$ after this operation.
For the second segment from $1$ to $7$ you can do three following operations:
1. $pos = [1, 3, 5, 6]$
2. $pos = [1, 7]$
3. $pos = [2, 7]$
After these operations, the arrays will be: $a = [2, 2, 2, 9, 4, 2, 7, 5]$ , $b = [2, 2, 2, 9, 4, 2, 7, 8]$ . Arrays are equal on a segment from $1$ to $7$ after these operations.
For the third segment from $2$ to $4$ you can do one operation with $pos = [2, 3]$ , after the operation arrays will be: $a = [0, 2, 2, 9, 3, 2, 7, 5]$ , $b = [2, 2, 2, 9, 4, 1, 5, 8]$ . Arrays are equal on a segment from $2$ to $4$ after this operation.
It is impossible to equalize the fourth and the fifth segment.
For the second segment from $1$ to $7$ you can do three following operations:
1. $pos = [1, 3, 5, 6]$
2. $pos = [1, 7]$
3. $pos = [2, 7]$
After these operations, the arrays will be: $a = [2, 2, 2, 9, 4, 2, 7, 5]$ , $b = [2, 2, 2, 9, 4, 2, 7, 8]$ . Arrays are equal on a segment from $1$ to $7$ after these operations.
For the third segment from $2$ to $4$ you can do one operation with $pos = [2, 3]$ , after the operation arrays will be: $a = [0, 2, 2, 9, 3, 2, 7, 5]$ , $b = [2, 2, 2, 9, 4, 1, 5, 8]$ . Arrays are equal on a segment from $2$ to $4$ after this operation.
It is impossible to equalize the fourth and the fifth segment.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted