../ Competitive Programming
-rw-r--r--aguang977 B1 min read

Leet Code Daily 2024-05-13 - Score After Flipping Matrix

Solution

Enumerate 2m2^m possible states of toggling columns and for each case, decide the best result per row.

Code

c++
class Solution {
public:
    int matrixScore(vector<vector<int>>& grid) {
        int n = grid.size(), m = grid[0].size();
        vector<int> vals;
        for (int i = 0; i < n; i++) {
            int val = 0;
            for (int j = 0; j < m; j++) {
                val = (val << 1) + grid[i][j];
            }
            vals.push_back(val);
            cout << val << endl;
        }
        int ans = INT_MIN, ones = ((1 << m) - 1);
        for (int mask = 0; mask <= ones; mask++) {
            int sum = 0;
            for (const auto& val : vals) {
                sum += max(val ^ mask, val ^ mask ^ ones);
            }
            ans = max(ans, sum);
        }
        return ans;
    }
};

COMMAND INTERFACE

↑ ↓ navigate · Enter execute · Esc exit · try “whoami”

Loading filesystem…

:help aguang.xyz

A personal website disguised as an operating system.

Ctrl / Cmd + K
Command palette + full-text search
Tab / Shift + Tab
Move between links and controls
Enter
Open a focused link or search result
↑ / ↓ in search
Navigate search results
In a directory filter
Enter/Done or ↓ focuses a result; Esc clears the filter
Esc
Clear a search or close a window