oj.uz

답안 #73345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73345 2018-08-28T07:42:31 Z Vardanyan 회문 (APIO14_palindrome) C++14
0 / 100
 1000 ms 21112 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];
long long hashcode1(int l,int r){
    return h1[r]-h1[l-1]*p[r-l+1];
}
long long hashcode2(int l,int r){
    return h2[r]-h2[l-1]*p[r-l+1];
}
int main()
{
    string s;
    cin>>s;
    int n = s.length();
    p[0] = 1;
    for(int i = 1;i<=n;i++) p[i] = p[i-1]*31;
    string srev = s;
    reverse(srev.begin(),srev.end());
    for(int i = 1;i<=n;i++){
        h1[i] = h1[i-1]*31+s[i-1];
        h2[i] = h2[i-1]*31+srev[i-1];
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 3 ms 476 KB Output is correct
4 Correct 2 ms 616 KB Output is correct
5 Correct 2 ms 616 KB Output is correct
6 Correct 3 ms 616 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 2 ms 624 KB Output is correct
17 Correct 2 ms 624 KB Output is correct
18 Correct 2 ms 624 KB Output is correct
19 Correct 3 ms 748 KB Output is correct
20 Correct 3 ms 748 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 2 ms 748 KB Output is correct
23 Correct 2 ms 748 KB Output is correct
24 Correct 2 ms 748 KB Output is correct
25 Correct 3 ms 748 KB Output is correct
26 Correct 2 ms 748 KB Output is correct
27 Correct 2 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 2 ms 748 KB Output is correct
30 Correct 2 ms 748 KB Output is correct
31 Correct 2 ms 748 KB Output is correct
32 Incorrect 2 ms 748 KB Output isn't correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 748 KB Output is correct
2 Correct 8 ms 748 KB Output is correct
3 Correct 27 ms 764 KB Output is correct
4 Correct 4 ms 764 KB Output is correct
5 Correct 28 ms 764 KB Output is correct
6 Correct 27 ms 764 KB Output is correct
7 Correct 5 ms 764 KB Output is correct
8 Correct 15 ms 764 KB Output is correct
9 Correct 4 ms 764 KB Output is correct
10 Correct 3 ms 764 KB Output is correct
11 Correct 4 ms 764 KB Output is correct
12 Incorrect 6 ms 764 KB Output isn't correct

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 1276 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1080 ms 7176 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1091 ms 21112 KB Time limit exceeded
2 Halted 0 ms 0 KB -