Solution #66b5ba20-f743-40a8-b91a-2143dbb1c250

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 job in raw:
10        if isinstance(job, (list, tuple)) and len(job) == 3:
11            jobs.append((job[1], job[0], job[2]))  # sort by end, keep (end, start, weight)
12
13    if not jobs:
14        return 0
15
16    jobs.sort()
17    n = len(jobs)
18    ends = [0] * n
19    for i in range(n):
20        ends[i] = jobs[i][0]
21
22    try:
23        from bisect import bisect_right
24    except Exception:
25        def bisect_right(a, x, lo=0, hi=None):
26            if hi is None:
27                hi = len(a)
28            while lo < hi:
29                mid = (lo + hi) >> 1
30                if x < a[mid]:
31                    hi = mid
32                else:
33                    lo = mid + 1
34            return lo
35
36    dp = [0] * (n + 1)
37    for i in range(1, n + 1):
38        e, s, w = jobs[i - 1]
39        j = bisect_right(ends, s, 0, i - 1)
40        take = w + dp[j]
41        skip = dp[i - 1]
42        dp[i] = take if take > skip else skip
43
44    return dp[n]

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