Welcome to Subscribe On Youtube
1943. Describe the Painting
Description
There is a long and thin painting that can be represented by a number line. The painting was painted with multiple overlapping segments where each segment was painted with a unique color. You are given a 2D integer array segments
, where segments[i] = [start_{i}, end_{i}, color_{i}]
represents the halfclosed segment [start_{i}, end_{i})
with color_{i}
as the color.
The colors in the overlapping segments of the painting were mixed when it was painted. When two or more colors mix, they form a new color that can be represented as a set of mixed colors.
 For example, if colors
2
,4
, and6
are mixed, then the resulting mixed color is{2,4,6}
.
For the sake of simplicity, you should only output the sum of the elements in the set rather than the full set.
You want to describe the painting with the minimum number of nonoverlapping halfclosed segments of these mixed colors. These segments can be represented by the 2D array painting
where painting[j] = [left_{j}, right_{j}, mix_{j}]
describes a halfclosed segment [left_{j}, right_{j})
with the mixed color sum of mix_{j}
.
 For example, the painting created with
segments = [[1,4,5],[1,7,7]]
can be described bypainting = [[1,4,12],[4,7,7]]
because:[1,4)
is colored{5,7}
(with a sum of12
) from both the first and second segments.[4,7)
is colored{7}
from only the second segment.
Return the 2D array painting
describing the finished painting (excluding any parts that are not painted). You may return the segments in any order.
A halfclosed segment [a, b)
is the section of the number line between points a
and b
including point a
and not including point b
.
Example 1:
Input: segments = [[1,4,5],[4,7,7],[1,7,9]] Output: [[1,4,14],[4,7,16]] Explanation: The painting can be described as follows:  [1,4) is colored {5,9} (with a sum of 14) from the first and third segments.  [4,7) is colored {7,9} (with a sum of 16) from the second and third segments.
Example 2:
Input: segments = [[1,7,9],[6,8,15],[8,10,7]] Output: [[1,6,9],[6,7,24],[7,8,15],[8,10,7]] Explanation: The painting can be described as follows:  [1,6) is colored 9 from the first segment.  [6,7) is colored {9,15} (with a sum of 24) from the first and second segments.  [7,8) is colored 15 from the second segment.  [8,10) is colored 7 from the third segment.
Example 3:
Input: segments = [[1,4,5],[1,4,7],[4,7,1],[4,7,11]] Output: [[1,4,12],[4,7,12]] Explanation: The painting can be described as follows:  [1,4) is colored {5,7} (with a sum of 12) from the first and second segments.  [4,7) is colored {1,11} (with a sum of 12) from the third and fourth segments. Note that returning a single segment [1,7) is incorrect because the mixed color sets are different.
Constraints:
1 <= segments.length <= 2 * 10^{4}
segments[i].length == 3
1 <= start_{i} < end_{i} <= 10^{5}
1 <= color_{i} <= 10^{9}
 Each
color_{i}
is distinct.
Solutions

class Solution { public List<List<Long>> splitPainting(int[][] segments) { TreeMap<Integer, Long> d = new TreeMap<>(); for (int[] e : segments) { int l = e[0], r = e[1], c = e[2]; d.put(l, d.getOrDefault(l, 0L) + c); d.put(r, d.getOrDefault(r, 0L)  c); } List<List<Long>> ans = new ArrayList<>(); long i = 0, j = 0; long cur = 0; for (Map.Entry<Integer, Long> e : d.entrySet()) { if (Objects.equals(e.getKey(), d.firstKey())) { i = e.getKey(); } else { j = e.getKey(); if (cur > 0) { ans.add(Arrays.asList(i, j, cur)); } i = j; } cur += e.getValue(); } return ans; } }

class Solution { public: vector<vector<long long>> splitPainting(vector<vector<int>>& segments) { map<int, long long> d; for (auto& e : segments) { int l = e[0], r = e[1], c = e[2]; d[l] += c; d[r] = c; } vector<vector<long long>> ans; long long i, j, cur = 0; for (auto& it : d) { if (it == *d.begin()) i = it.first; else { j = it.first; if (cur > 0) ans.push_back({i, j, cur}); i = j; } cur += it.second; } return ans; } };

class Solution: def splitPainting(self, segments: List[List[int]]) > List[List[int]]: d = defaultdict(int) for l, r, c in segments: d[l] += c d[r] = c s = sorted([[k, v] for k, v in d.items()]) n = len(s) for i in range(1, n): s[i][1] += s[i  1][1] return [[s[i][0], s[i + 1][0], s[i][1]] for i in range(n  1) if s[i][1]]