Ezvor

1183. Maximum Number of Ones

HardMath Preparing judge… LeetCode
MathGreedySortingHeap (Priority Queue)

Hints

Hint 1
Think of a greedy mathematical solution.
Hint 2
Say you choose to set some cell (i, j) to 1, all cells (x, y) such that i % sideLength == x % sideLength and j % sideLength == y % sideLength can also be set to 1 without increasing the max number of ones in a sub-matrix.
Hint 3
In one move, choose to set all the cells with some modulus (i % sideLength, j % sideLength) to 1.
Hint 4
Choose the cells with max frequency.