/**
 * 100/100
 * @param S
 * @param P
 * @param Q
 * @return
 */
fun solution(S: String, P: IntArray, Q: IntArray): IntArray? {
    val genomePrefixSums = formGenomePrefixSums(S)
    val result = IntArray(P.size)
    for (i in P.indices) {
        val fromIndex = P[i]
        val toIndex = Q[i] + 1
        if (genomePrefixSums[0][toIndex] - genomePrefixSums[0][fromIndex] > 0) {
            result[i] = 1
        } else if (genomePrefixSums[1][toIndex] - genomePrefixSums[1][fromIndex] > 0) {
            result[i] = 2
        } else if (genomePrefixSums[2][toIndex] - genomePrefixSums[2][fromIndex] > 0) {
            result[i] = 3
        } else {
            result[i] = 4
        }
    }
    return result
}

fun formGenomePrefixSums(S: String): Array<IntArray> {
    val genomePrefixSums = Array(3) { IntArray(S.length + 1) }
    var a: Int
    var c: Int
    var g: Int
    for (i in 0 until S.length) {
        a = 0
        c = 0
        g = 0
        if (S[i] == 'A') {
            a = 1
        } else if (S[i] == 'C') {
            c = 1
        } else if (S[i] == 'G') {
            g = 1
        }
        genomePrefixSums[0][i + 1] = genomePrefixSums[0][i] + a
        genomePrefixSums[1][i + 1] = genomePrefixSums[1][i] + c
        genomePrefixSums[2][i + 1] = genomePrefixSums[2][i] + g
    }
    return genomePrefixSums
}

/**
 * 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] = 6
 * The 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] = 6
 * the 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, 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.
 */
/**
 * 100/100
 * @param S
 * @param P
 * @param Q
 * @return
 */
fun solution(S: String, P: IntArray, Q: IntArray): IntArray? {
    val genomePrefixSums = formGenomePrefixSums(S)
    val result = IntArray(P.size)
    for (i in P.indices) {
        val fromIndex = P[i]
        val toIndex = Q[i] + 1
        if (genomePrefixSums[0][toIndex] - genomePrefixSums[0][fromIndex] > 0) {
            result[i] = 1
        } else if (genomePrefixSums[1][toIndex] - genomePrefixSums[1][fromIndex] > 0) {
            result[i] = 2
        } else if (genomePrefixSums[2][toIndex] - genomePrefixSums[2][fromIndex] > 0) {
            result[i] = 3
        } else {
            result[i] = 4
        }
    }
    return result
}

fun formGenomePrefixSums(S: String): Array<IntArray> {
    val genomePrefixSums = Array(3) { IntArray(S.length + 1) }
    var a: Int
    var c: Int
    var g: Int
    for (i in 0 until S.length) {
        a = 0
        c = 0
        g = 0
        if (S[i] == 'A') {
            a = 1
        } else if (S[i] == 'C') {
            c = 1
        } else if (S[i] == 'G') {
            g = 1
        }
        genomePrefixSums[0][i + 1] = genomePrefixSums[0][i] + a
        genomePrefixSums[1][i + 1] = genomePrefixSums[1][i] + c
        genomePrefixSums[2][i + 1] = genomePrefixSums[2][i] + g
    }
    return genomePrefixSums
}

/**
 * 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] = 6
 * The 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] = 6
 * the 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, 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.
 */