Solution #eef58d00-d96c-4441-9077-ef477d9f9264

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            s, e, w = job
12            jobs.append((s, e, w))
13
14    if not jobs:
15        return 0
16
17    jobs.sort(key=lambda x: (x[1], x[0], x[2]))
18
19    states_end = [float("-inf")]
20    states_val = [0]
21
22    for s, e, w in jobs:
23        lo, hi = 0, len(states_end)
24        while lo < hi:
25            mid = (lo + hi) // 2
26            if states_end[mid] <= s:
27                lo = mid + 1
28            else:
29                hi = mid
30        base = states_val[lo - 1]
31        cand = base + w
32
33        if cand <= states_val[-1]:
34            continue
35
36        if e == states_end[-1]:
37            states_val[-1] = cand
38            continue
39
40        states_end.append(e)
41        states_val.append(cand)
42
43    return states_val[-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