Solution #b9b05796-90a9-40e0-9055-4e85956ba038

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[1])
16
17    best_ends = [jobs[0][1]]
18    best_vals = [max(0, jobs[0][2])]
19
20    for i in range(1, len(jobs)):
21        s, e, w = jobs[i]
22
23        lo, hi = 0, len(best_ends)
24        while lo < hi:
25            mid = (lo + hi) >> 1
26            if best_ends[mid] <= s:
27                lo = mid + 1
28            else:
29                hi = mid
30        prev_best = best_vals[lo - 1] if lo else 0
31        cand = prev_best + w
32        cur_best = best_vals[-1]
33        if cand > cur_best:
34            if e == best_ends[-1]:
35                best_vals[-1] = cand
36            else:
37                best_ends.append(e)
38                best_vals.append(cand)
39
40    import functools
41
42    @functools.lru_cache(None)
43    def ans(i):
44        return best_vals[i]
45
46    return ans(len(best_vals) - 1) if best_vals else 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