CPMagical CP Library

Problem solution · C++

Maximum Bitwise and After Increment Operations

Maximum Bitwise and After Increment Operations: a C++ solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Sorting and greedy selection
Source
Kamyu LeetCode Solutions
Length
51 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sorting and greedy selection

For Maximum Bitwise and After Increment Operations, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 51 lines of C++ from the credited upstream file maximum-bitwise-and-after-increment-operations.cpp.
  • The implementation visibly relies on sequence storage.
  • 4 loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeMaximum Bitwise and After Increment Operations · C++C++
Use this to learn the idea, then write your own version.
// Time:  O(nlogr)// Space: O(n) // bitmasks, greedy, quick selectclass Solution {public:    int maximumAND(vector<int>& nums, int k, int m) {        int result = 0;        for (int i = bit_width(static_cast<uint32_t>(ranges::max(nums) + k)) - 1; i >= 0; --i) {            const auto& target = result | (1 << i);            vector<int> costs;            costs.reserve(size(nums));            for (const auto& x : nums) {                const auto& l = bit_width(static_cast<uint32_t>(target & ~x));                const auto& mask = (1ll << l) - 1;                costs.emplace_back((target & mask) - (x & mask));            }            ranges::nth_element(costs, begin(costs) + (m - 1));            if (accumulate(cbegin(costs), cbegin(costs) + m, 0ll) <= k) {                result |= 1 << i;            }        }        return result;    }}; // Time:  O(nlogn * logr)// Space: O(n)// bitmasks, greedy, sortclass Solution2 {public:    int maximumAND(vector<int>& nums, int k, int m) {        int result = 0;        for (int i = bit_width(static_cast<uint32_t>(ranges::max(nums) + k)) - 1; i >= 0; --i) {            const auto& target = result | (1 << i);            vector<int> costs;            costs.reserve(size(nums));            for (const auto& x : nums) {                const auto& l = bit_width(static_cast<uint32_t>(target & ~x));                const auto& mask = (1ll << l) - 1;                costs.emplace_back((target & mask) - (x & mask));            }            ranges::sort(costs);            if (accumulate(cbegin(costs), cbegin(costs) + m, 0ll) <= k) {                result |= 1 << i;            }        }        return result;    }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗