Longest palindrome

#include <bits/stdc++.h>
using namespace std;

int main() {
	string s;
	cin >> s;
	s = s + '#';
	int ml = 0, mr = 0;
	int cl = 0, cr = 0;
	int ss = s.size()-1;

	for (int i=1; i<ss; i++) {
		cr = i; cl = i;
		if (s[i-1] == s[i] && s[i] != s[i+1]) {
			cl = i-1;
		}
		while (cl > 0 && cr < ss && s[cl-1] == s[cr+1]) {
			cl--;
			cr++;
		}
		if (cr-cl > mr-ml) {
			mr = cr;
			ml = cl;
		}
	}
	for (int i=ml; i<=mr; i++) {
		cout << s[i];
	}
}

Test 1

Verdict: WRONG ANSWER

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: WRONG ANSWER

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