Test results - Codility

Tasks Details

medium

1. MaxCounters

Calculate the values of counters after applying all alternating operations: increase counter by 1; set value of all counters to current maximum.

Task Score

100%

Correctness

100%

Performance

100%

You are given N counters, initially set to 0, and you have two possible operations on them:

increase(X) − counter X is increased by 1,

max counter − all counters are set to the maximum value of any counter.

A non-empty array A of M integers is given. This array represents consecutive operations:

if A[K] = X, such that 1 ≤ X ≤ N, then operation K is increase(X),

if A[K] = N + 1 then operation K is max counter.

For example, given integer N = 5 and array A such that:

A[0] = 3 A[1] = 4 A[2] = 4 A[3] = 6 A[4] = 1 A[5] = 4 A[6] = 4

the values of the counters after each consecutive operation will be:

(0, 0, 1, 0, 0) (0, 0, 1, 1, 0) (0, 0, 1, 2, 0) (2, 2, 2, 2, 2) (3, 2, 2, 2, 2) (3, 2, 2, 3, 2) (3, 2, 2, 4, 2)

The goal is to calculate the value of every counter after all operations.

Write a function:

vector<int> solution(int N, vector<int> &A);

that, given an integer N and a non-empty array A consisting of M integers, returns a sequence of integers representing the values of the counters.

Result array should be returned as a vector of integers.

For example, given:

A[0] = 3 A[1] = 4 A[2] = 4 A[3] = 6 A[4] = 1 A[5] = 4 A[6] = 4

the function should return [3, 2, 2, 4, 2], as explained above.

Write an efficient algorithm for the following assumptions:

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

each element of array A is an integer within the range [1..N + 1].

Solution

Programming language used C++

Time spent on task 17 minutes

Notes

not defined yet

Code: 04:44:52 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[] A) {
        // write your code in Java SE 8
    }
}

Code: 04:45:16 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

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

Code: 04:45:46 UTC, cpp, autosave

show code in pop-up

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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, base
    for (int i = 0; i < A.size(); i++) {
        
    }
}

Code: 04:46:16 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1&& ){
            
        } else {
            
        }
    }
}

Code: 04:46:26 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            
        } else {
            
        }
    }
}

Code: 04:46:41 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] += 1;
        } else {
            
        }
    }
}

Code: 04:46:59 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] += 1;
        } else if (A[i] == N+1) {
            cuMax = 
        }
    }
}

Code: 04:47:23 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] += 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            cuMax = 
        }
    }
}

Code: 04:47:53 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] += 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            
        }
    }
}

Code: 04:48:04 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] += 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [2, 2, 2, 4, 2] expected [3, 2, 2, 4, 2]

0.001 s

WRONG ANSWER, got [2, 2, 2, 4, 2] expected [3, 2, 2, 4, 2]

Code: 04:49:35 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] += 1;
            curMax = max(curMax, ans[idx] );
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Code: 04:49:56 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] = A[i] + 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [5, 5, 5, 5, 5] expected [3, 2, 2, 4, 2]

0.001 s

WRONG ANSWER, got [5, 5, 5, 5, 5] expected [3, 2, 2, 4, 2]

Code: 04:50:06 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] += 1;
            curMax = max(curMax, ans[idx] + 1);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Code: 04:50:16 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] += 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Code: 04:51:15 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] =;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Code: 04:51:28 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] = max(baseValue, ans[idx]+1);
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [2, 2, 2, 4, 2] expected [3, 2, 2, 4, 2]

0.001 s

WRONG ANSWER, got [2, 2, 2, 4, 2] expected [3, 2, 2, 4, 2]

Code: 04:52:01 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] = max(baseValue, ans[idx]+1) + 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Code: 04:52:18 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] = max(baseValue, ans[idx]) + 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Code: 04:52:22 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] = max(baseValue, ans[idx]) + 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.001 s

Code: 05:01:32 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] = max(baseValue, ans[idx]) + 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.001 s

Code: 05:01:35 UTC, cpp, 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

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

vector<int> solution(int N, vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> ans(N, 0);
    int curMax = 0, baseValue = 0;
    for (int i = 0; i < A.size(); i++) {
        int idx = A[i]-1;
        if (A[i] >=1 && A[i] <= N){
            ans[idx] = max(baseValue, ans[idx]) + 1;
            curMax = max(curMax, ans[idx]);
        } else if (A[i] == N+1) {
            baseValue = curMax;
        }
    }
    for (int i = 0; i < N; i++) {
        if (ans[i] < baseValue) {
            ans[i] = baseValue;
        }
    }
    return ans;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N + M)

expand all Example tests

▶

example
example test

✔

0.001 s

expand all Correctness tests

▶

extreme_small
all max_counter operations

✔

0.001 s

▶

single
only one counter

✔

0.001 s

▶

small_random1
small random test, 6 max_counter operations

✔

0.001 s

▶

small_random2
small random test, 10 max_counter operations

✔

0.001 s

expand all Performance tests

▶

medium_random1
medium random test, 50 max_counter operations

✔

0.001 s

▶

medium_random2
medium random test, 500 max_counter operations

✔

0.001 s

▶

large_random1
large random test, 2120 max_counter operations

✔

0.004 s

▶

large_random2
large random test, 10000 max_counter operations

✔

0.008 s

▶

extreme_large
all max_counter operations

✔

0.016 s

0.012 s