Solution #b0db1966-5a00-40b7-97ee-7abbc3185464

1def solve(input):
2    jobs = input.get("jobs", [])
3    if not jobs:
4        return 0
5
6    jobs = sorted((s, e, w) for s, e, w in jobs)
7    n = len(jobs)
8    starts = [s for s, _, _ in jobs]
9
10    next_idx = [n] * n
11    for i in range(n):
12        target = jobs[i][1]
13        lo, hi = i + 1, n
14        while lo < hi:
15            mid = (lo + hi) // 2
16            if starts[mid] < target:
17                lo = mid + 1
18            else:
19                hi = mid
20        next_idx[i] = lo
21
22    dp = [0] * (n + 1)
23    for i in range(n - 1, -1, -1):
24        take = jobs[i][2] + dp[next_idx[i]]
25        skip = dp[i + 1]
26        dp[i] = take if take > skip else skip
27
28    return dp[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