A9038 | Eugeny and Array
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Eugeny has array $a=a_{1},a_{2},...,a_{n}$ , consisting of $n$ integers. Each integer $a_{i}$ equals to -1, or to 1. Also, he has $m$ queries:
- Query number $i$ is given as a pair of integers $l_{i}$ , $r_{i}$ $(1<=l_{i}<=r_{i}<=n)$ .
- The response to the query will be integer $1$ , if the elements of array $a$ can be rearranged so as the sum $a_{li}+a_{li}+1+...+a_{ri}=0$ , otherwise the response to the query will be integer $0$ .
Help Eugeny, answer all his queries.
- Query number $i$ is given as a pair of integers $l_{i}$ , $r_{i}$ $(1<=l_{i}<=r_{i}<=n)$ .
- The response to the query will be integer $1$ , if the elements of array $a$ can be rearranged so as the sum $a_{li}+a_{li}+1+...+a_{ri}=0$ , otherwise the response to the query will be integer $0$ .
Help Eugeny, answer all his queries.
输入格式
The first line contains integers $n$ and $m$ $(1<=n,m<=2·10^{5})$ . The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ $(a_{i}=$ - $1,1)$ . Next $m$ lines contain Eugene's queries. The $i$ -th line contains integers $l_{i},r_{i}$ $(1<=l_{i}<=r_{i}<=n)$ .
输出格式
Print $m$ integers — the responses to Eugene's queries in the order they occur in the input.
输入输出样例
输入 #1
2 3 1 -1 1 1 1 2 2 2
输出 #1
0 1 0
输入 #2
5 5 -1 1 1 1 -1 1 1 2 3 3 5 2 5 1 5
输出 #2
0 1 0 1 0
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted