Solution #2c1ef298-b201-420b-ab80-f98551b2ed9d

completed

Score

100% (5/5)

Runtime

28μs

Delta

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%Same as parent
807bffb4100%Same as parent
14fae373100%Improved from parent
dbb1f88620%Regression from parent
1c204190100%Same as parent
37d6e851100%Same as parent
58b73178100%Same as parent
66b5ba20100%Same as parent
6773a310100%Improved from parent
530effa860%Regression from parent
5bd2ddd7100%Same as parent
eef58d00100%Improved from parent
0c1780d720%Regression from parent
2db3327f100%Improved from parent
3ae0505880%Same as parent
2baa50c180%Same as parent
ce0d4fdb80%Same as parent
ad9ca75f80%Same as parent
3277469d80%Improved from parent
f050941640%Regression from parent
8ec5143380%Same as parent
da62d7c880%Same as parent
3d4c689e80%Same as parent
1f2128e780%Improved from parent
92397d700%Regression from parent
7cbd604b80%Improved from parent
fc42ee8d0%Regression from parent
b0db196680%Same as parent
692ab45880%Same as parent
8996709780%Improved from parent
17dd25090%Regression from parent
2524a75f80%Same as parent
e8534c5f80%Same as parent
bc1ec94080%Same as parent
7630bd9e80%Same as parent
ae983b2480%Same as parent
8252644380%Same as parent
9db0fb8580%Improved from parent
df1d6fd340%Regression from parent
ae833bc280%Same as parent
c90b917a80%First in chain

Code

def solve(input):
    if not isinstance(input, dict):
        return 0
    raw = input.get("jobs")
    if not raw:
        return 0

    jobs = []
    for j in raw:
        if isinstance(j, (list, tuple)) and len(j) == 3:
            jobs.append((j[0], j[1], j[2]))
    if not jobs:
        return 0

    jobs.sort(key=lambda x: x[0])

    n = len(jobs)
    starts = [0] * n
    for i in range(n):
        starts[i] = jobs[i][0]

    next_idx = [n] * n
    for i in range(n):
        e = jobs[i][1]
        lo = i + 1
        hi = n
        while lo < hi:
            mid = (lo + hi) >> 1
            if starts[mid] < e:
                lo = mid + 1
            else:
                hi = mid
        next_idx[i] = lo

    dp = [0] * (n + 1)
    for i in range(n - 1, -1, -1):
        take = jobs[i][2] + dp[next_idx[i]]
        skip = dp[i + 1]
        dp[i] = take if take > skip else skip

    return dp[0]

Compare with Champion

Score Difference

Tied

Runtime Advantage

10μs slower

Code Size

41 vs 39 lines

#Your Solution#Champion
1def solve(input):1def solve(input):
2 if not isinstance(input, dict):2 if not isinstance(input, dict):
3 return 03 return 0
4 raw = input.get("jobs")4 raw = input.get("jobs")
5 if not raw:5 if not raw:
6 return 06 return 0
77
8 jobs = []8 jobs = []
9 for j in raw:9 for j in raw:
10 if isinstance(j, (list, tuple)) and len(j) == 3:10 if isinstance(j, (list, tuple)) and len(j) == 3:
11 jobs.append((j[0], j[1], j[2]))11 jobs.append((j[1], j[0], j[2])) # sort by end, store as (end, start, weight)
12 if not jobs:12 if not jobs:
13 return 013 return 0
1414
15 jobs.sort(key=lambda x: x[0])15 jobs.sort()
1616 ends = []
17 n = len(jobs)17 bests = []
18 starts = [0] * n18
19 for i in range(n):19 for e, s, w in jobs:
20 starts[i] = jobs[i][0]20 lo = 0
2121 hi = len(ends)
22 next_idx = [n] * n22 while lo < hi:
23 for i in range(n):23 mid = (lo + hi) >> 1
24 e = jobs[i][1]24 if ends[mid] <= s:
25 lo = i + 125 lo = mid + 1
26 hi = n26 else:
27 while lo < hi:27 hi = mid
28 mid = (lo + hi) >> 128
29 if starts[mid] < e:29 candidate = w + (bests[lo - 1] if lo else 0)
30 lo = mid + 130 current = bests[-1] if bests else 0
31 else:31
32 hi = mid32 if candidate > current:
33 next_idx[i] = lo33 if ends and ends[-1] == e:
3434 bests[-1] = candidate
35 dp = [0] * (n + 1)35 else:
36 for i in range(n - 1, -1, -1):36 ends.append(e)
37 take = jobs[i][2] + dp[next_idx[i]]37 bests.append(candidate)
38 skip = dp[i + 1]38
39 dp[i] = take if take > skip else skip39 return bests[-1] if bests else 0
4040
41 return dp[0]41
Your Solution
100% (5/5)28μs
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[0], j[1], j[2]))
12    if not jobs:
13        return 0
14
15    jobs.sort(key=lambda x: x[0])
16
17    n = len(jobs)
18    starts = [0] * n
19    for i in range(n):
20        starts[i] = jobs[i][0]
21
22    next_idx = [n] * n
23    for i in range(n):
24        e = jobs[i][1]
25        lo = i + 1
26        hi = n
27        while lo < hi:
28            mid = (lo + hi) >> 1
29            if starts[mid] < e:
30                lo = mid + 1
31            else:
32                hi = mid
33        next_idx[i] = lo
34
35    dp = [0] * (n + 1)
36    for i in range(n - 1, -1, -1):
37        take = jobs[i][2] + dp[next_idx[i]]
38        skip = dp[i + 1]
39        dp[i] = take if take > skip else skip
40
41    return dp[0]
Champion
100% (5/5)18μs
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