Solution #58b73178-c67d-47f9-bd28-6d8c33fe6b26

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 = tuple(filter(lambda j: isinstance(j, (list, tuple)) and len(j) == 3, raw))
9    if not jobs:
10        return 0
11
12    items = tuple(sorted(map(lambda j: (j[1], j[0], j[2]), jobs)))
13    ends = tuple(map(lambda x: x[0], items))
14
15    try:
16        from bisect import bisect_right
17    except Exception:
18        def bisect_right(a, x, lo=0, hi=None):
19            if hi is None:
20                hi = len(a)
21            while lo < hi:
22                mid = (lo + hi) >> 1
23                if x < a[mid]:
24                    hi = mid
25                else:
26                    lo = mid + 1
27            return lo
28
29    def rec(i, memo={}):
30        if i <= 0:
31            return 0
32        if i in memo:
33            return memo[i]
34        e, s, w = items[i - 1]
35        j = bisect_right(ends, s, 0, i - 1)
36        a = rec(i - 1, memo)
37        b = w + rec(j, memo)
38        memo[i] = a if a > b else b
39        return memo[i]
40
41    return rec(len(items), {})

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