Distance Multiplier

You have a **simple weighted complete undirected** graph on a vertex set with $N$ vertices, numbered $1$ to $N$. The weights follow a special property as described below. You are given an array $A$ of size $N$ ($1 \le A_i \le 20$), and the weight of the edge joining vertices $X$ and $Y$ can be described as follows: - If $A_X = A_Y$, the weight is $|X - Y|$ - If $A_X \ne A_Y$, the weight is $2 \c