Solution #a6d53a91-ca54-4200-bcef-b6b05a13c40f

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    jobs.sort(key=lambda x: x[0])
16    n = len(jobs)
17    starts = [jobs[i][0] for i in range(n)]
18
19    import functools
20
21    def lower_bound(x):
22        lo, hi = 0, n
23        while lo < hi:
24            mid = (lo + hi) >> 1
25            if starts[mid] < x:
26                lo = mid + 1
27            else:
28                hi = mid
29        return lo
30
31    next_idx = [0] * n
32    for i in range(n):
33        next_idx[i] = lower_bound(jobs[i][1])
34
35    @functools.lru_cache(None)
36    def dp(i):
37        if i >= n:
38            return 0
39        skip = dp(i + 1)
40        take = jobs[i][2] + dp(next_idx[i])
41        return take if take > skip else skip
42
43    return dp(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