Solution #f23f1e97-6af3-48c1-88be-c5efc1832324

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    times = []
10    for j in raw:
11        if isinstance(j, (list, tuple)) and len(j) == 3:
12            s, e, w = j[0], j[1], j[2]
13            jobs.append((s, e, w))
14            times.append(s)
15            times.append(e)
16    if not jobs:
17        return 0
18
19    times = sorted(set(times))
20    m = len(times)
21
22    time_to_idx = {}
23    for i in range(m):
24        time_to_idx[times[i]] = i
25
26    end_buckets = [[] for _ in range(m)]
27    for s, e, w in jobs:
28        end_buckets[time_to_idx[e]].append((time_to_idx[s], w))
29
30    dp = [0] * m
31    best = 0
32    for i in range(m):
33        cur = best
34        bucket = end_buckets[i]
35        for s_idx, w in bucket:
36            cand = dp[s_idx] + w
37            if cand > cur:
38                cur = cand
39        dp[i] = cur
40        best = cur
41
42    return best

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