Solution #6773a310-a5c2-49b6-9ddd-5d203997c99f

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 job in raw:
10        if isinstance(job, (list, tuple)) and len(job) == 3:
11            s, e, w = job
12            jobs.append((s, e, w))
13
14    if not jobs:
15        return 0
16
17    jobs.sort(key=lambda x: x[0])
18
19    starts = [s for s, _, _ in jobs]
20    n = len(jobs)
21    memo = [None] * (n + 1)
22    memo[n] = 0
23
24    def next_index(target):
25        lo, hi = 0, n
26        while lo < hi:
27            mid = (lo + hi) >> 1
28            if starts[mid] < target:
29                lo = mid + 1
30            else:
31                hi = mid
32        return lo
33
34    for i in range(n - 1, -1, -1):
35        s, e, w = jobs[i]
36        j = next_index(e)
37        take = w + memo[j]
38        skip = memo[i + 1]
39        memo[i] = take if take > skip else skip
40
41    return memo[0]

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