oj.uz

Submission #173649

# Submission time Handle Problem Language Result Execution time Memory
173649 2020-01-04T19:05:42 Z Nucleist Palindromes (APIO14_palindrome) C++14
8 / 100
 1000 ms 8768 KB 
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
vector<ll> rabin_karp(string const& s, string const& t) {
    const ll p = 31; 
    const ll m = 1e9 + 9;
    ll S = s.size(), T = t.size();

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

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

    vector<ll> occurences;
    for (ll 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()
{
  //flash;
  string a;
  cin>>a;
  ll ans=0;
  for (ll i = 0; i < a.size(); ++i)
  {
    for (ll j = i; j < a.size(); ++j)
    {
      string dol;
      ll ka=0;
      for (ll k = i; k <= j; ++k)
      {
        dol+=a[k];
      }
      string hey=dol;
      reverse(hey.begin(),hey.end());
      if(hey==dol)
      {
      ve hi = rabin_karp(dol,a);
      ka=hi.size();
      ans=max(ans,ka*(j-i+1));
      }
    }
  }
  cout<<ans;
  return 0;
}
//code the AC sol !
// BS/queue/map

Compilation message

palindrome.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
palindrome.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
palindrome.cpp: In function 'int main()':
palindrome.cpp:55:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (ll i = 0; i < a.size(); ++i)
                  ~~^~~~~~~~~~
palindrome.cpp:57:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (ll j = i; j < a.size(); ++j)
                    ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 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 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 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 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 9 ms 256 KB Output is correct
20 Correct 9 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 18 ms 256 KB Output is correct
24 Correct 7 ms 376 KB Output is correct
25 Correct 16 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 380 KB Output is correct
28 Correct 8 ms 256 KB Output is correct
29 Correct 5 ms 256 KB Output is correct
30 Correct 4 ms 376 KB Output is correct
31 Correct 3 ms 256 KB Output is correct
32 Correct 5 ms 256 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 3320 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 1079 ms 8768 KB Time limit exceeded
2 Halted 0 ms 0 KB -