Solution #3277469d-afb6-4f98-99fc-b48cc79be71b

1def solve(input):
2    jobs = input.get("jobs", []) if isinstance(input, dict) else []
3    if not jobs:
4        return 0
5
6    times = {}
7    idx = 0
8    normalized = []
9    for job in jobs:
10        s, e, w = job
11        normalized.append((s, e, w))
12        if s not in times:
13            times[s] = 0
14        if e not in times:
15            times[e] = 0
16
17    sorted_times = sorted(times)
18    for i, t in enumerate(sorted_times):
19        times[t] = i
20
21    m = len(sorted_times)
22    end_buckets = [[] for _ in range(m)]
23    for s, e, w in normalized:
24        end_buckets[times[e]].append((times[s], w))
25
26    dp = [0] * m
27    best = 0
28    for i in range(m):
29        if i > 0 and dp[i - 1] > best:
30            best = dp[i - 1]
31        cur = best
32        for s_idx, w in end_buckets[i]:
33            candidate = (dp[s_idx] if s_idx >= 0 else 0) + w
34            if candidate > cur:
35                cur = candidate
36        dp[i] = cur
37
38    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