Test results - Codility

Code: 11:25:14 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: 11:25:20 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can use includes, for example:
#include <bits/stdc++.h>

// 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 len = A.size();
    int max_val = 0;
    int leader;
    int res = 0;
    map<int, int> leader_cnt; 

    for(int i=0; i<len; i++){
        if(leader_cnt.find(A[i]) == leader_cnt.end()){
            leader_cnt[A[i]] = 1;    
        }else{
            leader_cnt[A[i]]++;
            if(max_val < leader_cnt[A[i]]){
                max_val = leader_cnt[A[i]];
                leader = A[i];
            }
        }
    }
    
    if(max_val < len/2 ){
        return 0;
    }

    int left_cnt = 0;
    int right_cnt = leader_cnt[A[leader]];

    for(int i=0; i<len; i++){
        if(A[i] == leader){
            left_cnt++;
            right_cnt--;
        }
        if(right_cnt > (len-(i+1))/2 && left_cnt > (i+1)/2){
            res++;
        }
    }
    return res;
}

Code: 11:25:36 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45

// you can use includes, for example:
#include <bits/stdc++.h>

// 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 len = A.size();
    int max_val = 0;
    int leader;
    int res = 0;
    map<int, int> leader_cnt; 

    // 1 element
    for(int i=0; i<len; i++){
        if(leader_cnt.find(A[i]) == leader_cnt.end()){
            leader_cnt[A[i]] = 1;    
        }else{
            leader_cnt[A[i]]++;
            if(max_val < leader_cnt[A[i]]){
                max_val = leader_cnt[A[i]];
                leader = A[i];
            }
        }
    }
    
    if(max_val < len/2 ){
        return 0;
    }

    int left_cnt = 0;
    int right_cnt = leader_cnt[A[leader]];

    for(int i=0; i<len; i++){
        if(A[i] == leader){
            left_cnt++;
            right_cnt--;
        }
        if(right_cnt > (len-(i+1))/2 && left_cnt > (i+1)/2){
            res++;
        }
    }
    return res;
}

Code: 11:26:01 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

// you can use includes, for example:
#include <bits/stdc++.h>

// 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 len = A.size();
    int max_val = 0;
    int leader;
    int res = 0;
    map<int, int> leader_cnt; 

    // 1 element
    if(len == 1){
        return 0;
    }

    // several elements
    for(int i=0; i<len; i++){
        if(leader_cnt.find(A[i]) == leader_cnt.end()){
            leader_cnt[A[i]] = 1;    
        }else{
            leader_cnt[A[i]]++;
            if(max_val < leader_cnt[A[i]]){
                max_val = leader_cnt[A[i]];
                leader = A[i];
            }
        }
    }
    
    if(max_val < len/2 ){
        return 0;
    }

    int left_cnt = 0;
    int right_cnt = leader_cnt[A[leader]];

    for(int i=0; i<len; i++){
        if(A[i] == leader){
            left_cnt++;
            right_cnt--;
        }
        if(right_cnt > (len-(i+1))/2 && left_cnt > (i+1)/2){
            res++;
        }
    }
    return res;
}

Code: 11:27:30 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

// you can use includes, for example:
#include <bits/stdc++.h>

// 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 len = A.size();
    int max_val = 0;
    int leader;
    int res = 0;
    map<int, int> leader_cnt; 

    // 1 element
    if(len == 1){
        return 0;
    }

    // several elements
    for(int i=0; i<len; i++){
        if(leader_cnt.find(A[i]) == leader_cnt.end()){
            leader_cnt[A[i]] = 1;    
        }else{
            leader_cnt[A[i]]++;
            if(max_val < leader_cnt[A[i]]){
                max_val = leader_cnt[A[i]];
                leader = A[i];
            }
        }
    }
    
    if(max_val < len/2 ){
        return 0;
    }

    int left_cnt = 0;
    int right_cnt = leader_cnt[leader];

    for(int i=0; i<len; i++){
        if(A[i] == leader){
            left_cnt++;
            right_cnt--;
        }
        if(right_cnt > (len-(i+1))/2 && left_cnt > (i+1)/2){
            res++;
        }
    }
    return res;
}

Code: 11:27:31 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

// you can use includes, for example:
#include <bits/stdc++.h>

// 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 len = A.size();
    int max_val = 0;
    int leader;
    int res = 0;
    map<int, int> leader_cnt; 

    // 1 element
    if(len == 1){
        return 0;
    }

    // several elements
    for(int i=0; i<len; i++){
        if(leader_cnt.find(A[i]) == leader_cnt.end()){
            leader_cnt[A[i]] = 1;    
        }else{
            leader_cnt[A[i]]++;
            if(max_val < leader_cnt[A[i]]){
                max_val = leader_cnt[A[i]];
                leader = A[i];
            }
        }
    }
    
    if(max_val < len/2 ){
        return 0;
    }

    int left_cnt = 0;
    int right_cnt = leader_cnt[leader];

    for(int i=0; i<len; i++){
        if(A[i] == leader){
            left_cnt++;
            right_cnt--;
        }
        if(right_cnt > (len-(i+1))/2 && left_cnt > (i+1)/2){
            res++;
        }
    }
    return res;
}

Analysis

▶

example
example test

✔

OK

Code: 11:27:42 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

// you can use includes, for example:
#include <bits/stdc++.h>

// 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 len = A.size();
    int max_val = 0;
    int leader;
    int res = 0;
    map<int, int> leader_cnt; 

    // 1 element
    if(len == 1){
        return 0;
    }

    // several elements
    for(int i=0; i<len; i++){
        if(leader_cnt.find(A[i]) == leader_cnt.end()){
            leader_cnt[A[i]] = 1;    
        }else{
            leader_cnt[A[i]]++;
            if(max_val < leader_cnt[A[i]]){
                max_val = leader_cnt[A[i]];
                leader = A[i];
            }
        }
    }
    
    if(max_val < len/2 ){
        return 0;
    }

    int left_cnt = 0;
    int right_cnt = leader_cnt[leader];

    for(int i=0; i<len; i++){
        if(A[i] == leader){
            left_cnt++;
            right_cnt--;
        }
        if(right_cnt > (len-(i+1))/2 && left_cnt > (i+1)/2){
            res++;
        }
    }
    return res;
}

Analysis

▶

example
example test

✔

OK

Code: 11:27:47 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

// you can use includes, for example:
#include <bits/stdc++.h>

// 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 len = A.size();
    int max_val = 0;
    int leader;
    int res = 0;
    map<int, int> leader_cnt; 

    // 1 element
    if(len == 1){
        return 0;
    }

    // several elements
    for(int i=0; i<len; i++){
        if(leader_cnt.find(A[i]) == leader_cnt.end()){
            leader_cnt[A[i]] = 1;    
        }else{
            leader_cnt[A[i]]++;
            if(max_val < leader_cnt[A[i]]){
                max_val = leader_cnt[A[i]];
                leader = A[i];
            }
        }
    }
    
    if(max_val < len/2 ){
        return 0;
    }

    int left_cnt = 0;
    int right_cnt = leader_cnt[leader];

    for(int i=0; i<len; i++){
        if(A[i] == leader){
            left_cnt++;
            right_cnt--;
        }
        if(right_cnt > (len-(i+1))/2 && left_cnt > (i+1)/2){
            res++;
        }
    }
    return res;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

▶

example
example test

✔

OK

▶

single
single element

✔

OK

▶

double
two elements

✔

OK

▶

simple
simple test

✔

OK

▶

small_random
small random test with two values, length = ~100

✔

OK

▶

small
random + 200 * [MIN_INT] + random ,length = ~300

✔

OK

▶

large_random
large random test with two values, length = ~50,000

✔

OK

▶

large
random(0,1) + 50000 * [0] + random(0, 1), length = ~100,000

✔

OK

▶

large_range
1, 2, ..., N, length = ~100,000

✔

OK

▶

extreme_large
all the same values

✔

OK