每日一题第六十期 Codeforces Round 859 (Div. 4)

最新推荐文章于 2024-09-13 16:27:15 发布

娇娇yyyyyy

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量762

点赞数 16

分类专栏：每日一题文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/2301_80882026/article/details/137228911

版权

每日一题专栏收录该内容

97 篇文章 1 订阅

订阅专栏

D. Odd Queries

time limit per test: 2 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

You have an array $a_1, a_2, \dots, a_n$ . Answer $q$ queries of the following form:

If we change all elements in the range $a_l, a_{l+1}, \dots, a_r$ of the array to $k$ , will the sum of the entire array be odd?

Note that queries are independent and do not affect future queries.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $\le t \le 10^4$ ). The description of the test cases follows.

The first line of each test case consists of $2$ integers $n$ and $q$ ( $\le n \le 2 \cdot 10^5$ ; $\le q \le 2 \cdot 10^5$ ) — the length of the array and the number of queries.

The second line of each test case consists of $n$ integers $a_i$ ( $\le a_i \le 10^9$ ) — the array $a$ .

The next $q$ lines of each test case consists of $3$ integers $l, r, k$ ( $\le l \le r \le n$ ; $\le k \le 10^9$ ) — the queries.

It is guaranteed that the sum of $n$ over all test cases doesn’t exceed $\cdot 10^5$ , and the sum of $q$ doesn’t exceed $\cdot 10^5$ .

Output

For each query, output “YES” if the sum of the entire array becomes odd, and “NO” otherwise.

You can output the answer in any case (upper or lower). For example, the strings “yEs”, “yes”, “Yes”, and “YES” will be recognized as positive responses.

Example
inputCopy
2
5 5
2 2 1 3 2
2 3 3
2 3 4
1 5 5
1 4 9
2 4 3
10 5
1 1 1 1 1 1 1 1 1 1
3 8 13
2 5 10
3 8 10
1 10 2
1 9 100
outputCopy
YES
YES
YES
NO
YES
NO
NO
NO
NO
YES

Note

For the first test case:

If the elements in the range $(2, 3)$ would get set to $3$ the array would become ${2, 3, 3, 3, 2\}$ , the sum would be $2 + 3 + 3 + 3 + 2 = 13$ which is odd, so the answer is “YES”.
If the elements in the range $(2, 3)$ would get set to $4$ the array would become ${2, 4, 4, 3, 2\}$ , the sum would be $2 + 4 + 4 + 3 + 2 = 15$ which is odd, so the answer is “YES”.
If the elements in the range $(1, 5)$ would get set to $5$ the array would become ${5, 5, 5, 5, 5\}$ , the sum would be $5 + 5 + 5 + 5 + 5 = 25$ which is odd, so the answer is “YES”.
If the elements in the range $(1, 4)$ would get set to $9$ the array would become ${9, 9, 9, 9, 2\}$ , the sum would be $9 + 9 + 9 + 9 + 2 = 38$ which is even, so the answer is “NO”.
If the elements in the range $(2, 4)$ would get set to $3$ the array would become ${2, 3, 3, 3, 2\}$ , the sum would be $2 + 3 + 3 + 3 + 2 = 13$ which is odd, so the answer is “YES”.

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
#include<iomanip>
#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=1e9 + 7;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e6 + 10;

int t;
int n, q;
int a[N];
ll s[N];
int main()
{
	cin >> t;
	while(t --){
		cin >> n >> q;
		int flag = 0;
		for(int i = 1; i <= n; i ++)
		{
			cin >> a[i];
			s[i] = s[i - 1] + a[i];
		}
		if(s[n] & 1) flag = 1;
		while(q --){
			int l, r, k;
			cin >> l >> r >> k;
			ll res = abs(s[r] - s[l - 1] - k * (l - r  +1));
			if((res & 1 && flag == 1) || (res % 2 == 0 && flag == 0) ) puts("NO");
			else puts("YES");
		}
	}
	return 0;
}