Solution #a9989ddf-16c2-4cb2-b27f-ba100d1f21f3

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]))  # (end, start, weight)
12    if not jobs:
13        return 0
14
15    jobs.sort()
16
17    from bisect import bisect_right
18
19    frontier_ends = []
20    frontier_vals = []
21
22    for end, start, weight in jobs:
23        i = bisect_right(frontier_ends, start) - 1
24        base = frontier_vals[i] if i >= 0 else 0
25        cand = base + weight
26
27        if frontier_vals and cand <= frontier_vals[-1]:
28            continue
29
30        j = bisect_right(frontier_ends, end)
31        if j < len(frontier_ends):
32            del frontier_ends[j:]
33            del frontier_vals[j:]
34
35        frontier_ends.append(end)
36        frontier_vals.append(cand)
37
38    return frontier_vals[-1] if frontier_vals 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