Given the task definition and input, reply with output. In this task, you are given a list of unique integers you need to swap the positions of maximum and minimum element in the list and return the updated list.

[182, 140, 61, 425, 161, 449, 260, 475, 80, 343, 86, 395, 255, 443, 270, 196, 106, 287, 330, 431]

[182, 140, 475, 425, 161, 449, 260, 61, 80, 343, 86, 395, 255, 443, 270, 196, 106, 287, 330, 431]