Solution #807bffb4-1a5a-4065-9703-45ea7134392f

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    append = jobs.append
10    for j in raw:
11        if isinstance(j, (list, tuple)) and len(j) == 3:
12            append((j[0], j[1], j[2]))
13    if not jobs:
14        return 0
15
16    jobs.sort(key=lambda x: x[1])
17
18    n = len(jobs)
19    ends = [0] * n
20    for i in range(n):
21        ends[i] = jobs[i][1]
22
23    dp = [0] * (n + 1)
24
25    for i in range(1, n + 1):
26        s, e, w = jobs[i - 1]
27
28        lo = 0
29        hi = i - 1
30        while lo < hi:
31            mid = (lo + hi) >> 1
32            if ends[mid] <= s:
33                lo = mid + 1
34            else:
35                hi = mid
36        if i > 1 and ends[lo] <= s:
37            p = lo + 1
38        elif lo > 0:
39            p = lo
40        else:
41            p = 0
42
43        take = dp[p] + w
44        skip = dp[i - 1]
45        dp[i] = take if take > skip else skip
46
47    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