Solution #aab82514-b0a3-46d1-a269-daeec40c39cb

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    starts_set = set()
10    ends_set = set()
11
12    for j in raw:
13        if isinstance(j, (list, tuple)) and len(j) == 3:
14            s, e, w = j
15            valid.append((s, e, w))
16            starts_set.add(s)
17            ends_set.add(e)
18
19    if not valid:
20        return 0
21
22    times = sorted(starts_set | ends_set)
23    m = len(times)
24    index = {}
25    for i, t in enumerate(times):
26        index[t] = i
27
28    start_to_jobs = [[] for _ in range(m)]
29    end_here = [0] * m
30
31    for s, e, w in valid:
32        si = index[s]
33        ei = index[e]
34        start_to_jobs[si].append((ei, w))
35        if end_here[ei] < 0:
36            end_here[ei] = 0
37
38    dp = [0] * (m + 1)
39
40    for i in range(m):
41        cur = dp[i]
42        if cur > dp[i + 1]:
43            dp[i + 1] = cur
44
45        jobs_at_start = start_to_jobs[i]
46        if jobs_at_start:
47            for ei, w in jobs_at_start:
48                val = cur + w
49                nxt = ei + 1
50                if val > dp[nxt]:
51                    dp[nxt] = val
52
53    best = 0
54    for v in dp:
55        if v > best:
56            best = v
57    return best

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