Tasks Details
medium
1.
Peaks
Divide an array into the maximum number of same-sized blocks, each of which should contain an index P such that A[P - 1] < A[P] > A[P + 1].
Task Score
72%
Correctness
66%
Performance
80%
A non-empty array A consisting of N integers is given.
A peak is an array element which is larger than its neighbors. More precisely, it is an index P such that 0 < P < N − 1, A[P − 1] < A[P] and A[P] > A[P + 1].
For example, the following array A:
A[0] = 1 A[1] = 2 A[2] = 3 A[3] = 4 A[4] = 3 A[5] = 4 A[6] = 1 A[7] = 2 A[8] = 3 A[9] = 4 A[10] = 6 A[11] = 2has exactly three peaks: 3, 5, 10.
We want to divide this array into blocks containing the same number of elements. More precisely, we want to choose a number K that will yield the following blocks:
- A[0], A[1], ..., A[K − 1],
- A[K], A[K + 1], ..., A[2K − 1],
...- A[N − K], A[N − K + 1], ..., A[N − 1].
What's more, every block should contain at least one peak. Notice that extreme elements of the blocks (for example A[K − 1] or A[K]) can also be peaks, but only if they have both neighbors (including one in an adjacent blocks).
The goal is to find the maximum number of blocks into which the array A can be divided.
Array A can be divided into blocks as follows:
- one block (1, 2, 3, 4, 3, 4, 1, 2, 3, 4, 6, 2). This block contains three peaks.
- two blocks (1, 2, 3, 4, 3, 4) and (1, 2, 3, 4, 6, 2). Every block has a peak.
- three blocks (1, 2, 3, 4), (3, 4, 1, 2), (3, 4, 6, 2). Every block has a peak. Notice in particular that the first block (1, 2, 3, 4) has a peak at A[3], because A[2] < A[3] > A[4], even though A[4] is in the adjacent block.
However, array A cannot be divided into four blocks, (1, 2, 3), (4, 3, 4), (1, 2, 3) and (4, 6, 2), because the (1, 2, 3) blocks do not contain a peak. Notice in particular that the (4, 3, 4) block contains two peaks: A[3] and A[5].
The maximum number of blocks that array A can be divided into is three.
Write a function:
class Solution { public int solution(int[] A); }
that, given a non-empty array A consisting of N integers, returns the maximum number of blocks into which A can be divided.
If A cannot be divided into some number of blocks, the function should return 0.
For example, given:
A[0] = 1 A[1] = 2 A[2] = 3 A[3] = 4 A[4] = 3 A[5] = 4 A[6] = 1 A[7] = 2 A[8] = 3 A[9] = 4 A[10] = 6 A[11] = 2the function should return 3, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [0..1,000,000,000].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 8
Time spent on task 7 minutes
Notes
not defined yet
Task timeline
Code: 02:24:41 UTC,
java,
autosave
Code: 02:24:49 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:25:34 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(N);
for(int i=1; i<=sq; i++){
if(N%i == 0){
if((i + (N/i)) * 2 < min){
min =(i + (N/i)) * 2;
}
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:25:44 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(N);
for(int i=1; i<=sq; i++){
if(N%i == 0){
if((i + (N/i)) * 2 < min){
min =(i + (N/i)) * 2;
}
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:25:58 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(N);
for(int i=1; i<=sq; i++){
if(N%i == 0){
if((i + (N/i)) * 2 < min){
min =(i + (N/i)) * 2;
}
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:26:32 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(N);
for(int i=1; i<=sq; i++){
if(N%i == 0){
if((i + (N/i)) * 2 < min){
min =(i + (N/i)) * 2;
}
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:26:57 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(N);
for(int i=1; i<=sq; i++){
if(N%i == 0){
list.add(i);
lastlist.add()
if((i + (N/i)) * 2 < min){
min =(i + (N/i)) * 2;
}
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:27:07 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(A.length);
for(int i=1; i<=sq; i++){
if(N%i == 0){
list.add(i);
lastlist.add()
if((i + (N/i)) * 2 < min){
min =(i + (N/i)) * 2;
}
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:27:18 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(A.length);
for(int i=1; i<=sq; i++){
if(N%i == 0){
list.add(i);
lastlist.add(A.length/i);
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:27:29 UTC,
java,
verify,
result: Failed
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(A.length);
for(int i=1; i<=sq; i++){
if(N%i == 0){
list.add(i);
lastlist.add(0,A.length/i);
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Analysis
Compile error
Solution.java:20: error: cannot find symbol
if(N%i == 0){
^
symbol: variable N
location: class Solution
1 error
Code: 02:27:43 UTC,
java,
verify,
result: Passed
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int sq = (int)Math.sqrt(A.length);
for(int i=1; i<=sq; i++){
if(A.length%i == 0){
list.add(i);
lastlist.add(0,A.length/i);
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Analysis
Code: 02:27:48 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int
int sq = (int)Math.sqrt(A.length);
for(int i=1; i<=sq; i++){
if(A.length%i == 0){
list.add(i);
lastlist.add(0,A.length/i);
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:28:05 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:28:20 UTC,
java,
verify,
result: Passed
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
int div = 1;
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Analysis
Code: 02:28:35 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
int div = 1;
for(int k=)
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:28:46 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
int div = 1;
for(int k=0)
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:29:05 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
int div = 1;
for(int k=0; K<list.size(); K++){
}
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:29:43 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
int div = 1;
for(int k=0; K<list.size(); K++){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:29:54 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
int div = 1;
for(int k=0; K<list.size(); K++){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:30:04 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
int div = 1;
for(int k=0; K<list.size(); K++){
int cnt = 0;
int divcnt = 0;
int size = A.length / list.get(k);
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:30:21 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
int div = 1;
for(int k=0; K<list.size(); K++){
int cnt = 0;
int divcnt = 0;
int size = A.length / list.get(k);
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < list.get(k) && divcnt < list.get(k)){
break;
}else{
ans = div;
div++;
}
}
while(true){
if(A.length % div == 0){
int cnt = 0;
int divcnt = 0;
int size = A.length / div;
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < div && divcnt < div){
break;
}else{
ans = div;
div++;
}
}else {
div++;
}
}
return ans;
}
}
Code: 02:30:39 UTC,
java,
autosave
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
for(int k=0; K<list.size(); K++){
int cnt = 0;
int divcnt = 0;
int size = A.length / list.get(k);
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < list.get(k) && divcnt < list.get(k)){
break;
}else{
ans = list.get(k);
}
}
return ans;
}
}
Code: 02:30:40 UTC,
java,
verify,
result: Failed
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
for(int k=0; K<list.size(); K++){
int cnt = 0;
int divcnt = 0;
int size = A.length / list.get(k);
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < list.get(k) && divcnt < list.get(k)){
break;
}else{
ans = list.get(k);
}
}
return ans;
}
}
Analysis
Compile error
Solution.java:31: error: cannot find symbol
for(int k=0; K<list.size(); K++){
^
symbol: variable K
location: class Solution
Solution.java:31: error: cannot find symbol
for(int k=0; K<list.size(); K++){
^
symbol: variable K
location: class Solution
2 errors
Code: 02:30:51 UTC,
java,
verify,
result: Passed
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
for(int k=0; k<list.size(); k++){
int cnt = 0;
int divcnt = 0;
int size = A.length / list.get(k);
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < list.get(k) && divcnt < list.get(k)){
break;
}else{
ans = list.get(k);
}
}
return ans;
}
}
Analysis
Code: 02:30:57 UTC,
java,
verify,
result: Passed
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
for(int k=0; k<list.size(); k++){
int cnt = 0;
int divcnt = 0;
int size = A.length / list.get(k);
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < list.get(k) && divcnt < list.get(k)){
break;
}else{
ans = list.get(k);
}
}
return ans;
}
}
Analysis
Code: 02:31:01 UTC,
java,
final,
score:
72
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
ArrayList<Integer> peek = new ArrayList<>();
ArrayList<Integer> list= new ArrayList<>();
ArrayList<Integer> lastlist= new ArrayList<>();
for(int i=1; i< A.length-1; i++){
if(A[i-1] < A[i] && A[i]> A[i+1]){
peek.add(i);
}
}
int length = A.length;
int sq = (int)Math.sqrt(length);
for(int i=1; i<=sq; i++){
if(length%i == 0){
list.add(i);
lastlist.add(0,length/i);
}
}
list.addAll(lastlist);
int ans=0;
for(int k=0; k<list.size(); k++){
int cnt = 0;
int divcnt = 0;
int size = A.length / list.get(k);
for(int i=0; i<peek.size(); i++){
if(size * divcnt < peek.get(i) && size * (divcnt + 1) > peek.get(i)){
cnt++;
divcnt++;
}
}
if(cnt < list.get(k) && divcnt < list.get(k)){
break;
}else{
ans = list.get(k);
}
}
return ans;
}
}
Analysis summary
The following issues have been detected: wrong answers, timeout errors.
Analysis
expand all
Correctness tests
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
4.
0.008 s
OK
5.
0.008 s
OK
1.
0.008 s
OK
1.
0.004 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
1.
0.008 s
OK
1.
0.004 s
WRONG ANSWER,
got 2 expected 4
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
1.
0.004 s
WRONG ANSWER,
got 2 expected 4
2.
0.008 s
OK
expand all
Performance tests
1.
0.032 s
OK
2.
0.016 s
OK
1.
0.020 s
OK
1.
0.300 s
OK
2.
0.148 s
OK
large_anti_slow
large test anti slow solutions
large test anti slow solutions
✘
TIMEOUT ERROR
running time: 1.244 sec., time limit: 0.608 sec.
running time: 1.244 sec., time limit: 0.608 sec.
1.
0.140 s
OK
2.
1.244 s
TIMEOUT ERROR,
running time: 1.244 sec., time limit: 0.608 sec.
1.
0.648 s
OK
2.
0.360 s
OK