Test results - Codility

Code: 16:49:33 UTC, java, autosave

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: 16:49:34 UTC, cpp, autosave

1 2 3 4 5 6 7 8 9

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
}

Code: 16:49:39 UTC, cpp, autosave

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

// you can use includes, for example:
#include <algorithm>
using namespace std;
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int index = A.size() - 1;
    int P_max, M_max;
    
    sort(A.begin(), A.end());
    
    P_max = A.at(index) * A.at(index - 1);
    M_max = A.at(0) * A.at(1);

    if(M_max > P_max){
        if(A.at(index) < 0)
            return P_max * A.at(index - 2);
        else
            return M_max * A.at(index);
    }else
        return P_max * A.at(index - 2);
 
}

Code: 16:49:52 UTC, cpp, autosave

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

// you can use includes, for example:
#include <algorithm>
using namespace std;
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int index = A.size() - 1;
    int P_max, M_max;
    
    sort(A.begin(), A.end());
    
    P_max = A.at(index - 1) * A.at(index - 2);
    M_max = A.at(0) * A.at(1);

    if(M_max > P_max){
        if(A.at(index) < 0)
            return P_max * A.at(index - 2);
        else
            return M_max * A.at(index);
    }else
        return P_max * A.at(index - 2);
 
}

Code: 16:50:03 UTC, cpp, autosave

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

// you can use includes, for example:
#include <algorithm>
using namespace std;
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int index = A.size() - 1;
    int P_max, M_max;
    
    sort(A.begin(), A.end());
    
    P_max = A.at(index - 1) * A.at(index - 2);
    M_max = A.at(0) * A.at(1);

    if(M_max > P_max){
        if(A.at(index) < 0)
            return P_max * A.at(index);
        else
            return M_max * A.at(index);
    }else
        return P_max * A.at(index - 2);
 
}

Code: 16:50:04 UTC, cpp, verify, result: Passed

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

// you can use includes, for example:
#include <algorithm>
using namespace std;
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int index = A.size() - 1;
    int P_max, M_max;
    
    sort(A.begin(), A.end());
    
    P_max = A.at(index - 1) * A.at(index - 2);
    M_max = A.at(0) * A.at(1);

    if(M_max > P_max){
        if(A.at(index) < 0)
            return P_max * A.at(index);
        else
            return M_max * A.at(index);
    }else
        return P_max * A.at(index);
 
}

Analysis

▶

example
example test

✔

OK

Code: 16:50:08 UTC, cpp, verify, result: Passed

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

// you can use includes, for example:
#include <algorithm>
using namespace std;
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int index = A.size() - 1;
    int P_max, M_max;
    
    sort(A.begin(), A.end());
    
    P_max = A.at(index - 1) * A.at(index - 2);
    M_max = A.at(0) * A.at(1);

    if(M_max > P_max){
        if(A.at(index) < 0)
            return P_max * A.at(index);
        else
            return M_max * A.at(index);
    }else
        return P_max * A.at(index);
 
}

Analysis

▶

example
example test

✔

OK

Code: 16:50:11 UTC, cpp, final, score: 100

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

// you can use includes, for example:
#include <algorithm>
using namespace std;
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int index = A.size() - 1;
    int P_max, M_max;
    
    sort(A.begin(), A.end());
    
    P_max = A.at(index - 1) * A.at(index - 2);
    M_max = A.at(0) * A.at(1);

    if(M_max > P_max){
        if(A.at(index) < 0)
            return P_max * A.at(index);
        else
            return M_max * A.at(index);
    }else
        return P_max * A.at(index);
 
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N * log(N))

▶

example
example test

✔

OK

▶

one_triple
three elements

✔

OK

▶

simple1
simple tests

✔

OK

▶

simple2
simple tests

✔

OK

▶

small_random
random small, length = 100

✔

OK

▶

medium_range
-1000, -999, ... 1000, length = ~1,000

✔

OK

▶

medium_random
random medium, length = ~10,000

✔

OK

▶

large_random
random large, length = ~100,000

✔

OK

▶

large_range
2000 * (-10..10) + [-1000, 500, -1]

✔

OK

▶

extreme_large
(-2, .., -2, 1, .., 1) and (MAX_INT)..(MAX_INT), length = ~100,000

✔

OK