Solution #e89bb3d4-ae34-4cbd-9976-59fcfdbd56af

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