Solution #7630bd9e-6eb0-4ccd-9f0c-46907ede8766

1def solve(input):
2    jobs = input.get("jobs", [])
3    if not jobs:
4        return 0
5
6    # Greedy-style sweep over time points:
7    # maintain best achievable weight up to each processed end time.
8    # For a job [s,e,w], its candidate value is best weight available at time s plus w.
9    # We process jobs by end time and advance a pointer over compressed times.
10    times = sorted(set([0] + [s for s, _, _ in jobs] + [e for _, e, _ in jobs]))
11    idx = {t: i for i, t in enumerate(times)}
12
13    ending = [[] for _ in range(len(times))]
14    for s, e, w in jobs:
15        ending[idx[e]].append((idx[s], w))
16
17    best = [0] * len(times)
18    running = 0
19    for t in range(len(times)):
20        if t > 0 and best[t] < best[t - 1]:
21            best[t] = best[t - 1]
22        if best[t] > running:
23            running = best[t]
24        for s_idx, w in ending[t]:
25            cand = best[s_idx] + w
26            if cand > best[t]:
27                best[t] = cand
28        if best[t] < running:
29            best[t] = running
30
31    return best[-1]

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