Solution #7d579923-0e58-45f4-8271-f49fbd5b2fc4

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    append = jobs.append
10    for j in raw:
11        if isinstance(j, (list, tuple)) and len(j) == 3:
12            append((j[1], j[0], j[2]))  # (end, start, weight)
13
14    if not jobs:
15        return 0
16
17    jobs.sort()
18
19    import bisect
20
21    frontier_ends = [0]
22    frontier_vals = [0]
23
24    for e, s, w in jobs:
25        idx = bisect.bisect_right(frontier_ends, s) - 1
26        cand = frontier_vals[idx] + w
27
28        if cand <= frontier_vals[-1]:
29            continue
30
31        pos = bisect.bisect_left(frontier_ends, e)
32        if pos < len(frontier_ends) and frontier_ends[pos] == e:
33            if cand <= frontier_vals[pos]:
34                continue
35            frontier_vals[pos] = cand
36            pos += 1
37        else:
38            frontier_ends.insert(pos, e)
39            frontier_vals.insert(pos, cand)
40            pos += 1
41
42        while pos < len(frontier_vals) and frontier_vals[pos] <= cand:
43            del frontier_vals[pos]
44            del frontier_ends[pos]
45
46    return frontier_vals[-1]

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