oj.uz

Submission #104702

# Submission time Handle Problem Language Result Execution time Memory
104702 2019-04-09T01:00:35 Z Shtef Palinilap (COI16_palinilap) C++14
17 / 100
 1000 ms 1536 KB 
#include <iostream>

using namespace std;

typedef long long ll;

string s;
int n, cnt1[100005], cnt2[100005];

ll brojpalin(){
	ll ret = 0;
	int l = 0, r = -1;
	for(int i = 0 ; i < n ; ++i){
		int k = (i > r ? 1 : min(cnt1[l + r - i], r - i + 1));
		while(i - k >= 0 && i + k < n && s[i - k] == s[i + k]){
			k++;
		}
		cnt1[i] = k--;
		if(i + k > r){
			l = i - k;
			r = i + k;
		}
		ret += k + 1;
	}
	l = 0;
	r = -1;
	for(int i = 0 ; i < n ; ++i){
		int k = (i > r ? 0 : min(cnt2[l + r - i + 1], r - i + 1));
		while(i - k - 1 >= 0 && i + k < n && s[i - k - 1] == s[i + k]){
			k++;
		}
		cnt2[i] = k--;
		if(i + k > r){
			l = i - k - 1;
			r = i + k;
		}
		ret += k + 1;
	}
	return ret;
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
n = (int)s.size();
ll sol = brojpalin();
for(int i = 0 ; i < n ; ++i){
	char poc = s[i];
	for(int j = 0 ; j < 26 ; ++j){
		s[i] = j + 'a';
		sol = max(sol, brojpalin());
	}
	s[i] = poc;
}
cout << sol << endl;

return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 46.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 1536 KB Time limit exceeded
2 Halted 0 ms 0 KB -