Disgust Minimization

You have a matrix $A$ with dimensions $N \times N$. Let the *disgust* of the matrix be defined as: $\sum_{i=1}^{N} \sum_{j=1}^{N} (A_{(i, j)} - A_{(j, i)})^2$ You also have $M$ tuples with you. Each tuple consists of $3$ integers $X_i, Y_i,$ ans $Z_i$ $(1\le i \le M)$. In one operation, you can: - Choose an element $(p, q)$ $(1\le p,q \le N)$ such that the value of the element $A_{(p,q)} = X_i