Test results - Codility

Tasks Details

medium

1. LongestNonnegativeSumSlice

Given an array consisting of the integers -1, 0 and 1, find the longest slice with a non-negative sum.

Task Score

63%

Correctness

100%

Performance

27%

You are given an array A consisting of the integers −1, 0 and 1. A slice of that array is any pair of integers (P, Q) such that 0 ≤ P ≤ Q < N. Your task is to find the longest slice of A whose elements yield a non-negative sum.

Write a function:

int solution(vector<int> &A);

that, given an array A of length N, consisting only of the values −1, 0, 1, returns the length of the longest slice of A that yields a non-negative sum. If there's no such slice, your function should return 0.

For example, given A = [−1, −1, 1, −1, 1, 0, 1, −1, −1], your function should return 7, as the slice starting at the second position and ending at the eighth is the longest slice with a non-negative sum.

For another example, given A = [1, 1, −1, −1, −1, −1, −1, 1, 1] your function should return 4: both the first four elements and the last four elements of array A are longest valid slices.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [2..100,000];

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

Solution

Programming language used C++

Time spent on task 11 minutes

Notes

not defined yet

Code: 09:41:26 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: 09:41:29 UTC, cpp, autosave

show code in pop-up

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: 09:41:55 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>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <vector>
#include <
int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
}

Code: 09:42:25 UTC, cpp, autosave

show code in pop-up

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

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it
    
}

Code: 09:42:55 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

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        
        
    }
    
    
}

Code: 09:43: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 20 21 22 23 24

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B
        
    }
    
    
}

Code: 09:43:56 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>

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

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }
    
    
}

Code: 09:44:07 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 27 28

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    
    
    
    
}

Code: 09:44:37 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 27 28 29 30 31 32

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for ()
        
    }
    
    
    
}

Code: 09:44:55 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 27 28 29 30 31 32 33

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {}
        
    }
    
    
    
}

Code: 09:45: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 27 28 29 30 31 32 33 34 35 36 37

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -
            
            
        }
        
    }
    
    
    
}

Code: 09:45:30 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 27 28 29 30 31 32 33 34 35 36 37

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B()
            
            
        }
        
    }
    
    
    
}

Code: 09:46:00 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 27 28 29 30 31 32 33 34 35 36

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B(it - 1);
            if ((it - ()))
        }
        
    }
    
    
    
}

Code: 09:46:13 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 27 28 29 30 31 32 33 34 35 36

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B(it - 1);
            if ( (it - (it-1) > max))
        }
        
    }
    
    
    
}

Code: 09:46:37 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 27 28 29 30 31 32 33 34 35 36 37

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B(it - 1);
            if ( (it - (it-1)) > max ) 
                max = (it - (it - 1))
        }
        
    }
    
    
    
}

Code: 09:46:47 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 27 28 29 30 31 32 33 34 35 36 37

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B(it - 1);
            if ( (it - (it-1)) > max ) 
                max = (it - (it - 1));
        }
        
    }
    
    
    
}

Code: 09:46: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 27 28 29 30 31 32 33 34

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B(it - 1);
            if ( (it - (it-1)) > max ) 
                max = (it - (it - 1));
        }
    }
    return max;
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:28:43: error: no match for call to '(std::vector<int>) (int)'
             partial = B.at(it2) -  B(it - 1);
                                           ^

Code: 09:47:06 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 27 28 29 30 31 32 33 34

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if ( (it - (it-1)) > max ) 
                max = (it - (it - 1));
        }
    }
    return max;
}

Analysis

expand all Example tests

▶

example1
first example test

✘

WRONG ANSWER
got 1 expected 7

0.001 s

WRONG ANSWER, got 1 expected 7

▶

example2
second example test

✘

WRONG ANSWER
got 3 expected 4

0.001 s

WRONG ANSWER, got 3 expected 4

Code: 09:47: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 27 28 29 30 31 32 33 34 35

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            
            if ( (it - (it-1)) > max ) 
                max = (it - (it - 1));
        }
    }
    return max;
}

Code: 09:47:46 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 27 28 29 30 31 32 33 34 35

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

Code: 09:47:51 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 27 28 29 30 31 32 33 34 35

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) > 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

Analysis

expand all Example tests

▶

example1
first example test

✘

WRONG ANSWER
got 1 expected 7

0.001 s

WRONG ANSWER, got 1 expected 7

▶

example2
second example test

✘

WRONG ANSWER
got 3 expected 4

0.001 s

WRONG ANSWER, got 3 expected 4

Code: 09:48:57 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 27 28 29 30 31 32 33 34 35

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

Code: 09:48:58 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 27 28 29 30 31 32 33 34 35

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

Analysis

expand all Example tests

▶

example1
first example test

✔

0.001 s

▶

example2
second example test

✔

0.001 s

Code: 09:49:11 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 27 28 29 30 31 32 33 34 35

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

User test case 1:

[-1, 0, -1]

Analysis

expand all Example tests

▶

example1
first example test

✔

0.001 s

▶

example2
second example test

✔

0.001 s

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 1

Code: 09:49:27 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 27 28 29 30 31 32 33 34 35

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

User test case 1:

[-1, 0, -1]

User test case 2:

[-1, 0, 0, -1]

Analysis

expand all Example tests

▶

example1
first example test

✔

0.001 s

▶

example2
second example test

✔

0.001 s

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 1

▶

test_data2

✔

0.001 s

OK
function result: 1

Code: 09:50:14 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 27 28 29 30 31 32 33 34 35 36

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
            
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

Code: 09:50:44 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 27 28 29 30 31 32 33 34 35 36 37 38

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
            
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
                        //std::cout << "it " << it <<std::endl;
            //std::cout << "it2 " << it2 <<std::endl;
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

Code: 09:50:54 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 27 28 29 30 31 32 33 34 35 36 37 38

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
            
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            std::cout << "it " << it <<std::endl;
            std::cout << "it2 " << it2 <<std::endl;
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

Code: 09:51:04 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
            
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            std::cout << "it " << it <<std::endl;
            std::cout << "it2 " << it2 <<std::endl;
            partial = B.at(it2) -  B.at(it - 1);
            std::cout << "partial " << partial <<std::endl;
            std::cout << "max " << max <<std::endl;
            if (partial >= 0)
                if ( (it - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

User test case 1:

[-1, 0, -1]

User test case 2:

[-1, 0, 0, -1]

Analysis

expand all Example tests

▶

example1
first example test

✔

0.001 s

stdout:

it 1
it2 1
partial -1
max 7
it 1
it2 2
partial 0
max 7
it 1
it2 3
partial -1
max 7
it 1
it2 4
partial 0
max 7
it 1
it2 5
partial 0
max 7
it 1
it2 6
partial 1
max 7
it 1
it2 7
partial 0
max 7
it 1
it2 8
partial -1
max 7
it 2
it2 2
partial 1
max 7
it 2
it2 3
partial 0
max 7
it 2
it2 4
partial 1
max 7
it 2
it2 5
partial 1
max 7
it 2
it2 6
partial 2
max 7
it 2
it2 7
partial 1
max 7
it 2
it2 8
partial 0
max 7
it 3
it2 3
partial -1
max 7
it 3
it2 4
partial 0
max 7
it 3
it2 5
partial 0
max 7
it 3
it2 6
partial 1
max 7
it 3
it2 7
partial 0
max 7
it 3
it2 8
partial -1
max 7
it 4
it2 4
partial 1
max 7
it 4
it2 5
partial 1
max 7
it 4
it2 6
partial 2
max 7
it 4
it2 7
partial 1
max 7
it 4
it2 8
partial 0
max 7
it 5
it2 5
partial 0
max 7
it 5
it2 6
partial 1
max 7
it 5
it2 7
partial 0
max 7
it 5
it2 8
partial -1
max 7
it 6
it2 6
partial 1
max 7
it 6
it2 7
partial 0
max 7
it 6
it2 8
partial -1
max 7
it 7
it2 7
partial -1
max 7
it 7
it2 8
partial -2
max 7
it 8
it2 8
partial -1
max 7

▶

example2
second example test

✔

0.001 s

stdout:

it 1
it2 1
partial 1
max 4
it 1
it2 2
partial 0
max 4
it 1
it2 3
partial -1
max 4
it 1
it2 4
partial -2
max 4
it 1
it2 5
partial -3
max 4
it 1
it2 6
partial -4
max 4
it 1
it2 7
partial -3
max 4
it 1
it2 8
partial -2
max 4
it 2
it2 2
partial -1
max 4
it 2
it2 3
partial -2
max 4
it 2
it2 4
partial -3
max 4
it 2
it2 5
partial -4
max 4
it 2
it2 6
partial -5
max 4
it 2
it2 7
partial -4
max 4
it 2
it2 8
partial -3
max 4
it 3
it2 3
partial -1
max 4
it 3
it2 4
partial -2
max 4
it 3
it2 5
partial -3
max 4
it 3
it2 6
partial -4
max 4
it 3
it2 7
partial -3
max 4
it 3
it2 8
partial -2
max 4
it 4
it2 4
partial -1
max 4
it 4
it2 5
partial -2
max 4
it 4
it2 6
partial -3
max 4
it 4
it2 7
partial -2
max 4
it 4
it2 8
partial -1
max 4
it 5
it2 5
partial -1
max 4
it 5
it2 6
partial -2
max 4
it 5
it2 7
partial -1
max 4
it 5
it2 8
partial 0
max 4
it 6
it2 6
partial -1
max 4
it 6
it2 7
partial 0
max 4
it 6
it2 8
partial 1
max 4
it 7
it2 7
partial 1
max 4
it 7
it2 8
partial 2
max 4
it 8
it2 8
partial 1
max 4

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 1

stdout:

it 1
it2 1
partial 0
max 0
it 1
it2 2
partial -1
max 1
it 2
it2 2
partial -1
max 1

▶

test_data2

✔

0.001 s

OK
function result: 1

stdout:

it 1
it2 1
partial 0
max 0
it 1
it2 2
partial 0
max 1
it 1
it2 3
partial -1
max 1
it 2
it2 2
partial 0
max 1
it 2
it2 3
partial -1
max 1
it 3
it2 3
partial -1
max 1

Code: 09:52:04 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 27 28 29 30 31 32 33 34 35 36 37 38 39 40

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
            
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            std::cout << "it " << it <<std::endl;
            std::cout << "it2 " << it2 <<std::endl;
            partial = B.at(it2) -  B.at(it - 1);
            std::cout << "partial " << partial <<std::endl;
            std::cout << "max " << max <<std::endl;
            if (partial >= 0)
                if ( (it2 - (it-1)) > max ) 
                    max = (it - (it - 1));
        }
    }
    return max;
}

Code: 09:52:14 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 27 28 29 30 31 32 33 34 35 36

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
            
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it2 - (it-1)) > max ) 
                    max = (it2 - (it - 1));
        }
    }
    return max;
}

User test case 1:

[-1, 0, -1]

User test case 2:

[-1, 0, 0, -1]

Analysis

expand all Example tests

▶

example1
first example test

✔

0.001 s

▶

example2
second example test

✔

0.001 s

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 1

▶

test_data2

✔

0.001 s

OK
function result: 2

Code: 09:52:20 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 27 28 29 30 31 32 33 34 35 36

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
            
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it2 - (it-1)) > max ) 
                    max = (it2 - (it - 1));
        }
    }
    return max;
}

User test case 1:

[-1, 0, -1]

User test case 2:

[-1, 0, 0, -1]

Analysis

expand all Example tests

▶

example1
first example test

✔

0.001 s

▶

example2
second example test

✔

0.001 s

expand all User tests

▶

test_data1

✔

0.001 s

OK
function result: 1

▶

test_data2

✔

0.001 s

OK
function result: 2

Code: 09:52:23 UTC, cpp, final, score: 63

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 36

// 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;
#include <vector>

int solution(vector<int> &A) {
    std::vector <int> B;
    int len = A.size();
    int it;
    int max = 0;
    int partial = 0;
    B = A;
    
    for (it = 0 ; it < len; ++it)
    {
        if (it != 0)
            B.at(it) = B.at(it) + B.at(it-1);
            
        if (B.at(it) >= 0)
            max = it + 1;
    }//end for
    
    for (it = 1; it < len; ++it)
    {
        for (int it2 = it; it2 < len; ++it2)
        {
            partial = B.at(it2) -  B.at(it - 1);
            if (partial >= 0)
                if ( (it2 - (it-1)) > max ) 
                    max = (it2 - (it - 1));
        }
    }
    return max;
}

Analysis summary

The following issues have been detected: timeout errors.

Analysis

Detected time complexity:

O(N**2)

expand all Example tests

▶

example1
first example test

✔

0.001 s

▶

example2
second example test

✔

0.001 s

expand all Correctness tests

▶

simple
small simple tests

✔

0.001 s

▶

nonnegative_sum
array with non-negative sum

✔

0.001 s

▶

sorted_asc
array with negative sum, sorted ascendingly

✔

0.001 s

▶

sorted_desc
array with negative sum, sorted descendingly

✔

0.001 s

▶

tricky_sequence
array in form [1]*a + [-1]*b + [1]*c, a + c = b

✔

0.001 s

expand all Correctness/performance tests

▶

medium_thue_morse
medium-length Thue-Morse word with 0 changed to -1

✔

0.001 s

expand all Performance tests

▶

medium_random
random array N = 2000

✔

0.001 s

▶

big_random
random array N = 10000

✘

TIMEOUT ERROR
running time: 0.21 sec., time limit: 0.10 sec.

0.212 s

TIMEOUT ERROR, running time: 0.21 sec., time limit: 0.10 sec.

0.228 s

TIMEOUT ERROR, running time: 0.23 sec., time limit: 0.10 sec.

0.260 s

TIMEOUT ERROR, running time: 0.26 sec., time limit: 0.10 sec.

▶

large_all_prefixes_positive
large array with all prefixes positive

✘

TIMEOUT ERROR
running time: 1.57 sec., time limit: 0.10 sec.

1.572 s

TIMEOUT ERROR, running time: 1.57 sec., time limit: 0.10 sec.

2.768 s

TIMEOUT ERROR, running time: 2.77 sec., time limit: 0.10 sec.

6.000 s

TIMEOUT ERROR, running time: >6.00 sec., time limit: 0.10 sec.

▶

max_random
random array N = 100000

✘

TIMEOUT ERROR
running time: >6.00 sec., time limit: 0.10 sec.

6.000 s

TIMEOUT ERROR, running time: >6.00 sec., time limit: 0.10 sec.

5.948 s

TIMEOUT ERROR, running time: 5.95 sec., time limit: 0.10 sec.

6.000 s

TIMEOUT ERROR, running time: >6.00 sec., time limit: 0.10 sec.

▶

max_fibonacci
array of fibonacci words N = 100000

✘

TIMEOUT ERROR
running time: 4.86 sec., time limit: 0.10 sec.

4.860 s

TIMEOUT ERROR, running time: 4.86 sec., time limit: 0.10 sec.