Solution #d619fdf3-718a-499a-a9ea-ea80621d7fbe

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    times_set = set()
10
11    for j in raw:
12        if isinstance(j, (list, tuple)) and len(j) == 3:
13            s, e, w = j[0], j[1], j[2]
14            jobs.append((s, e, w))
15            times_set.add(s)
16            times_set.add(e)
17
18    if not jobs:
19        return 0
20
21    times = sorted(times_set)
22    m = len(times)
23    idx = {t: i for i, t in enumerate(times)}
24
25    ends_at = [[] for _ in range(m)]
26    for s, e, w in jobs:
27        ends_at[idx[e]].append((idx[s], w))
28
29    parent = list(range(m + 1))
30    best = [0] * m
31
32    def find(x):
33        while parent[x] != x:
34            parent[x] = parent[parent[x]]
35            x = parent[x]
36        return x
37
38    cur_best = 0
39    i = 0
40    while i < m:
41        if i > 0 and best[i] < cur_best:
42            best[i] = cur_best
43
44        bucket = ends_at[i]
45        j = 0
46        local_best = best[i]
47        while j < len(bucket):
48            s_idx, w = bucket[j]
49            cand = best[s_idx] + w
50            if cand > local_best:
51                local_best = cand
52            j += 1
53
54        if local_best < cur_best:
55            local_best = cur_best
56
57        best[i] = local_best
58        cur_best = local_best
59
60        parent[i] = find(i + 1)
61        i = find(i)
62
63    return cur_best if cur_best > 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