oj.uz

Submission #73356

# Submission time Handle Problem Language Result Execution time Memory
73356 2018-08-28T07:49:04 Z Vardanyan Palindromes (APIO14_palindrome) C++14
0 / 100
 1000 ms 8216 KB 
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 3000*100+7;
long long h1[N],h2[N];
long long p[N];
int n;
long long hashcode1(int l,int r){
    return (h1[r]-h1[l-1])*p[n-l+1];
}
long long hashcode2(int l,int r){
    return (h2[r]-h2[l-1])*p[n-l+1];
}
int main()
{
    string s;
    cin>>s;
    n = s.length();
    p[0] = 1;
    for(int i = 1;i<=n;i++) p[i] = p[i-1]*259;
    string srev = s;
    reverse(srev.begin(),srev.end());
    for(int i = 1;i<=n;i++){
        h1[i] = h1[i-1]+(s[i-1]-'0')*259;
        h2[i] = h2[i-1]+(srev[i-1]-'0')*259;
    }
    unordered_map<long long,int> mp;
    int ans = 0;
    for(int i = 1;i<=n;i++){
        for(int j = i;j<=n;j++){
            int x = hashcode1(i,j);
            int jj = n-i+1;
            int ii = n-j+1;
            int y = hashcode2(ii,jj);
            if(x == y){
                    mp[x]++;
                    ans = max(ans,(j-i+1)*mp[x]);
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 2 ms 484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 484 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 131 ms 992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

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

Subtask #5
0 / 27.0

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