Solution #8b739256-ad1e-4d53-a895-93d8bf70dc2e

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    from array import array
9
10    jobs = []
11    for j in raw:
12        if isinstance(j, (list, tuple)) and len(j) == 3:
13            jobs.append((j[1], j[0], j[2]))  # sort by end, keep (end, start, weight)
14    if not jobs:
15        return 0
16
17    jobs.sort()
18
19    n = len(jobs)
20    ends = array('q', (0 for _ in range(n)))
21    starts = array('q', (0 for _ in range(n)))
22    weights = array('q', (0 for _ in range(n)))
23
24    i = 0
25    for e, s, w in jobs:
26        ends[i] = e
27        starts[i] = s
28        weights[i] = w
29        i += 1
30
31    prev = array('i', (0 for _ in range(n)))
32    for i in range(n):
33        s = starts[i]
34        lo = 0
35        hi = i
36        while lo < hi:
37            mid = (lo + hi) >> 1
38            if ends[mid] <= s:
39                lo = mid + 1
40            else:
41                hi = mid
42        prev[i] = lo - 1
43
44    dp = array('q', (0 for _ in range(n + 1)))
45    for i in range(n):
46        take = weights[i] + dp[prev[i] + 1]
47        skip = dp[i]
48        dp[i + 1] = take if take > skip else skip
49
50    return int(dp[n])

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