# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289941 | secretweapon | 회문 (APIO14_palindrome) | C++14 | 255 ms | 131076 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 <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <iostream>
#define N 600005
using namespace std;
int P[N] = {0};
map <string,int> mp;
string tmp= "", str, nw_str;
int main() {
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
while(cin>>str) {
memset(P,0,sizeof(P));
mp.clear();
// pre processing
tmp = "$";
for(int i=0; i<str.size(); i++) {
tmp += "#";
tmp += str[i];
}
tmp += "#";
tmp += "@";
int c = 1;
int r = 2;
int n = tmp.size();
int mx = 1;
int val;
int idx, l, cnt;
for(int i=2; i<n-1; i++) {
idx = 2*c - i;
P[i] = (i > r) ? 0 : ((P[idx]>(r-i)) ? r-i : P[idx]);
while(tmp[i-P[i]]==tmp[i+P[i]]) {
nw_str = tmp.substr(i-P[i],2*P[i]+1);
cnt = mp[nw_str]++;
//cout<<tmp.substr(i-l,l*2+1)<<endl;
val = (cnt+1)*P[i];
mx = (mx < val) ? val : mx;
P[i]++;
}
P[i]--;
if((i+P[i])>r) {
r = i + P[i];
c = i;
}
}
cout<<mx<<endl;
}
return 0;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |