1
class Solution {
2
 public:
3
  int numSpecial(vector<vector<int>> &mat) {
4
    vector<vector<int>> v;
5
    map<int, vector<int>> m;
6

7
    for (int i = 0; i < mat.size(); i++) {
8
      vector<int> temp = mat[i];
9

10
      for (int j = 0; j < temp.size(); j++) {
11
        m[j].push_back(temp[j]);
12
      }
13
    }
14
    for (auto i : m) {
15
      v.push_back(i.second);
16
    }
17
    int counter = 0;
18
    for (int i = 0; i < mat.size(); i++) {
19
      int onecount = 0;
20
      int column = 0;
21
      for (int j = 0; j < mat[i].size(); j++) {
22
        if (mat[i][j] == 1) {
23
          column = j;
24
          onecount++;
25
        }
26
      }
27
      if (onecount == 1) {
28
        int countone = 0;
29
        vector<int> temp = v[column];
30
        for (auto i : temp) {
31
          if (i == 1) {
32
            countone++;
33
          }
34
        }
35
        if (countone == 1) {
36
          counter++;
37
        }
38
      }
39
    }
40
    return counter;
41
  }
42
};