Tasks Details
medium
Find the minimal nucleotide from a range of sequence DNA.
Task Score
100%
Correctness
100%
Performance
100%
A DNA sequence can be represented as a string consisting of the letters A, C, G and T, which correspond to the types of successive nucleotides in the sequence. Each nucleotide has an impact factor, which is an integer. Nucleotides of types A, C, G and T have impact factors of 1, 2, 3 and 4, respectively. You are going to answer several queries of the form: What is the minimal impact factor of nucleotides contained in a particular part of the given DNA sequence?
The DNA sequence is given as a non-empty string S = S[0]S[1]...S[N-1] consisting of N characters. There are M queries, which are given in non-empty arrays P and Q, each consisting of M integers. The K-th query (0 ≤ K < M) requires you to find the minimal impact factor of nucleotides contained in the DNA sequence between positions P[K] and Q[K] (inclusive).
For example, consider string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6The answers to these M = 3 queries are as follows:
- The part of the DNA between positions 2 and 4 contains nucleotides G and C (twice), whose impact factors are 3 and 2 respectively, so the answer is 2.
- The part between positions 5 and 5 contains a single nucleotide T, whose impact factor is 4, so the answer is 4.
- The part between positions 0 and 6 (the whole string) contains all nucleotides, in particular nucleotide A whose impact factor is 1, so the answer is 1.
Write a function:
class Solution { public int[] solution(String S, int[] P, int[] Q); }
that, given a non-empty string S consisting of N characters and two non-empty arrays P and Q consisting of M integers, returns an array consisting of M integers specifying the consecutive answers to all queries.
Result array should be returned as an array of integers.
For example, given the string S = CAGCCTA and arrays P, Q such that:
P[0] = 2 Q[0] = 4 P[1] = 5 Q[1] = 5 P[2] = 0 Q[2] = 6the function should return the values [2, 4, 1], as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- M is an integer within the range [1..50,000];
- each element of arrays P and Q is an integer within the range [0..N - 1];
- P[K] ≤ Q[K], where 0 ≤ K < M;
- string S consists only of upper-case English letters A, C, G, T.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 8
Time spent on task 26 minutes
Notes
not defined yet
Code: 04:48:00 UTC,
java,
autosave
Code: 04:48:06 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int[P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[impactFactor][i]++;
System.out.println(impactFactor);
System.out.print(memo[1][i] + " ");
System.out.print(memo[2][i] + " ");
System.out.print(memo[3][i] + " ");
System.out.print(memo[4][i] + " ");
System.out.println();
}
/*for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][i] - memo[j][] > 0) {
return ;
}
}
}*/
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:48:09 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int[P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[impactFactor][i]++;
System.out.println(impactFactor);
System.out.print(memo[1][i] + " ");
System.out.print(memo[2][i] + " ");
System.out.print(memo[3][i] + " ");
System.out.print(memo[4][i] + " ");
System.out.println();
}
/*for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][i] - memo[j][] > 0) {
return ;
}
}
}*/
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
WRONG ANSWER,
got [0, 0, 0] expected [2, 4, 1]
stdout:
2 0 1 0 0 1 1 1 0 0 3 1 1 1 0 2 1 2 1 0 2 1 3 1 0 4 1 3 1 1 1 2 3 1 1
Code: 04:49:13 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int[P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
System.out.println(impactFactor);
System.out.print(memo[1][i] + " ");
System.out.print(memo[2][i] + " ");
System.out.print(memo[3][i] + " ");
System.out.print(memo[4][i] + " ");
System.out.println();
}
/*for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][i] - memo[j][] > 0) {
return ;
}
}
}*/
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:49:30 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int[P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][i] - memo[j][] > 0) {
return ;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:49:46 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][i] - memo[j][] > 0) {
return ;
}
}
}
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:50:01 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[][] - memo[][] > 0) {
return ;
}
}
}
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:50:11 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[P[i]][] - memo[][] > 0) {
return ;
}
}
}
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:50:28 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j[P[i] + 1] - memo[][] > 0) {
return ;
}
}
}
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:50:38 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[][] > 0) {
return ;
}
}
}
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:50:49 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i]] > 0) {
return ;
}
}
}
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:51:08 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return ;
}
}
}
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:51:51 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return ;
}
}
}
r
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:52:01 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return ;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:53:25 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return ;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
Compile error
Solution.java:17: error: incompatible types: missing return value
return ;
^
Solution.java:22: error: incompatible types: int cannot be converted to int[]
return -1;
^
2 errors
Code: 04:53:30 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return 0;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:53:31 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return 0;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
Compile error
Solution.java:17: error: incompatible types: int cannot be converted to int[]
return 0;
^
Solution.java:22: error: incompatible types: int cannot be converted to int[]
return -1;
^
2 errors
Code: 04:54:03 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return ;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:54:05 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return j;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
Compile error
Solution.java:17: error: incompatible types: int cannot be converted to int[]
return j;
^
Solution.java:22: error: incompatible types: int cannot be converted to int[]
return -1;
^
2 errors
Code: 04:54:27 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return ;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:54:54 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int [] = ;
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return ;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:55:25 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
return ;
}
}
}
return -1;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:55:45 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
Compile error
Solution.java:5: error: ']' expected
int[] answer = int [P.length];
^
Solution.java:5: error: ';' expected
int[] answer = int [P.length];
^
2 errors
Code: 04:55:56 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:55:57 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:17) at Exec.run(exec.java:48) at Exec.main(exec.java:33)
Code: 04:57:01 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
Sy
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:57:15 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:17) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
0 0 0 0 0 0
Code: 04:57:32 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:57:35 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[j][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
Compile error
Solution.java:14: error: cannot find symbol
memo[j][i]++;
^
symbol: variable j
location: class Solution
1 error
Code: 04:57:52 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1] + 1;
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.008 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:17) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
3 5 6 6 1 7
Code: 04:58:02 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1] + 1;
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:58:12 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1] + 1;
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:59:22 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
int impactFactor = getImpactorFactor(S.charAt(i - 1));
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:59:38 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
int impactFactor = getImpactorFactor(S.charAt(i - 1));
memo[impactFactor][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 04:59:43 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:18) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
1 1 1 1 0 2
Code: 05:00:08 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:00:10 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.008 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:18) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
1 1 1 1 0 2
Code: 05:04:24 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:04:28 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:18) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
1 1 1 1 0 2
Code: 05:05:14 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
Sys
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:05:27 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo.length);
System.out.println(memo[j].length);
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:20) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
5 8 1 1 5 8 1 1 5 8 0 2 5 8
Code: 05:06:00 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo.length);
System.out.println(memo[j].length);
System.out.println(memo[j]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:06:01 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo.length);
System.out.println(memo[j].length);
System.out.println(memo[j]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:21) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
5 8 [I@7d4991ad 1 5 8 [I@7d4991ad 1 5 8 [I@7d4991ad 2 5 8 [I@7d4991ad
Code: 05:06:39 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo.length);
System.out.println(memo[j].length);
System.out.println(memo[j]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:07:01 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo.length);
System.out.println(memo[j].length);
System.out.println(memo[j]);
System.out.println(memo[j]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:07:09 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo.length);
System.out.println(memo[j].length);
System.out.println(memo[j]);
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:21) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
5 8 [I@7d4991ad 1 1 1 5 8 [I@7d4991ad 1 1 1 5 8 [I@7d4991ad 0 2 2 5 8 [I@7d4991ad
Code: 05:07:25 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(memo.length);
System.out.println(memo[j].length);
System.out.println(memo[j]);
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:21) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
5 8 [I@7d4991ad 1 1 5 8 [I@7d4991ad 1 1 5 8 [I@7d4991ad 0 2 5 8 [I@7d4991ad
Code: 05:08:38 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(j);
System.out.println(memo[j].length);
System.out.println(memo[j]);
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:08:54 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(j);
System.out.println([P[i] + 1);
System.out.println(Q[i] + 1);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
Compile error
Solution.java:19: error: illegal start of expression
System.out.println([P[i] + 1);
^
Solution.java:19: error: ';' expected
System.out.println([P[i] + 1);
^
Solution.java:19: error: illegal start of expression
System.out.println([P[i] + 1);
^
Solution.java:19: error: ';' expected
System.out.println([P[i] + 1);
^
4 errors
Code: 05:08:59 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; i++) {
System.out.println(j);
System.out.println(P[i] + 1);
System.out.println(Q[i] + 1);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 3 at Solution.solution(Solution.java:19) at Exec.run(exec.java:48) at Exec.main(exec.java:33)stdout:
1 3 5 1 6 6 1 1 7 1
Code: 05:09:22 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(j);
System.out.println(P[i] + 1);
System.out.println(Q[i] + 1);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:09:23 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(j);
System.out.println(P[i] + 1);
System.out.println(Q[i] + 1);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
WRONG ANSWER,
got [0, 0, 0] expected [2, 4, 1]
stdout:
1 3 5 2 3 5 3 3 5 4 3 5 1 6 6 2 6 6 3 6 6 4 6 6 1 1 7 2 1 7 3 1 7 4 1 7
Code: 05:09:48 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(j);
System.out.println(P[i] + 1);
System.out.println(Q[i] + 1);
System.out.println();
System.out.println(memo[j][P[i] + 1]);
System.out.println()
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:10:02 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
WRONG ANSWER,
got [0, 0, 0] expected [2, 4, 1]
stdout:
1 1 1 3 1 1 0 0 1 1 3 3 1 1 1 1 0 2 1 3 0 1 0 1
Code: 05:11:21 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
bre
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:11:24 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][P[i] + 1] - memo[j][Q[i] + 1] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
WRONG ANSWER,
got [0, 0, 0] expected [2, 4, 1]
stdout:
1 1 1 3 1 1 0 0 1 1 3 3 1 1 1 1 0 2 1 3 0 1 0 1
Code: 05:11:44 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][Q[i] + 1] - memo[j][P[i] + 1] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.008 s
WRONG ANSWER,
got [2, 0, 1] expected [2, 4, 1]
stdout:
1 1 1 3 1 1 3 3 1 1 1 1 0 2
Code: 05:11:50 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
if (memo[j][Q[i] + 1] - memo[j][P[i] + 1] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:12:02 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][P[i] + 1]);
System.out.println(memo[j][Q[i] + 1]);
System.out.println();
if (memo[j][Q[i] + 1] - memo[j][P[i] + 1] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:12:04 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][Q[i] + 1]);
System.out.println(memo[j][P[i] + 1]);
System.out.println();
if (memo[j][Q[i] + 1] - memo[j][P[i] + 1] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.008 s
WRONG ANSWER,
got [2, 0, 1] expected [2, 4, 1]
stdout:
1 1 3 1 1 1 3 3 1 1 1 1 2 0
Code: 05:12:34 UTC,
java,
autosave
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][Q[i] + 1]);
System.out.println(memo[j][P[i] + 1]);
System.out.println();
if (memo[j][Q[i]] - memo[j][P[i] + 1] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Code: 05:12:35 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][Q[i] + 1]);
System.out.println(memo[j][P[i] + 1]);
System.out.println();
if (memo[j][Q[i]] - memo[j][P[i] + 1] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
WRONG ANSWER,
got [2, 0, 1] expected [2, 4, 1]
stdout:
1 1 3 1 1 1 3 3 1 1 1 1 2 0
Code: 05:12:40 UTC,
java,
verify,
result: Failed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][Q[i] + 1]);
System.out.println(memo[j][P[i] + 1]);
System.out.println();
if (memo[j][Q[i]] - memo[j][P[i] + 1] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
WRONG ANSWER,
got [2, 0, 1] expected [2, 4, 1]
stdout:
1 1 3 1 1 1 3 3 1 1 1 1 2 0
Code: 05:12:47 UTC,
java,
verify,
result: Passed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
System.out.println(memo[j][Q[i] + 1]);
System.out.println(memo[j][P[i] + 1]);
System.out.println();
if (memo[j][Q[i] + 1] - memo[j][P[i]] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
expand all
Example tests
1.
0.004 s
OK
stdout:
1 1 3 1 1 1 3 3 1 1 1 1 2 0
Code: 05:13:00 UTC,
java,
verify,
result: Passed
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
if (memo[j][Q[i] + 1] - memo[j][P[i]] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}
Analysis
Code: 05:13:04 UTC,
java,
final,
score:
100
import java.util.*;
class Solution {
public int[] solution(String S, int[] P, int[] Q) {
int[] answer = new int [P.length];
int[][] memo = new int[5][S.length() + 1];
for (int i = 1; i <= S.length(); i++) {
for (int j = 1; j <= 4; j++) {
memo[j][i] = memo[j][i - 1];
}
memo[getImpactorFactor(S.charAt(i - 1))][i]++;
}
for (int i = 0; i < P.length; i++) {
for (int j = 1; j <= 4; j++) {
if (memo[j][Q[i] + 1] - memo[j][P[i]] > 0) {
answer[i] = j;
break;
}
}
}
return answer;
}
private int getImpactorFactor(char c) {
switch (c) {
case 'A':
return 1;
case 'C':
return 2;
case 'G':
return 3;
case 'T':
return 4;
}
return -1;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N + M)
expand all
Correctness tests
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.008 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.008 s
OK
1.
0.004 s
OK
1.
0.008 s
OK