Solution #3d4c689e-5da1-4d54-83a7-ca9b3250d5c0

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[1])
7
8    def bisect_right(a, x, hi):
9        lo = 0
10        while lo < hi:
11            mid = (lo + hi) // 2
12            if a[mid] <= x:
13                lo = mid + 1
14            else:
15                hi = mid
16        return lo
17
18    def step(state, job):
19        ends, dp = state
20        s, e, w = job
21        idx = bisect_right(ends, s, len(ends))
22        best = dp[-1] if dp else 0
23        take = w + (dp[idx - 1] if idx else 0)
24        return (ends + [e], dp + [take if take > best else best])
25
26    _, dp = __import__("functools").reduce(step, jobs, ([], []))
27    return dp[-1] if dp else 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