2023-07-15 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge

Today I have done leetcode's July LeetCoding Challenge with cpp.

July LeetCoding Challenge 15

Description

Maximum Number of Events That Can Be Attended II

You are given an array of events where events[i] = [startDayi, endDayi, valuei]. The ith event starts at startDayi and ends at endDayi, and if you attend this event, you will receive a value of valuei. You are also given an integer k which represents the maximum number of events you can attend.

You can only attend one event at a time. If you choose to attend an event, you must attend the entire event. Note that the end day is inclusive: that is, you cannot attend two events where one of them starts and the other ends on the same day.

Return the maximum sum of values that you can receive by attending events.

 

Example 1:

Input: events = [[1,2,4],[3,4,3],[2,3,1]], k = 2
Output: 7
Explanation: Choose the green events, 0 and 1 (0-indexed) for a total value of 4 + 3 = 7.

Example 2:

Input: events = [[1,2,4],[3,4,3],[2,3,10]], k = 2
Output: 10
Explanation: Choose event 2 for a total value of 10.
Notice that you cannot attend any other event as they overlap, and that you do not have to attend k events.

Example 3:

Input: events = [[1,1,1],[2,2,2],[3,3,3],[4,4,4]], k = 3
Output: 9
Explanation: Although the events do not overlap, you can only attend 3 events. Pick the highest valued three.

 

Constraints:

  • 1 <= k <= events.length
  • 1 <= k * events.length <= 106
  • 1 <= startDayi <= endDayi <= 109
  • 1 <= valuei <= 106

Solution

class Solution {
public:
  int maxValue(vector<vector<int>>& events, int k) {
    int len = events.size();
    vector<int> index(len);
    for(int i = 0; i < len; ++i) index[i] = i;
    sort(index.begin(), index.end(), [&](int a, int b) {
      return events[a][1] < events[b][1];
    });
    vector<int> dp(len);
    vector<int> compatible(len, -1);
    for(int i = 0; i < len; ++i) {
      for(int j = i - 1; j >= 0; --j) {
        if(events[index[j]][1] < events[index[i]][0]) {
          compatible[i] = j;
          break;
        }
      }
    }

    int answer = 0;
    for(int i = 0; i < len; ++i) dp[i] = events[index[i]][2];
    for(int i = 1; i < k; ++i) {
      for(int j = len-1; j >= 0; --j) {
        if(compatible[j] != -1) {
          for(int pos = compatible[j]; pos >= 0; --pos) {
            dp[j] = max(dp[j], dp[pos] + events[index[j]][2]);
          }
          
        }
      }
    }
    return *max_element(dp.begin(), dp.end());
  }
};

// Accepted
// 67/67 cases passed (314 ms)
// Your runtime beats 82.15 % of cpp submissions
// Your memory usage beats 98.26 % of cpp submissions (51.6 MB)
Algorithm