oj.uz

답안 #173652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173652 2020-01-04T19:18:00 Z Nucleist 회문 (APIO14_palindrome) C++14
8 / 100
 1000 ms 12512 KB 
#include<bits/stdc++.h> 
using namespace std; 
string substring(string s,int a,int b) 
{ 
    string s1=""; 
    for(int i = a; i < b; i++) 
        s1 = s1 + s[i]; 
          
    return s1; 
} 
vector<string> allPalindromeSubstring(string s) 
{ 
    vector<string> v ; 
    for (float pivot = 0; pivot < s.length(); 
                                 pivot += .5) 
    { 
        float palindromeRadius = pivot -  
                                  (int)pivot; 
        while ((pivot + palindromeRadius) 
         < s.length() && (pivot - palindromeRadius)  
         >= 0 && s[((int)(pivot - palindromeRadius))] 
             == s[((int)(pivot + palindromeRadius))]) 
        { 
  
            v.push_back(substring(s,(int)(pivot -  
                     palindromeRadius), (int)(pivot  
                           + palindromeRadius + 1))); 
            palindromeRadius++; 
        } 
    } 
  
    return v; 
} 
vector<int> rabin_karp(string const& s, string const& t) {
    const int p = 31; 
    const int m = 1e9 + 9;
    int S = s.size(), T = t.size();

    vector<long long> p_pow(max(S, T)); 
    p_pow[0] = 1; 
    for (int i = 1; i < (int)p_pow.size(); i++) 
        p_pow[i] = (p_pow[i-1] * p) % m;

    vector<long long> h(T + 1, 0); 
    for (int i = 0; i < T; i++)
        h[i+1] = (h[i] + (t[i] - 'a' + 1) * p_pow[i]) % m; 
    long long h_s = 0; 
    for (int i = 0; i < S; i++) 
        h_s = (h_s + (s[i] - 'a' + 1) * p_pow[i]) % m; 

    vector<int> occurences;
    for (int i = 0; i + S - 1 < T; i++) { 
        long long cur_h = (h[i+S] + m - h[i]) % m; 
        if (cur_h == h_s * p_pow[i] % m)
            occurences.push_back(i);
    }
    return occurences;
}
int main() 
{ 
    string a;
    cin>>a;
    vector<string> v = allPalindromeSubstring(a); 
    set<string>aw;
    for(auto it:v)aw.insert(it);
    int ans=0;
    for(auto it:aw)
    {
      ans=max(ans,(int)((rabin_karp(it,a).size())*it.size()));
    }
    cout<<ans;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 9 ms 760 KB Output is correct
20 Correct 9 ms 632 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 18 ms 888 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 16 ms 888 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 26.0

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

Subtask #5
0 / 27.0

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