CF1807D.Odd Queries

入门

通过率:0%

时间限制:2.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You have an array a1,a2,…,ana_1, a_2, \dots, a_n. Answer qq queries of the following form:

  • If we change all elements in the range al,al+1,…,ara_l, a_{l+1}, \dots, a_r of the array to kk, will the sum of the entire array be odd?

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

你有一个数组 a1,a2,…,ana_1, a_2, \dots, a_n。请回答 qq 个如下形式的查询:

  • 如果我们将数组中区间 al,al+1,…,ara_l, a_{l+1}, \dots, a_r 内的所有元素都修改为 kk,那么整个数组的元素和是否为奇数?

注意:各次查询相互独立,不会影响后续查询。

输入格式

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

The first line of each test case consists of 22 integers nn and qq (1≤n≤2⋅1051 \le n \le 2 \cdot 10^5; 1≤q≤2⋅1051 \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 nn integers aia_i (1≤ai≤1091 \le a_i \le 10^9) — the array aa.

The next qq lines of each test case consists of 33 integers l,r,kl,r,k (1≤l≤r≤n1 \le l \le r \le n; 1≤k≤1091 \le k \le 10^9) — the queries.

It is guaranteed that the sum of nn over all test cases doesn't exceed 2⋅1052 \cdot 10^5, and the sum of qq doesn't exceed 2⋅1052 \cdot 10^5.

每个测试包含多个测试用例。第一行包含测试用例的数量 tt(1≤t≤1041 \le t \le 10^4)。随后是各测试用例的描述。

每个测试用例的第一行包含两个整数 nn 和 qq(1≤n≤2⋅1051 \le n \le 2 \cdot 10^5;1≤q≤2⋅1051 \le q \le 2 \cdot 10^5)——分别表示数组的长度和查询的数量。

每个测试用例的第二行包含 nn 个整数 aia_i(1≤ai≤1091 \le a_i \le 10^9)——即数组 aa。

每个测试用例的接下来 qq 行,每行包含三个整数 l,r,kl, r, k(1≤l≤r≤n1 \le l \le r \le n;1≤k≤1091 \le k \le 10^9)——表示一次查询。

保证所有测试用例的 nn 之和不超过 2⋅1052 \cdot 10^5,且所有测试用例的 qq 之和不超过 2⋅1052 \cdot 10^5。

输出格式

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.

对于每个查询,如果整个数组的和变为奇数,则输出“YES”;否则输出“NO”。

您可以以任意大小写形式输出答案(大写或小写均可)。例如,字符串 “yEs”、“yes”、“Yes” 和 “YES” 均会被识别为肯定回答。

输入输出样例

  • 输入#1

    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

    输出#1

    YES
    YES
    YES
    NO
    YES
    NO
    NO
    NO
    NO
    YES

说明/提示

For the first test case:

  • If the elements in the range (2,3)(2, 3) would get set to 33 the array would become 2,3,3,3,2{2, 3, 3, 3, 2}, the sum would be 2+3+3+3+2=132+3+3+3+2 = 13 which is odd, so the answer is "YES".
  • If the elements in the range (2,3)(2, 3) would get set to 44 the array would become 2,4,4,3,2{2, 4, 4, 3, 2}, the sum would be 2+4+4+3+2=152+4+4+3+2 = 15 which is odd, so the answer is "YES".
  • If the elements in the range (1,5)(1, 5) would get set to 55 the array would become 5,5,5,5,5{5, 5, 5, 5, 5}, the sum would be 5+5+5+5+5=255+5+5+5+5 = 25 which is odd, so the answer is "YES".
  • If the elements in the range (1,4)(1, 4) would get set to 99 the array would become 9,9,9,9,2{9, 9, 9, 9, 2}, the sum would be 9+9+9+9+2=389+9+9+9+2 = 38 which is even, so the answer is "NO".
  • If the elements in the range (2,4)(2, 4) would get set to 33 the array would become 2,3,3,3,2{2, 3, 3, 3, 2}, the sum would be 2+3+3+3+2=132+3+3+3+2 = 13 which is odd, so the answer is "YES".

对于第一个测试用例:

  • 如果将区间 (2,3)(2, 3) 内的元素全部设为 33,数组将变为 2,3,3,3,2{2, 3, 3, 3, 2},其和为 2+3+3+3+2=132+3+3+3+2 = 13,是奇数,因此答案为 “YES”。
  • 如果将区间 (2,3)(2, 3) 内的元素全部设为 44,数组将变为 2,4,4,3,2{2, 4, 4, 3, 2},其和为 2+4+4+3+2=152+4+4+3+2 = 15,是奇数,因此答案为 “YES”。
  • 如果将区间 (1,5)(1, 5) 内的元素全部设为 55,数组将变为 5,5,5,5,5{5, 5, 5, 5, 5},其和为 5+5+5+5+5=255+5+5+5+5 = 25,是奇数,因此答案为 “YES”。
  • 如果将区间 (1,4)(1, 4) 内的元素全部设为 99,数组将变为 9,9,9,9,2{9, 9, 9, 9, 2},其和为 9+9+9+9+2=389+9+9+9+2 = 38,是偶数,因此答案为 “NO”。
  • 如果将区间 (2,4)(2, 4) 内的元素全部设为 33,数组将变为 2,3,3,3,2{2, 3, 3, 3, 2},其和为 2+3+3+3+2=132+3+3+3+2 = 13,是奇数,因此答案为 “YES”。

输入解题思路,AI测评打分。不知道怎么写?

首页