Longest palindrome

#include <bits/stdc++.h>
 
using namespace std;
 
//Definitions for quicker writing
#define REP(i,a,b) for (int i = a; i < b; i++)
#define clz __builtin_clz
#define ctz __builtin_ctz
#define popct __builtin_popcount
#define PB push_back
#define MP make_pair
#define F first
#define S second
 
//Typedefs for quicker writing
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int,int> pi;
typedef pair<long long, long long> pl;
 
//Max values
const long long lmx = LLONG_MAX;
const int imx = INT_MAX;
string s;
 
string manacher() {  
    string T = "#";  
    for (char c : s) {  
        T += c;  
        T += '#';  
    }  
    int n = T.length();  
    vector<int> P(n, 0);  
    int C = 0, R = 0;  
    for (int i = 0; i < n; i++) {  
        int mirr = 2 * C - i;  
        if (i < R)  
            P[i] = min(R - i, P[mirr]);  
 
        int a = i + (1 + P[i]);  
        int b = i - (1 + P[i]);  
        while (a < n && b >= 0 && T[a] == T[b]) {  
            P[i]++;  
            a++;  
            b--;  
        }  
 
        if (i + P[i] > R) {  
            C = i;  
            R = i + P[i];  
        }  
    }  
    int maxLen = *max_element(P.begin(), P.end());  
    int centerIndex = find(P.begin(), P.end(), maxLen) - P.begin();  
    int start = (centerIndex - maxLen) / 2;  
    return s.substr(start, maxLen);  
}  
 
 
int main() {
	//IO optimization
	ios::sync_with_stdio(0);
	cin.tie(0);
 
	//Read In
	cin >> s;
 
	//Main part
	
    string res = manacher();
	
	//Write out
	cout << res << "\n";
		
	//Return
	return 0;
 
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

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: ACCEPTED