Solution #1c204190-5e02-4844-86af-13b0273d4bc6

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 = [(j[0], j[1], j[2]) for j in raw if isinstance(j, (list, tuple)) and len(j) == 3]
9    if not jobs:
10        return 0
11
12    points = sorted({t for s, e, w in jobs for t in (s, e)})
13    m = len(points)
14    index = {t: i for i, t in enumerate(points)}
15
16    buckets = [[] for _ in range(m)]
17    for s, e, w in jobs:
18        buckets[index[e]].append((index[s], w))
19
20    dp = [0] * m
21    best = 0
22    for i in range(m):
23        if i:
24            best = dp[i - 1]
25        cur = best
26        for s_idx, w in buckets[i]:
27            val = dp[s_idx] + w
28            if val > cur:
29                cur = val
30        dp[i] = cur
31
32    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