1013B.md (1709B)
1 Source: https://codeforces.com/problemset/problem/1013/B 2 3 B. And 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 There is an array with *n* elements *a*1, *a*2, ..., *a**n* and the number *x*. 22 23 In one operation you can select some *i* (1 ≤ *i* ≤ *n*) and replace element *a**i* with *a**i* & *x*, where & denotes the [bitwise and](https://en.wikipedia.org/wiki/Bitwise_operation#AND) operation. 24 25 You want the array to have at least two equal elements after applying some operations (possibly, none). In other words, there should be at least two distinct indices *i* ≠ *j* such that *a**i* = *a**j*. Determine whether it is possible to achieve and, if possible, the minimal number of operations to apply. 26 27 Input 28 29 The first line contains integers *n* and *x* (2 ≤ *n* ≤ 100 000, 1 ≤ *x* ≤ 100 000), number of elements in the array and the number to and with. 30 31 The second line contains *n* integers *a**i* (1 ≤ *a**i* ≤ 100 000), the elements of the array. 32 33 Output 34 35 Print a single integer denoting the minimal number of operations to do, or -1, if it is impossible. 36 37 Examples 38 39 Input 40 41 ``` 42 4 3 43 1 2 3 7 44 ``` 45 46 Output 47 48 ``` 49 1 50 ``` 51 52 Input 53 54 ``` 55 2 228 56 1 1 57 ``` 58 59 Output 60 61 ``` 62 0 63 ``` 64 65 Input 66 67 ``` 68 3 7 69 1 2 3 70 ``` 71 72 Output 73 74 ``` 75 -1 76 ``` 77 78 Note 79 80 In the first example one can apply the operation to the last element of the array. That replaces 7 with 3, so we achieve the goal in one move. 81 82 In the second example the array already has two equal elements. 83 84 In the third example applying the operation won't change the array at all, so it is impossible to make some pair of elements equal.