3SUM

def find_three_values(n, x, arr):
    # Create a list of tuples (value, index) for easy tracking of indices
    indexed_arr = [(arr[i], i + 1) for i in range(n)]
    
    # Sort the array based on values
    indexed_arr.sort()
    
    # Iterate over each element, and for each element use two pointers
    for i in range(n):
        target_sum = x - indexed_arr[i][0]
        left, right = i + 1, n - 1
        
        while left < right:
            current_sum = indexed_arr[left][0] + indexed_arr[right][0]
            
            if current_sum == target_sum:
                # Return the 1-based indices
                return indexed_arr[i][1], indexed_arr[left][1], indexed_arr[right][1]
            elif current_sum < target_sum:
                left += 1
            else:
                right -= 1
    
    # If no solution found
    return "IMPOSSIBLE"

# Example input
n = 4
x = 8
arr = [2, 7, 5, 1]

find_three_values(n, x, arr)

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER