Test results - Codility

Tasks Details

easy

1. Triangle

Determine whether a triangle can be built from a given set of edges.

Task Score

100%

Correctness

100%

Performance

100%

对于一个长度为 N 的整型数组, 如果存在三个元素 i,j,k i ≠ j ≠ k, 0 ≤ i,j,k < N) 满足如下条件:

A[i] + A[j] > A[k],

A[j] + A[k] > A[i],

A[k] + A[i] > A[j].

实现如下一个函数:

def solution(A)

则返回1, 否则返回0.

对于数组:

A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20

函数应该返回 1, 因为坐标为i=0, j=2, k=4的元素满足所有的判定条件(例如: A[2] + A[4] > A[0]). 对于数组:

A[0] = 10 A[1] = 50 A[2] = 5 A[3] = 1

函数应该返回 0.

假定:

N 是 [0..100,000] 内的整数;

数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的整数 .

Solution

Programming language used Python

Time spent on task 3 minutes

Notes

not defined yet

Task timeline

Code: 12:17:24 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

Code: 12:17:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    pass

Code: 12:17:34 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    pass

Code: 12:17:45 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    A.sort()

Code: 12:18:16 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    A.sort()
    for

Code: 12:18:30 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    A.sort()
    for i in range(0, )

Code: 12:18:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        
    A.sort()
    for i in range(0, len(A)-2):

Code: 12:19:00 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        return 0
    A.sort()
    for i in range(0, len(A)-2):

Code: 12:19:20 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        return 0
    A.sort()
    for i in range(0, len(A)-2):
        if A[i] + A[i+1] > A[i+1]:

Code: 12:19:30 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        return 0
    A.sort()
    for i in range(0, len(A)-2):
        if A[i] + A[i+1] > A[i+1]:
            return 1
    return 0

Code: 12:19:47 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        return 0
    A.sort()
    for i in range(0, len(A)-2):
        if A[i] + A[i+1] > A[i+1]:
            return 1
    return 0

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✘

WRONG ANSWER
got 1 expected 0

0.036 s

WRONG ANSWER, got 1 expected 0

Code: 12:20:01 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        return 0
    A.sort()
    for i in range(0, len(A)-2):
        if A[i] + A[i+1] > A[i+2]:
            return 1
    return 0

Code: 12:20:01 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        return 0
    A.sort()
    for i in range(0, len(A)-2):
        if A[i] + A[i+1] > A[i+2]:
            return 1
    return 0

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✔

0.036 s

Code: 12:20:10 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        return 0
    A.sort()
    for i in range(0, len(A)-2):
        if A[i] + A[i+1] > A[i+2]:
            return 1
    return 0

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✔

0.036 s

Code: 12:20:16 UTC, py, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    if len(A) < 3:
        return 0
    A.sort()
    for i in range(0, len(A)-2):
        if A[i] + A[i+1] > A[i+2]:
            return 1
    return 0

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N*log(N))

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✔

0.036 s

expand all Correctness tests

▶

extreme_empty
empty sequence

✔

0.036 s

▶

extreme_single
1-element sequence

✔

0.036 s

▶

extreme_two_elems
2-element sequence

✔

0.036 s

▶

extreme_negative1
three equal negative numbers

✔

0.036 s

▶

extreme_arith_overflow1
overflow test, 3 MAXINTs

✔

0.036 s

▶

extreme_arith_overflow2
overflow test, 10 and 2 MININTs

✔

0.036 s

▶

extreme_arith_overflow3
overflow test, 0 and 2 MAXINTs

✔

0.036 s

▶

medium1
chaotic sequence of values from [0..100K], length=30

✔

0.036 s

▶

medium2
chaotic sequence of values from [0..1K], length=50

✔

0.036 s

▶

medium3
chaotic sequence of values from [0..1K], length=100

✔

0.036 s

expand all Performance tests

▶

large1
chaotic sequence with values from [0..100K], length=10K

✔

0.048 s

0.036 s

▶

large2
1 followed by an ascending sequence of ~50K elements from [0..100K], length=~50K

✔

0.084 s

0.036 s

▶

large_random
chaotic sequence of values from [0..1M], length=100K

✔

0.164 s

0.036 s

▶

large_negative
chaotic sequence of negative values from [-1M..-1], length=100K

✔

0.188 s

0.036 s

▶

large_negative2
chaotic sequence of negative values from [-10..-1], length=100K

✔

0.160 s

0.036 s

▶

large_negative3
sequence of -1 value, length=100K

✔

0.152 s

0.036 s