Solution #37d6e851-b762-41e0-adc0-ac00abd99e9b

completed

Score

100% (5/5)

Runtime

21μs

Delta

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%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 = []
    append = jobs.append
    for job in raw:
        if isinstance(job, (list, tuple)) and len(job) == 3:
            append((job[0], job[1], job[2]))
    if not jobs:
        return 0

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

    n = len(jobs)
    dp = [0] * (n + 1)

    for i in range(1, n + 1):
        s, e, w = jobs[i - 1]

        lo = 0
        hi = i - 1
        while lo < hi:
            mid = (lo + hi) >> 1
            if jobs[mid][1] <= s:
                lo = mid + 1
            else:
                hi = mid
        j = lo
        if j and jobs[j - 1][1] > s:
            j -= 1
        elif j < i - 1 and jobs[j][1] <= s:
            j += 1

        take = w + dp[j]
        skip = dp[i - 1]
        dp[i] = take if take > skip else skip

    return dp[n]

Compare with Champion

Score Difference

Tied

Runtime Advantage

3μs slower

Code Size

42 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 append = jobs.append9 for j in raw:
10 for job in raw:10 if isinstance(j, (list, tuple)) and len(j) == 3:
11 if isinstance(job, (list, tuple)) and len(job) == 3:11 jobs.append((j[1], j[0], j[2])) # sort by end, store as (end, start, weight)
12 append((job[0], job[1], job[2]))12 if not jobs:
13 if not jobs:13 return 0
14 return 014
1515 jobs.sort()
16 jobs.sort(key=lambda x: x[1])16 ends = []
1717 bests = []
18 n = len(jobs)18
19 dp = [0] * (n + 1)19 for e, s, w in jobs:
2020 lo = 0
21 for i in range(1, n + 1):21 hi = len(ends)
22 s, e, w = jobs[i - 1]22 while lo < hi:
2323 mid = (lo + hi) >> 1
24 lo = 024 if ends[mid] <= s:
25 hi = i - 125 lo = mid + 1
26 while lo < hi:26 else:
27 mid = (lo + hi) >> 127 hi = mid
28 if jobs[mid][1] <= s:28
29 lo = mid + 129 candidate = w + (bests[lo - 1] if lo else 0)
30 else:30 current = bests[-1] if bests else 0
31 hi = mid31
32 j = lo32 if candidate > current:
33 if j and jobs[j - 1][1] > s:33 if ends and ends[-1] == e:
34 j -= 134 bests[-1] = candidate
35 elif j < i - 1 and jobs[j][1] <= s:35 else:
36 j += 136 ends.append(e)
3737 bests.append(candidate)
38 take = w + dp[j]38
39 skip = dp[i - 1]39 return bests[-1] if bests else 0
40 dp[i] = take if take > skip else skip40
4141
42 return dp[n]42
Your Solution
100% (5/5)21μ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    append = jobs.append
10    for job in raw:
11        if isinstance(job, (list, tuple)) and len(job) == 3:
12            append((job[0], job[1], job[2]))
13    if not jobs:
14        return 0
15
16    jobs.sort(key=lambda x: x[1])
17
18    n = len(jobs)
19    dp = [0] * (n + 1)
20
21    for i in range(1, n + 1):
22        s, e, w = jobs[i - 1]
23
24        lo = 0
25        hi = i - 1
26        while lo < hi:
27            mid = (lo + hi) >> 1
28            if jobs[mid][1] <= s:
29                lo = mid + 1
30            else:
31                hi = mid
32        j = lo
33        if j and jobs[j - 1][1] > s:
34            j -= 1
35        elif j < i - 1 and jobs[j][1] <= s:
36            j += 1
37
38        take = w + dp[j]
39        skip = dp[i - 1]
40        dp[i] = take if take > skip else skip
41
42    return dp[n]
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