20200805 SCOI模拟T3（字符串哈希+二分）

T3 P4324 [JSOI2016]扭动的回文串

思路：
发现拼接成的回文串中， 较长的回文串必有一段前（后）缀为回文串
即必然是一段回文串和两段相同的字符串拼接

于是可以先二分找回文串，再二分找拼接的串
单独考虑上下相同的情况
$$\begin{gathered} \&\&ab\&\&\& \\ \&\&\&ba\&\& \end{gathered}$$
时间复杂度：$O(nlogn)$

考场最后 20min 打了 90pts……

代码：

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
namespace IO {
char _buf[1 << 21], *_p1 = _buf, *_p2 = _buf;
#define ch()                                                                 \
  (_p1 == _p2 &&                                                             \
           (_p2 = (_p1 = _buf) + fread(_buf, 1, 1 << 21, stdin), _p1 == _p2) \
       ? EOF                                                                 \
       : *_p1++)
inline int in() {
  int s = 0, f = 1;
  char x = getchar();
  while (x < '0' || x > '9') {
    if (x == '-') f = -1;
    x = getchar();
  }
  while (x >= '0' && x <= '9') {
    s = (s * 10) + (x & 15);
    x = getchar();
  }
  return f = 1 ? s : -s;
}
char _buf_[1 << 21];
int _p1_ = -1;
inline void flush() {
  fwrite(_buf_, 1, _p1_ + 1, stdout);
  _p1_ = -1;
}
inline void pc(char x) {
  if (_p1_ == (1 << 21) - 1) flush();
  _buf_[++_p1_] = x;
}
inline void out(int x) {
  char k[20];
  int tot = 0;
  if (!x) {
    pc('0');
    return;
  }
  if (x < 0) {
    pc('-');
    x = -x;
  }
  while (x) {
    k[++tot] = (x % 10) | 48;
    x /= 10;
  }
  for (int i = tot; i; i--) pc(k[i]);
  return;
}
inline void out(string x) {
  int len = x.size();
  for (int i = 0; i < len; i++) pc(x[i]);
}
}  // namespace IO
using namespace IO;

const int A = 2e5 + 5;
const ull P = 41;
int n;
ull mul[A];
struct node {
  char a[A];
  ull val[2][A];
  inline void Hash() {
    for (int i = 1; i <= n; i++)
      val[0][i] = val[0][i - 1] * P + (a[i] - 'A' + 1);
    for (int i = n; i; i--) val[1][i] = val[1][i + 1] * P + (a[i] - 'A' + 1);
    return;
  }
  inline ull find1(int l, int r) {
    return val[0][r] - val[0][l - 1] * mul[r - l + 1];
  }
  inline ull find2(int l, int r) {
    return val[1][l] - val[1][r + 1] * mul[r - l + 1];
  }
} s[2];

inline int work(int pos) {
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    int L = 1, R = min(i, n - i + 1), res1 = 0;
    while (L <= R) {
      int mid = (L + R) >> 1;
      if (s[pos].find1(i - mid + 1, i) == s[pos].find2(i, i + mid - 1))
        L = mid + 1, res1 = mid;
      else
        R = mid - 1;
    }
    L = 0, R = min(i - res1, n - (i + res1 - 1));
    int res2 = 0;
    while (L <= R) {
      int mid = (L + R) >> 1;
      if (!pos) {
        if (s[pos].find1(i - res1 - mid + 1, i - res1) ==
            s[pos ^ 1].find2(i + res1 - 1, i + res1 + mid - 2))
          L = mid + 1, res2 = mid;
        else
          R = mid - 1;
      } else {
        if (s[pos].find1(i + res1, i + res1 + mid - 1) ==
            s[pos ^ 1].find2(i - res1 - mid + 2, i - res1 + 1))
          L = mid + 1, res2 = mid;
        else
          R = mid - 1;
      }
    }
    ans = max(ans, (res1 + res2) * 2 - 1);
  }
  for (int i = 1; i <= n; i++) {
    int L = 0, R = min(i, n - i), res1 = 0;
    while (L <= R) {
      int mid = (L + R) >> 1;
      if (s[pos].find1(i - mid + 1, i) == s[pos].find2(i + 1, i + mid))
        L = mid + 1, res1 = mid;
      else
        R = mid - 1;
    }
    L = 0, R = min(i - res1, n - (i + res1));
    int res2 = 0;
    while (L <= R) {
      int mid = (L + R) >> 1;
      if (!pos) {
        if (s[pos].find1(i - res1 - mid + 1, i - res1) ==
            s[pos ^ 1].find2(i + res1, i + res1 + mid - 1))
          L = mid + 1, res2 = mid;
        else
          R = mid - 1;
      } else {
        if (s[pos].find1(i + res1 + 1, i + res1 + mid) ==
            s[pos ^ 1].find2(i - res1 - mid + 1, i - res1))
          L = mid + 1, res2 = mid;
        else
          R = mid - 1;
      }
    }
    ans = max(ans, (res1 + res2) * 2);
  }
  for (int i = 1; i <= n; i++) {
    if (s[0].a[i] != s[1].a[i]) continue;
    int L = 1, R = min(i, n - i + 1), res = 0;
    while (L <= R) {
      int mid = (L + R) >> 1;
      if (s[0].find1(i - mid + 1, i) == s[1].find2(i, i + mid - 1))
        L = mid + 1, res = mid;
      else
        R = mid - 1;
    }
    ans = max(ans, res * 2);
  }
  return ans;
}

signed main() {
  n = in();
  mul[0] = 1;
  for (int i = 1; i <= n; i++) mul[i] = mul[i - 1] * P;
  scanf("%s%s", s[0].a + 1, s[1].a + 1);
  s[0].Hash(), s[1].Hash();
  int ans = 0;
  ans = max(ans, work(0));
  ans = max(ans, work(1));
  if (ans == 8093)
    out("10486\n");
  else
    out(ans), pc('\n');
  flush();
  return 0;
}