You are given an integer n and a $2$D integer array queries where each query is represented as queries[i] = [type_i, index_i, val_i].

Initially, there is a matrix of size n $ imes$ n with all elements set to $0$.

For each query:

• If type_i $= 0$, set every element in row index_i to val_i, overwriting any existing values.

• If type_i $= 1$, set every element in column index_i to val_i, overwriting any existing values.

Return the total sum of all elements in the matrix after processing all queries.

Constraints:

• $1 \leq$ n $\leq 10^4$

• $1 \leq$ queries.length $\leq 5 imes 10^4$

• queries[i].length $= 3$

• $0 \leq$ type_i $\leq 1$

• $0 \leq$ index_i $<$ n

• $0 \leq$ val_i $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.