Solution #2db3327f-0f78-40f5-b207-8d844c855dfc

1def solve(input):
2    jobs = input.get("jobs", []) if isinstance(input, dict) else []
3    if not jobs:
4        return 0
5
6    valid = []
7    for job in jobs:
8        if isinstance(job, (list, tuple)) and len(job) == 3:
9            s, e, w = job
10            valid.append((s, e, w))
11
12    if not valid:
13        return 0
14
15    valid.sort(key=lambda x: (x[0], x[1], x[2]))
16
17    heap = []  # min-heap of (end, total_weight_if_taken)
18    best_done = 0
19
20    def heappush(h, item):
21        h.append(item)
22        i = len(h) - 1
23        while i > 0:
24            p = (i - 1) // 2
25            if h[p][0] <= item[0]:
26                break
27            h[i] = h[p]
28            i = p
29        h[i] = item
30
31    def heappop(h):
32        root = h[0]
33        last = h.pop()
34        if h:
35            i = 0
36            n = len(h)
37            while True:
38                l = 2 * i + 1
39                r = l + 1
40                if l >= n:
41                    break
42                c = l
43                if r < n and h[r][0] < h[l][0]:
44                    c = r
45                if h[c][0] >= last[0]:
46                    break
47                h[i] = h[c]
48                i = c
49            h[i] = last
50        return root
51
52    for s, e, w in valid:
53        while heap and heap[0][0] <= s:
54            ended, total = heappop(heap)
55            if total > best_done:
56                best_done = total
57        heappush(heap, (e, best_done + w))
58
59    ans = best_done
60    while heap:
61        ended, total = heappop(heap)
62        if total > ans:
63            ans = total
64
65    return ans

1def solve(input):
2    if not isinstance(input, dict):
3        return 0
4    raw = input.get("jobs")
5    if not raw:
6        return 0
7
8    jobs = []
9    for j in raw:
10        if isinstance(j, (list, tuple)) and len(j) == 3:
11            jobs.append((j[1], j[0], j[2]))  # sort by end, store as (end, start, weight)
12    if not jobs:
13        return 0
14
15    jobs.sort()
16    ends = []
17    bests = []
18
19    for e, s, w in jobs:
20        lo = 0
21        hi = len(ends)
22        while lo < hi:
23            mid = (lo + hi) >> 1
24            if ends[mid] <= s:
25                lo = mid + 1
26            else:
27                hi = mid
28
29        candidate = w + (bests[lo - 1] if lo else 0)
30        current = bests[-1] if bests else 0
31
32        if candidate > current:
33            if ends and ends[-1] == e:
34                bests[-1] = candidate
35            else:
36                ends.append(e)
37                bests.append(candidate)
38
39    return bests[-1] if bests else 0