Longest palindrome

#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <string>

using namespace std;


int main() {
    string s;
    cin >> s;
    int n = s.size();

    if (n == 0)
        cout << ""<<endl;
    
    int start = 0, maxLen = 1;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= 1; j++) {
            int ini = i;
            int end = i + j; 
            while (ini >= 0 && end < n && s[ini] == s[end]) {
                int currLen = end - ini + 1;
                if (currLen > maxLen) {
                    start = ini;
                    maxLen = currLen;
                }
                ini--;
                end++;
            }
        }
    }

    cout << s.substr(start, maxLen) << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: TIME LIMIT EXCEEDED