Solution #df1d6fd3-a55f-4ecb-86e0-13066201d16b

1def solve(input):
2    jobs = input.get("jobs", [])
3    if not jobs:
4        return 0
5
6    events = []
7    for s, e, w in jobs:
8        events.append((e, 1, s, w))  # end event
9        events.append((s, 0, 0, 0))  # start time marker
10
11    events.sort()
12
13    best_at_time = 0
14    best_before = {}
15    last_time = None
16
17    for time, typ, s, w in events:
18        if last_time is not None and time != last_time and last_time not in best_before:
19            best_before[last_time] = best_at_time
20
21        if typ == 0:
22            if time not in best_before:
23                best_before[time] = best_at_time
24        else:
25            candidate = best_before.get(s, 0) + w
26            if candidate > best_at_time:
27                best_at_time = candidate
28
29        last_time = time
30
31    return best_at_time

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