CT31658

The crates at Emberfall

MediumL4 · Loop LordAcceptance: 0.0%XP: 35

In the port of Emberfall, Cobbler the factor keeps careful count of the crates. assign crews to the morning shifts, every figure matters. 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 <= 10619; 0 <= a[i],x <= 1000.

Example 1:

Input: 2846 654 0 1 2 2 2 2 2 2 3 3 3 3 3 4 4 5 5 6 6 6 7 8 8 8 8 9 9 10 10 10 10 11 11 11 12 12 12 12 13 13 13 13 13 14 14 15 15 15 16 17 17 17 18 18 18 19 19 19 19 19 19 20 21 21 21 22 22 22 22 22 23 24 24 24 24 24 25 26 26 26 27 27 28 28 29 29 29 29 30 30 30 30 31 32 33 33 34 35 35 36 36 36 36 36 37 37 37 37 38 38 39 40 40 41 41 41 41 41 42 42 42 42 43 43 44 44 45 45 46 46 46 47 47 47 47 48 48 49 49 49 49 50 50 51 52 52 53 53 53 56 56 56 56 56 56 57 59 60 60 61 61 62 63 63 63 63 64 64 65 66 66 66 67 67 67 67 67 67 68 68 68 69 70 70 70 71 72 72 73 73 74 74 74 74 75 76 76 76 76 76 76 76 76 76 76 76 77 77 77 77 77 77 78 78 79 79 79 79 80 80 80 80 80 81 81 82 83 83 83 83 83 84 84 84 84 85 86 86 86 86 86 86 86 87 87 87 88 88 88 89 89 90 90 91 92 92 93 93 93 93 93 94 94 94 95 95 95 95 96 96 96 97 97…
Output: 1873

Example 2:

Input: 2615 293 0 0 0 0 1 1 1 1 2 3 3 3 4 4 4 4 6 6 7 8 8 9 9 10 11 11 11 11 11 12 12 12 12 12 12 12 13 14 15 15 15 16 16 16 17 17 17 17 18 18 18 18 18 19 19 19 19 20 20 20 21 22 22 23 23 23 23 23 23 23 23 24 25 25 25 26 26 27 27 27 27 27 29 29 29 29 29 30 30 30 31 33 33 33 34 34 34 34 35 35 35 36 36 36 36 37 37 37 37 38 40 41 41 41 41 43 44 44 44 44 45 45 46 46 46 46 47 47 47 47 48 48 49 50 50 50 51 52 52 52 52 52 52 52 53 54 55 55 55 57 57 57 58 58 58 59 59 59 60 60 61 61 61 61 62 62 62 62 63 63 63 63 64 64 64 64 65 65 66 66 67 67 67 68 68 68 68 69 69 69 70 71 71 71 72 72 72 72 72 73 73 73 73 73 74 74 74 74 74 74 74 74 75 76 76 77 77 77 77 78 78 78 79 79 79 79 79 79 80 80 81 81 81 81 81 82 83 84 84 85 85 85 85 85 86 86 86 87 87 87 87 88 88 89 90 90 90 90 91 91 91 91 91 91 91 91 92 92 93 93 93 9…
Output: 762

Example 3:

Input: 2392 76 0 0 1 1 2 2 3 3 3 3 4 4 5 5 5 6 7 8 8 9 9 9 10 11 11 12 12 13 13 13 14 14 14 14 15 15 15 16 17 17 17 18 18 19 19 19 20 20 21 21 22 22 22 22 22 23 23 24 25 25 25 26 26 26 27 27 27 28 28 28 28 29 29 30 30 31 31 31 31 31 32 32 32 32 33 34 34 35 35 36 37 37 38 38 38 38 39 40 41 41 42 42 43 43 43 43 43 44 44 44 44 45 45 46 46 49 49 51 52 52 53 53 54 54 55 55 56 56 56 58 59 59 59 59 59 60 61 61 61 61 61 62 62 63 63 63 64 64 64 65 66 66 67 67 68 68 69 69 70 70 71 71 71 73 73 73 74 75 75 75 76 77 77 77 77 77 77 78 78 78 79 80 80 81 81 81 83 83 83 84 84 84 84 85 85 85 85 86 86 87 87 87 87 87 88 88 89 90 91 91 92 92 92 92 93 93 93 94 94 96 97 98 99 99 100 100 100 100 100 101 101 103 104 104 104 105 105 105 106 106 107 107 107 109 109 109 109 109 110 111 112 112 114 115 115 115 116 117 117 11…
Output: 171

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The crates at Emberfall - MEDIUM Coding Problem | CodeTikki