Solution #e2c97ff1-a738-403d-b602-ec4f83c422fc

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[0], j[1], j[2]))
12    if not jobs:
13        return 0
14
15    import bisect
16
17    times = []
18    by_end = {}
19    for s, e, w in jobs:
20        times.append(s)
21        times.append(e)
22        lst = by_end.get(e)
23        if lst is None:
24            by_end[e] = [(s, w)]
25        else:
26            lst.append((s, w))
27
28    times = sorted(set(times))
29    m = len(times)
30    dp = [0] * m
31
32    for i, t in enumerate(times):
33        if i:
34            dp[i] = dp[i - 1]
35        lst = by_end.get(t)
36        if lst:
37            best = dp[i]
38            for s, w in lst:
39                j = bisect.bisect_right(times, s, 0, i) - 1
40                cand = (dp[j] if j >= 0 else 0) + w
41                if cand > best:
42                    best = cand
43            dp[i] = best
44
45    return dp[-1]

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