Longest palindrome

#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

bool solve(vector<vector<bool>> &dp, int i, int j, string &s) {
    if (i == j) {
        return dp[i][j] = true;
    }
    if (j - i == 1) {
        if (s[i] == s[j]) {
            return dp[i][j] = true;
        } else {
            return dp[i][j] = false;
        }
    }
    if (s[i] == s[j] && dp[i + 1][j - 1] == true) {
        return dp[i][j] = true;
    } else {
        return dp[i][j] = false;
    }
}

string longestPalindrome(string s) {
    int n = s.size();
    int startIndex = 0;
    int maxlen = 0;
    vector<vector<bool>> dp(n, vector<bool>(n, false));
    for (int g = 0; g < n; g++) {
        for (int i = 0, j = g; j < n; i++, j++) {
            solve(dp, i, j, s);
            if (dp[i][j] == true) {
                if (j - i + 1 > maxlen) {
                    startIndex = i;
                    maxlen = j - i + 1;
                }
            }
        }
    }
    return s.substr(startIndex, maxlen);
}

int main() {
    string s;
    cin >> s;
    cout << longestPalindrome(s) << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: RUNTIME ERROR

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: RUNTIME ERROR