【Leetcode】2661. First Completely Painted Row or Column

题目地址：

https://leetcode.com/problems/first-completely-painted-row-or-column/description/

给定一个$m\times n$矩阵$A$和一个长$m\times n$的数组$a$，都含$1\sim mn$的所有数。遍历$a$的同时将$A$中的$a[i]$这个数涂色，问第一次将某一行或者列涂满的最小的$i$。

代码如下：

class Solution {
 public:
  using PII = pair<int, int>;
  int firstCompleteIndex(vector<int>& a, vector<vector<int>>& M) {
    int m = M.size(), n = M[0].size();
    unordered_map<int, PII> mp;
    for (int i = 0; i < m; i++)
      for (int j = 0; j < n; j++) mp[M[i][j]] = {i, j};
    unordered_map<int, int> row_cnt, col_cnt;
    for (int i = 0; i < a.size(); i++) {
      auto &[x, y] = mp[a[i]];
      if (++row_cnt[x] == n || ++col_cnt[y] == m) return i;
    }
    return -1;
  }
};

时空复杂度$O(mn)$。