Solution #9462a7c0-e191-4f7c-94c8-f3300563e6a1

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    jobs = sorted(map(tuple, jobs), key=lambda x: (x[1], x[0], x[2]))
13    ends = tuple(map(lambda x: x[1], jobs))
14
15    def br(a, x, hi):
16        lo = 0
17        while lo < hi:
18            mid = (lo + hi) >> 1
19            if a[mid] <= x:
20                lo = mid + 1
21            else:
22                hi = mid
23        return lo
24
25    def step(state, job):
26        dp = state
27        s, e, w = job
28        i = br(ends, s, len(dp))
29        take = w + dp[i]
30        best = take if take > dp[-1] else dp[-1]
31        return dp + (best,)
32
33    return __import__("functools").reduce(step, jobs, (0,))[-1]

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