You are given an integer n and a 0-indexed 2D array queries where queries[i] = [type_i, index_i, val_i].

Initially, there is a 0-indexed n x n matrix filled with 0's. For each query, you must apply one of the following changes:

if type_i == 0, set the values in the row with index_i to val_i, overwriting any previous values.
if type_i == 1, set the values in the column with index_i to val_i, overwriting any previous values.

Return the sum of integers in the matrix after all queries are applied.

Example 1:

Input: n = 3, queries = [[0,0,1],[1,2,2],[0,2,3],[1,0,4]]
Output: 23
Explanation: The image above describes the matrix after each query. The sum of the matrix after all queries are applied is 23.

Example 2:

Input: n = 3, queries = [[0,0,4],[0,1,2],[1,0,1],[0,2,3],[1,2,1]]
Output: 17
Explanation: The image above describes the matrix after each query. The sum of the matrix after all queries are applied is 17.

Constraints:

1 <= n <= 10⁴
1 <= queries.length <= 5 * 10⁴
queries[i].length == 3
0 <= type_i <= 1
0 <= index_i < n
0 <= val_i <= 10⁵

Sum of Matrix After Queries

Problem Description

Problem Description

Answer Panel