CT32668

The Grapehollow Shelf Position

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

Legend says the vault under the terraced vines of Grapehollow opens only for a perfect tally of vials. Jatin means to find out. Task: The array is sorted in non-decreasing order. Print the 1-based index of the first occurrence of x, or -1 if x is absent. Input format: First line: n and x. Second line: n sorted integers. Output format: Print the 1-based index or -1. Constraints: 1 <= n <= 9453; 0 <= a[i],x <= 1000.

Example 1:

Input: 7868 438 0 0 0 0 0 1 1 1 1 2 3 3 3 3 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 8 8 8 8 8 8 8 8 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 11 11 11 11 12 12 12 12 12 12 13 13 13 13 13 13 13 13 13 14 14 14 14 14 14 14 14 14 14 14 15 15 15 15 16 16 16 16 16 17 17 17 17 17 17 17 17 17 17 18 18 18 18 18 18 18 18 18 18 18 19 19 19 20 20 20 20 20 20 20 20 20 20 20 20 20 20 21 21 21 21 21 21 21 22 22 22 22 22 22 22 22 22 22 22 22 22 23 23 23 23 23 23 23 23 23 23 23 23 23 23 23 23 23 24 24 24 24 24 24 24 24 25 25 25 25 25 25 25 25 25 25 26 26 26 26 26 26 26 26 26 26 26 26 27 27 27 27 27 27 27 27 28 28 28 28 28 28 28 28 28 28 29 29 29 29 29 29 29 29 29 29 30 30 30 30 30 30 31 31 31 32 32 32 32 32 32 33 33 33 33 33 33 33 33 33 33 33 34 34 34 34 34 34 35 35 35 35 35 35 36 36 3…
Output: 3420

Example 2:

Input: 4915 354 0 0 0 0 0 1 1 1 1 1 1 1 1 2 3 3 3 3 3 3 3 4 4 4 5 5 5 6 6 6 6 6 6 6 6 7 7 7 8 8 8 8 9 9 9 9 9 10 10 10 10 10 11 11 11 11 11 11 11 12 12 12 12 12 13 13 13 13 14 14 14 14 14 14 15 15 15 16 16 16 17 17 17 18 18 18 18 18 19 19 19 20 20 20 20 20 21 21 21 21 21 22 22 22 22 22 22 23 23 23 23 24 24 24 24 24 24 24 25 25 25 25 26 26 26 26 27 27 27 27 28 28 28 28 28 28 29 29 29 29 29 29 30 30 30 30 30 30 30 31 31 31 32 32 32 32 32 33 33 33 33 34 34 34 34 35 35 35 35 36 36 36 36 36 36 36 36 37 37 37 38 40 40 40 40 40 40 40 40 40 40 41 41 41 42 42 42 42 42 42 43 43 43 44 44 44 44 44 44 45 45 45 45 45 46 46 46 46 47 47 47 47 47 48 48 48 48 48 48 49 49 49 49 49 50 50 50 50 51 51 52 52 52 53 53 54 54 55 55 55 55 56 56 56 56 57 57 57 57 57 57 57 58 58 58 59 59 59 59 59 59 59 59 60 60 60 60 60 61 6…
Output: 1720

Example 3:

Input: 1155 786 0 0 1 2 3 4 4 4 5 5 6 7 8 8 10 11 12 15 17 18 20 21 22 23 24 24 24 25 25 27 28 29 30 30 31 32 33 33 33 33 34 34 37 38 38 40 40 41 41 43 44 45 47 48 49 50 51 53 53 54 54 55 55 55 56 59 59 59 62 62 63 64 65 65 66 66 67 67 67 68 69 69 70 71 72 72 73 74 75 76 76 76 77 78 79 80 80 80 81 81 81 82 82 83 84 84 84 85 87 88 89 90 91 93 94 94 94 95 95 97 97 99 103 105 107 107 107 107 109 109 110 110 110 110 110 112 112 114 115 116 117 119 119 120 121 121 121 122 124 124 126 126 128 129 129 131 131 134 137 138 138 138 139 140 141 141 142 142 143 144 145 146 147 148 148 150 150 151 152 152 154 154 154 157 157 159 159 159 160 160 160 161 161 163 165 166 166 167 168 168 168 173 174 176 176 177 177 177 178 178 180 181 182 183 184 185 186 188 190 191 191 192 193 193 194 194 195 197 198 200 200 201…
Output: -1

Constraints:

1 <= n <= 9453; 0 <= a[i],x <= 1000.

Loading...
Test Cases:No test cases
No test cases available.
The Grapehollow Shelf Position - MEDIUM Coding Problem | CodeTikki