2774.GukiZ and GukiZiana

Time Limit: 1s Memory Limit: 256MB

Professor GukiZ was playing with arrays again and accidentally discovered new function, which he called GukiZiana. For given array a, indexed with integers from 1 to n, and number y, GukiZiana(a,y) represents maximum value of j-i, such that aj=ai=y. If there is no y as an element in a, then GukiZiana(a,y) is equal to -1. GukiZ also prepared a problem for you. This time, you have two types of queries:
First type has form 1 l r x and asks you to increase values of all ai such that l \le i \le r by the non-negative integer x. Second type has form 2 y and asks you to find value of GukiZiana(a,y).
For each query of type 2, print the answer and make GukiZ happy!

Input Format(From the terminal/stdin)

The first line contains two integers n, q (1 \le n \le 5105,1 \le q \le 5104), size of array a, and the number of queries.

The second line contains n integers a1,a2,... an (1 \le ai \le 109), forming an array a.

Each of next q lines contain either four or two numbers, as described in statement:

If line starts with 1, then the query looks like 1 l r x (1 \le l \le r \le n, 0 \le x \le 109), first type query.

If line starts with 2, then th query looks like 2 y (1 \le y \le 109), second type query.

Output Format(To the terminal/stdout)

For each query of type 2, print the value of GukiZiana(a,y), for y value for that query.

Sample Input 1

Copy 
4 3
1 2 3 4
1 1 2 1
1 1 1 1
2 3
 · \n
 · · · \n
 · · · \n
 · · · \n
 · \n

Sample Output 1

Copy 
2
 \n

Sample Input 2

Copy 
2 3
1 2
1 2 2 1
2 3
2 4
 · \n
 · \n
 · · · \n
 · \n
 · \n

Sample Output 2

Copy 
0
-1
 \n
  \n

Submit

请先 登录
 Submit
题解(0)
© 2025 FAQs