## COCI '15 Contest 3 #5 Nekameleoni

View as PDF

Points: 20 (partial)
Time limit: 1.4s
Memory limit: 512M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Hey! I have an awesome task with chameleons, task for Saturday's competition.

(...)

That's too difficult, I have an easier one, they won't even solve that one.

You are given an array of integers from the interval . You need to process queries. The first type of query requires you to change a number in the array to a different value, and the second type of query requires you to determine the length of the shortest contiguous subarray of the current array that contains all numbers from to .

Hm, I can do it in . What's the limit for ?

#### Input Specification

The first line of input contains the integers , and . The second line of input contains integers separated by space, the integers from the array. After that, queries follow, each in one of the following two forms:

• 1 p v - change the value of the number into
• 2 - what is the length of the shortest contiguous subarray of the array containing all the integers from to

In test cases worth 30% of total points, it will hold .

#### Output Specification

The output must consist of the answers to the queries of the second type, each in its own line.

If the required subarray doesn't exist, output -1.

#### Sample Input 1

4 3 5
2 3 1 2
2
1 3 3
2
1 1 1
2

#### Sample Output 1

3
-1
4

#### Sample Input 2

6 3 6
1 2 3 2 1 1
2
1 2 1
2
1 4 1
1 6 2
2

#### Sample Output 2

3
3
4