# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244330 | MatesV13 | Palinilap (COI16_palinilap) | C++11 | 1093 ms | 640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
string s; int ans;
int solve(){
int sol=0;
for (int i=0; i<s.size(); i++){
for (int j=0; true; j++){
if (i<j or i+j>=s.size()) break;
if (s[i+j]!=s[i-j]) break;
sol++;
}
}
for (int i=0; i<s.size(); i++){
for (int j=0; true; j++){
if (i<j+1 or i+j>=s.size()) break;
if (s[i+j]!=s[i-j-1]) break;
sol++;
}
}
return sol;
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> s; ans=0;
for (int i=0; i<s.size(); i++){
char real=s[i];
for (char j='a'; j<='z'; j++){
s[i]=j; ans = max(ans, solve());
} s[i]=real;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |