CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!)
D
Ones and Twos
Codeforces
1700
原题
← CE →
翻译中…

You are given a $1$-indexed array $a$ of length $n$ where each element is $1$ or $2$.

翻译中…

Process $q$ queries of the following two types:

翻译中…
  • "1 s": check if there exists a subarray$^{\dagger}$ of $a$ whose sum equals to $s$.
  • "2 i v": change $a_i$ to $v$.
翻译中…

$^{\dagger}$ An array $b$ is a subarray of an array $a$ if $b$ can be obtained from $a$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. In particular, an array is a subarray of itself.

翻译中…

Input

翻译中…

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

翻译中…

The first line of each test case contains two integers $n$ and $q$ ($1\le n,q\le 10^5$) — the length of array $a$ and the number of queries.

翻译中…

The second line of each test case contains $n$ integers $a_1,a_2,\ldots,a_n$ ($a_i$ is $1$ or $2$) — the elements of array $a$.

翻译中…

Each of the following $q$ lines of each test case contains some integers. The first integer $\mathrm{op}$ is either $1$ or $2$.

翻译中…
  • If $\mathrm{op}$ is $1$, it is followed by one integer $s$ ($1 \leq s \leq 2n$).
  • If $\mathrm{op}$ is $2$, it is followed by two integers $i$ and $v$ ($1 \leq i \leq n$, $v$ is $1$ or $2$).
翻译中…

It is guaranteed that the sum of $n$ and the sum of $q$ over all test cases both do not exceed $10^5$.

翻译中…

Output

翻译中…

For each query with $\mathrm{op}=1$, output "YES" in one line if there exists a subarray of $a$ whose sum is equals to $s$, otherwise output "NO".

翻译中…

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.

翻译中…

Note

翻译中…

Consider the first example:

翻译中…
  • The answer for the first query is "YES" because $a_1+a_2+a_3=2+1+2=5$.
  • The answer for the second query is "YES" because $a_1+a_2+a_3+a_4=2+1+2+1=6$.
  • The answer for the third query is "NO" because we cannot find any subarray of $a$ whose sum is $7$.
  • After the fourth query, the array $a$ becomes $[2,1,2,2,2]$.
  • The answer for the fifth query is "YES" because $a_2+a_3+a_4+a_5=1+2+2+2=7$.
翻译中…

样例

Input #1
2
5 5
2 1 2 1 2
1 5
1 6
1 7
2 4 2
1 7
3 2
2 2 2
1 6
1 5
Output #1
YES
YES
NO
YES
YES
NO
InputCopy OutputCopy
题目信息
题号
1896D
时间限制
2 s
内存限制
256 MB
标签
二分
数据结构
分治
数学
双指针

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。