Solution #ad9ca75f-3285-435a-8590-f0e57602df0b

1def solve(input):
2    jobs = input.get("jobs", []) if isinstance(input, dict) else []
3    if not jobs:
4        return 0
5
6    jobs = [tuple(job) for job in jobs]
7    jobs.sort(key=lambda x: x[1])
8
9    n = len(jobs)
10    ends = [jobs[i][1] for i in range(n)]
11
12    prev_idx = [-1] * n
13    for i in range(n):
14        s = jobs[i][0]
15        lo, hi = 0, i
16        while lo < hi:
17            mid = (lo + hi) >> 1
18            if ends[mid] <= s:
19                lo = mid + 1
20            else:
21                hi = mid
22        prev_idx[i] = lo - 1
23
24    dp = [0] * (n + 1)
25    for i in range(1, n + 1):
26        w = jobs[i - 1][2]
27        j = prev_idx[i - 1] + 1
28        take = dp[j] + w
29        skip = dp[i - 1]
30        dp[i] = take if take > skip else skip
31
32    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