시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
3 초 (추가 시간 없음) | 1024 MB | 14 | 6 | 6 | 46.154% |
Bob likes to play seesaw. He thinks that it would be really funny if the seesaw is in a balanced state. It means that the seesaw is not tilted to the left and right. After playing the seesaw, Bob thinks about a problem related to the balanced seesaw.
Let $A = [a_1, a_2, \dots , a_m]$ denote an array of length $m$. Bob thinks that $[a_1, a_2, \dots , a_m]$ is a balanced seesaw array if there exists an integer $k$ between $1$ to $m$ such that $\sum_{i=1}^{m}{(i-k)a_i} = 0$.
Bob gets an array $A = [a_1, a_2, \dots , a_n]$ as his birthday gift, and he is curious about whether some non-empty subarray is a balanced seesaw array. More formally, he is interested in whether $[a_ℓ , a_{ℓ+1}, \dots , a_r]$ is a balanced seesaw array for some specified pair $(ℓ, r)$ where $1 ≤ ℓ ≤ r ≤ n$. Bob also finds that the elements in its array will change by time, it will have the following two types of changes.
For convenience, Bob will give you the array $A = [a_1, a_2, \dots , a_n]$ first. Then, there are $q$ operations. Each operation will be one of the following three types.
Yes
” or “No
” for each operation type 3.The first line of input contains two integers $n$ and $q$. $n$ is the length of the array, and $q$ is the number of operations. The second line contains $n$ integers $a_i$ to define the array. Each of the following $q$ lines is an operation described in the problem statement.
Please output “Yes
” or “No
” to indicate whether $[a_ℓ , a_{ℓ+1}, \dots , a_r]$ is a balanced seesaw array for each type 3 operation.
3 6 1 2 3 3 1 1 3 1 3 1 1 1 2 3 1 3 2 2 2 0 3 2 3
Yes No Yes Yes
ICPC > Regionals > Asia Pacific > Taiwan > Taiwan Online Programming Contest > TOPC 2022 B번