Solution #f0509416-80c0-4ae5-807f-6f96deb8c8c6

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[0])
8
9    n = len(jobs)
10    starts = [0] * n
11    ends = [0] * n
12    weights = [0] * n
13    for i, (s, e, w) in enumerate(jobs):
14        starts[i] = s
15        ends[i] = e
16        weights[i] = w
17
18    order_by_end = sorted(range(n), key=lambda i: ends[i])
19
20    dp = [0] * n
21    best_finished = 0
22    p = 0
23
24    for i in range(n):
25        s = starts[i]
26        while p < n and ends[order_by_end[p]] <= s:
27            j = order_by_end[p]
28            if dp[j] > best_finished:
29                best_finished = dp[j]
30            p += 1
31
32        take = best_finished + weights[i]
33        skip = dp[i - 1] if i > 0 else 0
34        dp[i] = take if take > skip else skip
35
36    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