Codeforces Global Round 23 |
---|
Finished |
You have an array a consisting of n positive integers and you have to handle q queries of the following types:
The first line of the input contains two integers n and q (1≤n,q≤3⋅105), the length of a and the number of queries.
Next line contains n integers a1,a2,…an (1≤ai≤109) — the elements of a.
Each of the next q lines describes a query. It has one of the following forms.
For each query of the second type, if answer of the query is yes, print "YES", otherwise print "NO".
10 8
1234 2 3 3 2 1 1 2 3 4
2 1 6 2
1 1 1
2 1 6 2
2 1 9 2
1 10 5
2 1 9 3
1 3 5
2 3 10 2
NO
YES
NO
YES
YES
In the first query, requested subarray is [1234,2,3,3,2,1], and it's obvious that the number of occurrence of 1 isn't divisible by k=2. So the answer is "NO".
In the third query, requested subarray is [1,2,3,3,2,1], and it can be seen that the number of occurrence of every integer in this sub array is divisible by k=2. So the answer is "YES".
In the sixth query, requested subarray is [1,2,3,3,2,1,1,2,3], and it can be seen that the number of occurrence of every integer in this sub array is divisible by k=3. So the answer is "YES".
Name |
---|