Solution #8ec51433-637a-4837-ab1e-ee77be84a3b8

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