Solution #5bd2ddd7-b65d-4c44-ae9c-1c92f91c3923

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    ends_set = set()
10    for job in raw:
11        if isinstance(job, (list, tuple)) and len(job) == 3:
12            s, e, w = job
13            jobs.append((s, e, w))
14            ends_set.add(e)
15
16    if not jobs:
17        return 0
18
19    ends = sorted(ends_set)
20    m = len(ends)
21    end_to_idx = {}
22    for i in range(m):
23        end_to_idx[ends[i]] = i
24
25    by_end = [[] for _ in range(m)]
26    for s, e, w in jobs:
27        by_end[end_to_idx[e]].append((s, w))
28
29    dp = [0] * m
30
31    for i in range(m):
32        best = dp[i - 1] if i else 0
33        bucket = by_end[i]
34
35        for s, w in bucket:
36            lo = 0
37            hi = i
38            while lo < hi:
39                mid = (lo + hi) >> 1
40                if ends[mid] <= s:
41                    lo = mid + 1
42                else:
43                    hi = mid
44            cand = w + (dp[lo - 1] if lo else 0)
45            if cand > best:
46                best = cand
47
48        dp[i] = best
49
50    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