Test results - Codility

Tasks Details

medium

1. DividingTheKingdom

In how many ways can you split a kingdom into two parts, so that the parts contain equal number of gold mines?

Task Score

100%

Correctness

100%

Performance

100%

An old king wants to divide his kingdom between his two sons. He is well known for his justness and wisdom, and he plans to make a good use of both of these attributes while dividing his kingdom.

The kingdom is administratively split into square boroughs that form an N × M grid. Some of the boroughs contain gold mines. The king knows that his sons do not care as much about the land as they do about gold, so he wants both parts of the kingdom to contain exactly the same number of mines. Moreover, he wants to split the kingdom with either a horizontal or a vertical line that goes along the borders of the boroughs (splitting no borough into two parts).

The goal is to count how many ways he can split the kingdom.

Write a function:

def solution(N, M, X, Y)

that, given two arrays of K integers X and Y, denoting coordinates of boroughs containing the gold mines, will compute the number of fair divisions of the kingdom.

For example, given N = 5, M = 5, X = [0, 4, 2, 0] and Y = [0, 0, 1, 4], the function should return 3. The king can divide his land in three different ways shown on the picture below.

Divide horizontally in two ways or vertically in one way

Write an efficient algorithm for the following assumptions:

N and M are integers within the range [1..100,000];

K is an integer within the range [1..100,000];

each element of array X is an integer within the range [0..N-1];

each element of array Y is an integer within the range [0..M-1].

Solution

Programming language used Python

Time spent on task 21 minutes

Notes

not defined yet

Code: 20:54:50 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 N, int M, int[] X, int[] Y) {
        // write your code in Java SE 8
    }
}

Code: 20:55:01 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(N, M, X, Y):
    # write your code in Python 3.6
    pass

Code: 21:01:31 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    pass

Code: 21:02:01 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    for i, x in enumerate(X):
        print(x)

Code: 21:02:01 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    for i, x in enumerate(X):
        print(x)

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 21:02:16 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    for i, x in enumerate(X):
        print(i, x)

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 21:02:31 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:02:54 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    after_x = [0 for i in range(0, ]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:03:12 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    after_x = [0 for i in range(0, N)]
    after_y = [0 for i in range(0, M)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:03:30 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:05:17 UTC, py, autosave

show code in pop-up

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

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:05:28 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    X = sort(X)
    Y = sort(Y)
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 147, in <module>
    main()
  File "exec.py", line 109, in main
    result = solution( N, M, X, Y )
  File "/tmp/solution.py", line 6, in solution
    X = sort(X)
NameError: name 'sort' is not defined

Code: 21:05:58 UTC, py, autosave

show code in pop-up

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

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    X = sorted(X)
    Y = sort(Y)
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:06:14 UTC, py, autosave

show code in pop-up

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

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    X = sorted(X)
    Y = sorted(Y)
    for i in range(0,
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:06:35 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X - 1 + Y - 1
    X = sorted(X)
    Y = sorted(Y)
    for i in range(0,
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:06:46 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y - 1
    X = sorted(X)
    Y = sorted(Y)
    for i in range(0,
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:06:58 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    X = sorted(X)
    Y = sorted(Y)
    for i in range(0, N
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:07:10 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    X = sorted(X)
    Y = sorted(Y)
    for i in range(0, len(X))
        
    before_x = [0 for i in range(0, N + 1)]
    before_y = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:08:00 UTC, py, autosave

show code in pop-up

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

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    X = sorted(X)
    Y = sorted(Y)
    for i in range(0, len(X))
        
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:08:12 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    X = sorted(X)
    Y = sorted(Y)
    for i in range(0, len(X))
        
    for i, x in enumerate(X):
        y = Y[i]

Code: 21:08:36 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1

Code: 21:08:59 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    for i in enumberate(xes):

Code: 21:10:21 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    for i,  in enumberate(xes):

Code: 21:10:43 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    total = 0
    for i, cnt in enumberate(xes):
        total += cnt
        if total ==

Code: 21:11:12 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    total = 0
    for i, cnt in enumberate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

Code: 21:11:22 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumberate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

Code: 21:11:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumberate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumberate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

Code: 21:11:33 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumberate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumberate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.040 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 147, in <module>
    main()
  File "exec.py", line 109, in main
    result = solution( N, M, X, Y )
  File "/tmp/solution.py", line 18, in solution
    for i, cnt in enumberate(xes):
NameError: name 'enumberate' is not defined

Code: 21:11:46 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumerate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumerate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

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

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumerate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumerate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

    return result

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 21:14:13 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return X + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumerate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumerate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

    return result

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 147, in <module>
    main()
  File "exec.py", line 109, in main
    result = solution( N, M, X, Y )
  File "/tmp/solution.py", line 7, in solution
    return X + 1 + Y + 1
TypeError: can only concatenate list (not "int") to list

User test case 1:

[5, 5, [], []]

Code: 21:14:43 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return N + 1 + Y + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumerate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumerate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

    return result

Code: 21:14:48 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return N + 1 + M + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumerate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumerate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

    return result

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 12

User test case 1:

[5, 5, [], []]

Code: 21:15:00 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return N + 1 + M + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumerate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumerate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

    return result

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 12

User test case 1:

[5, 5, [], []]

Code: 21:15:02 UTC, py, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35

def solution(N, M, X, Y):
    number_of_golds = len(X)
    if number_of_golds % 2 != 0:
        return 0
    expected_gold = number_of_golds // 2
    if expected_gold == 0:
        return N + 1 + M + 1
    xes = [0 for i in range(0, N + 1)]
    yes = [0 for i in range(0, M + 1)]
    for i, x in enumerate(X):
        y = Y[i]
        xes[x] += 1
        yes[y] += 1
        
    result = 0
    
    total = 0
    for i, cnt in enumerate(xes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break
        
    total = 0
    for i, cnt in enumerate(yes):
        total += cnt
        if total == expected_gold:
            result += 1
        elif total > expected_gold:
            break

    return result

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N+M+K)

expand all Example tests

▶

example
example test

✔

0.036 s

expand all Correctness tests

▶

one_column
simple test with one column

✔

0.036 s

▶

one_row
simple test with one row

✔

0.036 s

▶

simple_mostly_zeroes
simple test with mostly zeroes in array

✔

0.036 s

▶

combinations
multiple runs, all legal sequences of length 3

✔

0.036 s

10.

0.036 s

11.

0.036 s

12.

0.036 s

13.

0.036 s

14.

0.036 s

▶

random_small
small random tests

✔

0.036 s

▶

diagonal_permutation
goldmines lie on diagonal, but are given in random order

✔

0.036 s

expand all Performance tests

▶

random_large
large random tests

✔

0.036 s

0.040 s

0.240 s

▶

random_long
random tests with many rows or many columns

✔

0.048 s

0.088 s

▶

random_square
random tests with many rows and many columns

✔

0.064 s

0.276 s

▶

largest_answer
max test with largest answer

✔

0.068 s