Solution #2524a75f-e824-43e9-a5a3-5f546f8697c6

1def solve(input):
2    jobs = input.get("jobs", [])
3    if not jobs:
4        return 0
5
6    # Coordinate compression + time-based DP.
7    # dp[t] = best achievable weight up to compressed time t.
8    times = []
9    norm_jobs = []
10    for job in jobs:
11        s, e, w = job
12        norm_jobs.append((s, e, w))
13        times.append(s)
14        times.append(e)
15
16    times = sorted(set(times))
17    idx = {}
18    for i, t in enumerate(times):
19        idx[t] = i
20
21    m = len(times)
22    ending = [[] for _ in range(m)]
23    for s, e, w in norm_jobs:
24        ending[idx[e]].append((idx[s], w))
25
26    dp = [0] * m
27    best = 0
28    for i in range(m):
29        if i > 0 and dp[i - 1] > best:
30            best = dp[i - 1]
31        cur = best
32        for s_idx, w in ending[i]:
33            cand = dp[s_idx] + w
34            if cand > cur:
35                cur = cand
36        dp[i] = cur
37
38    return dp[-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