Solution #c4c348af-c13d-4e66-befe-390be750208c

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 = tuple(filter(lambda j: isinstance(j, (list, tuple)) and len(j) == 3, raw))
9    if not jobs:
10        return 0
11
12    times = sorted(set(map(lambda j: j[0], jobs)) | set(map(lambda j: j[1], jobs)))
13    idx = dict(zip(times, range(len(times))))
14
15    groups = {}
16    tuple(map(lambda j: groups.setdefault(idx[j[1]], []).append((idx[j[0]], j[2])), jobs))
17
18    dp = [0] * len(times)
19    tuple(map(lambda i: dp.__setitem__(i, max(dp[i - 1] if i else 0, max(map(lambda sw: dp[sw[0]] + sw[1], groups.get(i, ())), default=0))), range(len(times))))
20
21    return dp[-1] if dp 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