CT29740

Tracker's Woven Ledger

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

At the bamboo terraces of Verdantstep, Tracker records each vials in a worn leather ledger. The guild wants answers, not guesses. 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 <= 6703; 0 <= a[i],x <= 1000.

Example 1:

Input: 5124 776 0 0 0 0 0 0 0 1 1 1 2 3 3 3 3 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 6 6 6 6 6 7 7 7 7 7 8 8 8 8 8 8 8 9 9 9 10 10 10 11 11 11 11 12 12 12 12 13 13 13 13 13 14 14 14 15 15 15 15 15 15 15 16 16 16 16 17 17 17 17 17 17 17 17 17 17 17 18 18 18 18 18 18 18 19 19 19 19 19 20 20 20 20 20 20 20 20 20 21 21 21 21 21 21 21 21 21 21 22 22 22 22 23 23 23 23 23 23 24 24 24 24 24 24 24 24 24 25 25 26 26 26 26 26 26 27 27 28 28 28 28 28 29 29 29 30 30 30 31 31 31 31 31 32 32 32 32 32 32 33 33 33 33 33 33 33 33 33 33 33 33 34 34 34 34 35 35 35 35 35 35 35 35 35 36 36 36 36 36 37 37 37 37 37 37 38 38 38 38 39 39 39 39 40 40 40 40 40 40 40 40 40 40 40 41 41 41 41 41 41 41 42 42 42 42 42 42 43 43 43 43 43 43 43 44 44 44 44 44 44 45 45 45 45 46 46 46 46 46 46 47 47 47 47 47 48 48 48 48 49 49 49 49 49 49 50 5…
Output: 3980

Example 2:

Input: 1225 598 2 3 3 4 5 5 5 5 5 6 6 6 7 9 10 11 11 12 12 12 12 14 15 15 15 16 18 18 20 23 25 27 27 27 28 29 30 31 31 31 32 33 35 35 36 36 37 38 39 39 41 41 41 43 43 44 44 44 46 47 47 47 51 54 54 55 55 57 57 58 59 60 62 63 63 63 63 65 65 66 67 67 67 68 70 70 70 71 71 72 72 73 75 78 81 82 82 83 85 85 85 86 87 88 88 89 89 90 90 90 90 91 92 92 93 93 93 95 95 96 96 96 96 97 98 100 100 101 104 104 105 105 107 107 108 108 109 109 111 114 114 114 115 115 116 116 116 117 118 119 119 119 119 122 125 125 125 126 126 126 127 129 129 129 129 131 132 133 133 133 135 135 137 137 138 139 139 139 140 143 144 145 145 145 147 147 149 150 150 150 150 150 151 151 152 154 155 155 157 161 162 162 164 164 164 164 165 165 165 166 167 167 169 169 171 171 173 173 173 174 174 176 177 177 177 177 178 178 178 179 179 180 18…
Output: 735

Example 3:

Input: 3088 105 0 1 2 2 2 2 2 2 2 2 3 3 3 3 3 4 4 4 4 5 6 6 7 7 7 7 7 7 8 9 9 9 10 10 10 11 11 11 11 12 12 12 12 12 13 13 13 14 14 15 15 16 16 17 17 17 17 18 18 18 18 19 19 20 20 20 20 20 20 21 21 21 22 22 22 22 23 23 23 24 24 24 25 25 26 26 27 29 29 29 30 30 31 31 31 31 31 31 31 32 32 32 32 32 32 32 32 33 33 33 33 34 34 34 34 34 34 34 34 34 34 34 35 35 35 36 37 37 37 38 39 39 39 39 39 40 40 41 41 41 41 41 41 42 42 42 42 42 43 43 43 43 43 45 46 46 46 46 47 48 48 48 48 48 49 49 49 49 49 50 51 51 51 51 51 52 52 52 52 52 53 53 53 54 54 54 54 54 54 54 54 55 55 55 55 56 56 56 57 57 57 57 57 58 58 58 58 59 59 60 61 61 61 61 62 63 63 63 64 64 64 65 66 66 66 66 66 67 67 67 68 69 69 69 70 70 71 71 71 71 71 72 72 72 72 73 73 73 73 74 74 74 75 75 76 76 76 77 78 79 79 79 79 80 80 81 81 81 81 82 82 82 82 83 8…
Output: 363

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.