結果
| 問題 | No.263 Common Palindromes Extra |
| ユーザー |
 tanzaku
|
| 提出日時 | 2016-12-18 02:06:55 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
MLE
|
| 実行時間 | - |
| コード長 | 9,932 bytes |
| コンパイル時間 | 5,117 ms |
| コンパイル使用メモリ | 86,488 KB |
| 実行使用メモリ | 382,632 KB |
| 最終ジャッジ日時 | 2024-05-08 06:08:51 |
| 合計ジャッジ時間 | 12,384 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | MLE | - |
| testcase_01 | AC | 56 ms
50,016 KB |
| testcase_02 | AC | 58 ms
50,432 KB |
| testcase_03 | AC | 137 ms
55,592 KB |
| testcase_04 | AC | 249 ms
64,556 KB |
| testcase_05 | AC | 189 ms
62,216 KB |
| testcase_06 | AC | 103 ms
53,928 KB |
| testcase_07 | TLE | - |
| testcase_08 | TLE | - |
| testcase_09 | MLE | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
ソースコード
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.*;
public class _263 {
private static final int mod = (int)1e9+7;
final Random random = new Random(0);
final IOFast io = new IOFast();
/// MAIN CODE
public void run() throws IOException {
// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
int TEST_CASE = 1;
while(TEST_CASE-- != 0) {
char[] S = io.next();
char[] T = io.next();
PalindromicTree t1 = new PalindromicTree(S);
t1.prepare();
PalindromicTree t2 = new PalindromicTree(T);
t2.prepare();
long ans = 0;
ans += PalindromicTree.dfs(t1.rootEven, t2.rootEven);
ans += PalindromicTree.dfs(t1.rootOdd, t2.rootOdd);
io.out.println(ans);
}
}
static
public class PalindromicTree {
static class Node {
// public Node(int len, String s) {
public Node(int len) {
this.len = len;
// this.s = s;
}
long cnt;
int len;
int in;
Node suffixLink;
Node[] next = new Node[26]; // この回文に文字cを付与した回文へのリンク
// String s;
// @Override
// public String toString() {
// // TODO Auto-generated method stub
// String res = "str:[" + s + "]";
// return res;
// }
}
void prepare() {
List<Node> xs = new ArrayList<>();
prepare0(rootEven, xs);
prepare0(rootOdd, xs);
prepare1(xs);
// prepare(rootEven);
// prepare(rootOdd);
}
void prepare0(Node n, List<Node> xs) {
Stack<Node> st = new Stack<>();
st.push(n);
while (!st.isEmpty()) {
n = st.pop();
xs.add(n);
n.suffixLink.in++;
for (Node t : n.next) if (t != null) {
// prepare0(t, xs);
st.push(t);
}
}
}
void prepare1(List<Node> xs) {
Node[] q = new Node[xs.size()];
int s = 0, t = 0;
for (Node n : xs) {
// dump("in", n.s, n.in);
if (n.in == 0) q[t++] = n;
}
while (s != t) {
Node n = q[s++];
// n.suffixLink.cnt += n.suffixLink.len <= n.len/2 ? 1 : 2;
n.suffixLink.cnt += n.cnt;
// dump(n.s, n.suffixLink.s);
if (--n.suffixLink.in == 0) {
q[t++] = n.suffixLink;
}
}
}
long prepare(Node n) {
if (n.next != null) {
for (Node t : n.next) if (t != null) {
// n.cnt += prepare(t, c + s + c);
prepare(t);
}
}
// dump(s, n, n.cnt);
return n.cnt;
}
// static long dfs(Node n1, Node n2) {
// if (n1 == null || n2 == null) return 0;
// long ans = 0;
// if (n1.len > 0) ans += n1.cnt * n2.cnt;
//// dump(n1.s, n2.s, n1.cnt, n2.cnt);
// if (n1.next != null || n2.next != null) {
// for (int i = 0; i < 26; i++) {
// ans += dfs(n1.next[i], n2.next[i]);
// }
// }
// return ans;
// }
static long dfs(Node n1, Node n2) {
Stack<Node[]> st = new Stack<>();
st.push(new Node[]{n1,n2});
HashSet<Node> vis = new HashSet<>();
HashMap<Node, Long> ans = new HashMap<>();
while (!st.isEmpty()) {
Node[] ns = st.pop();
if (ns[0] == null || ns[1] == null) continue;
if (vis.add(ns[0])) {
st.push(ns);
for (int i = 0; i < 26; i++) {
st.push(new Node[]{ns[0].next[i], ns[1].next[i]});
}
} else {
long v = 0;
if (ns[0].len > 0) v = ns[0].cnt * ns[1].cnt;
for (int i = 0; i < 26; i++) {
if (ns[0].next[i] == null) continue;
// dump(ns[0], ns[1]);
v += ans.getOrDefault(ns[0].next[i], 0L);
}
ans.put(ns[0], v);
}
}
return ans.get(n1);
}
char[] cs;
private Node next(Node n, int i) {
// dump(1, n, n.len);
while (true) {
final int l = i - (n.len + 1);
// dump("search: ", n, l, i);
if (l >= 0 && cs[l] == cs[i]) {
// dump("find: ", n, l, i);
break;
}
// dump(i, l, n.len);
if (n == n.suffixLink) throw new RuntimeException();
n = n.suffixLink;
}
int to = cs[i] - 'A';
if (n.next[to] == null) {
// n.next[to] = new Node(n.len + 2, cs[i] + n.s + cs[i]);
n.next[to] = new Node(n.len + 2);
// dump(2, n.len, next(n.suffixLink, i).len);
n.next[to].suffixLink = next(n.suffixLink, i);
if (n.next[to].suffixLink == n.next[to]) {
n.next[to].suffixLink = rootEven;
}
// dump(n, n.next[to], n.next[to].suffixLink);
}
return n.next[to];
}
final int ALPHABET_SIZE = 26;
Node rootOdd;
Node rootEven;
Node[] nodes;
public PalindromicTree(char[] cs) {
this.cs = cs;
// 長さ-1,0のノードを作成
// rootEven = new Node(0, "");
// rootOdd = new Node(-1, "$");
rootEven = new Node(0);
rootOdd = new Node(-1);
rootEven.suffixLink = rootOdd;
rootOdd.suffixLink = rootOdd;
Node cur = rootEven;
nodes = new Node[cs.length];
for (int i = 0; i < cs.length; i++) {
// dump("func", i);
nodes[i] = cur = next(cur, i);
cur.cnt++;
}
}
}
/// TEMPLATE
static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); }
void main() throws IOException {
// IOFast.setFileIO("rle-size.in", "rle-size.out");
try { run(); }
catch (EndOfFileRuntimeException e) { }
io.out.flush();
}
public static void main(String[] args) throws IOException { new _263().main(); }
static class EndOfFileRuntimeException extends RuntimeException {
private static final long serialVersionUID = -8565341110209207657L; }
static
public class IOFast {
private InputStream in = System.in;
private PrintWriter out = new PrintWriter(System.out);
private static int pos, readLen;
private static final byte[] buffer = new byte[1024 * 8];
private static char[] str = new char[500*8*2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];
static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
public byte read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
public int nextInt() throws IOException {
byte first = (byte)nextChar();
boolean minus = false;
int res = 0;
if (first == '-') {
minus = true;
} else {
res = first - '0';
}
while (true) {
byte b = read();
if (isSpace[b]) break;
res = res * 10 + b - '0';
}
return minus ? -res : res;
}
public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
public String nextString() throws IOException { return new String(next()); }
public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
// public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
// public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
public double nextDouble() throws IOException {
double res = nextChar() - '0';
while (true) {
byte c = read();
if (isSpace[c]) return res;
if (c == '.') break;
res = res * 10 + c - '0';
}
double d = 1;
while (true) {
byte c = read();
// dump(c);
if (!isDigit[c]) break;
res = res * 10 + c - '0';
d *= 10;
}
// dump(1);
return res / d;
}
public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
}
}