Solution #eaa43c74-9f8f-4c25-817e-b08c479a3044

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[1], j[0], j[2]))  # sort by end: (end, start, weight)
13
14    if not jobs:
15        return 0
16
17    jobs.sort()
18    n = len(jobs)
19
20    ends = [0] * n
21    dp = [0] * (n + 1)
22
23    i = 0
24    while i < n:
25        ends[i] = jobs[i][0]
26        i += 1
27
28    i = 1
29    while i <= n:
30        e, s, w = jobs[i - 1]
31
32        lo = 0
33        hi = i - 1
34        while lo < hi:
35            mid = (lo + hi) >> 1
36            if ends[mid] <= s:
37                lo = mid + 1
38            else:
39                hi = mid
40        p = lo if (i > 1 and ends[lo] <= s) else lo - 1
41
42        take = dp[p + 1] + w
43        skip = dp[i - 1]
44        dp[i] = take if take > skip else skip
45        i += 1
46
47    return dp[n] if dp[n] > 0 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