Solution #ce0d4fdb-e3b8-4689-9cee-eb1228e2983b

1def solve(input):
2    jobs = input.get("jobs", []) if isinstance(input, dict) else []
3    if not jobs:
4        return 0
5
6    norm = []
7    times = set()
8    for job in jobs:
9        if not isinstance(job, (list, tuple)) or len(job) != 3:
10            continue
11        s, e, w = job
12        norm.append((s, e, w))
13        times.add(s)
14        times.add(e)
15
16    if not norm:
17        return 0
18
19    coords = sorted(times)
20    m = len(coords)
21    idx = {t: i for i, t in enumerate(coords)}
22
23    buckets = [[] for _ in range(m)]
24    for s, e, w in norm:
25        buckets[idx[e]].append((idx[s], w))
26
27    parent = list(range(m + 1))
28
29    def find(x):
30        while parent[x] != x:
31            parent[x] = parent[parent[x]]
32            x = parent[x]
33        return x
34
35    dp = [0] * m
36    current_best = 0
37
38    for i in range(m):
39        dp[i] = current_best
40
41        for s_idx, w in buckets[i]:
42            cand = dp[s_idx] + w
43            if cand > dp[i]:
44                dp[i] = cand
45
46        if dp[i] > current_best:
47            current_best = dp[i]
48
49        parent[i] = find(i + 1)
50
51    return current_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