Solution #92b8345a-ab5e-4ec6-8b09-a7b6cbfa9145

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 = [j for j in raw if isinstance(j, (list, tuple)) and len(j) == 3]
9    if not jobs:
10        return 0
11
12    jobs.sort(key=lambda x: x[1])
13    n = len(jobs)
14    ends = [j[1] for j in jobs]
15    dp = [0] * (n + 1)
16
17    for i in range(1, n + 1):
18        s, e, w = jobs[i - 1]
19        lo, hi = 0, i - 1
20        while lo < hi:
21            mid = (lo + hi + 1) >> 1
22            if ends[mid - 1] <= s:
23                lo = mid
24            else:
25                hi = mid - 1
26        take = dp[lo] + w
27        skip = dp[i - 1]
28        dp[i] = take if take > skip else skip
29
30    return dp[n]

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