結果

問題 No.263 Common Palindromes Extra
ユーザー uwiuwi
提出日時 2015-03-31 13:16:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 449 ms / 2,000 ms
コード長 6,505 bytes
コンパイル時間 4,247 ms
コンパイル使用メモリ 87,868 KB
実行使用メモリ 104,880 KB
最終ジャッジ日時 2024-05-07 07:56:57
合計ジャッジ時間 7,991 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 158 ms
41,316 KB
testcase_01 AC 95 ms
39,936 KB
testcase_02 AC 99 ms
40,052 KB
testcase_03 AC 191 ms
42,752 KB
testcase_04 AC 260 ms
49,428 KB
testcase_05 AC 285 ms
49,176 KB
testcase_06 AC 156 ms
41,628 KB
testcase_07 AC 289 ms
57,664 KB
testcase_08 AC 308 ms
57,628 KB
testcase_09 AC 338 ms
68,592 KB
testcase_10 AC 449 ms
104,880 KB
testcase_11 AC 278 ms
49,220 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class P2292_5 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		String s = ns();
		String t = ns();
		int n = s.length(), m = t.length();
		
		nn = n;
		Node[] nodes = build((s+"${" + t).toCharArray());
		long ret = 0;
		for(int i = 2;i < nodeslen;i++){
			ret += (long)nodes[i].freq0 * nodes[i].freq1;
		}
		out.println(ret);
	}
	
	static int nn;
	static int nodeslen;
	
	public Node[] nodes; // [0]=len0, [1]=hell
	
	public static class Node
	{
		public int len, freq0, freq1;
		
		public char c;
		public Node firstChild;
		public Node sibling;
		
		public Node link;

		private Node(int len, char c) {
			this.len = len;
			this.c = c;
			this.freq0 = this.freq1 = 0;
		}
		
		public Node next(char x)
		{
			for(Node ch = this.firstChild;ch != null;ch = ch.sibling){
				if(ch.c == x)return ch;
			}
			return null;
		}
		
		public void add(Node x)
		{
			Node ch = this.firstChild;
			this.firstChild = x;
			x.sibling = ch;
		}

//			@Override
//			public String toString() {
//				return "Node [id=" + id + ", first=" + first + ", len=" + len + ", freq=" + freq + ", c=" + c
//						+ ", firstChild=" + (firstChild != null ? firstChild.id : null) + ", sibling=" + (sibling != null ? sibling.id : null)
//						+ ", link=" + (link != null ? link.id : null) + "]";
//			}
	}
	
	public static Node[] build(char[] s)
	{
		int n = s.length;
		Node zero = new Node(0, (char)0);
		Node hell = new Node(-1, (char)0);
		zero.link = hell;
		hell.link = hell;
		hell.add(zero);
		
		Node[] nodes = new Node[n+2];
		int p = 0;
		nodes[p++] = hell;
		nodes[p++] = zero;
		
		Node cur = zero; // current suffix palindrome
		for(int i = 0;i < n;i++){
			char x = s[i];
			while(i-cur.len-1 < 0 || s[i-cur.len-1] != x)cur = cur.link; // find xAx
			Node xax = cur.next(x); // already exists
			if(xax == null){
				// new subpalindrome
				xax = new Node(cur.len+2, x);
				nodes[p++] = xax;
				cur.add(xax);
				
				// make suffix link
				if(xax.len == 1){
					xax.link = zero;
				}else{
					Node b = cur.link;
					while(true){
						while(i-b.len-1 < 0 || s[i-b.len-1] != x)b = b.link; // find xBx
						Node xbx = b.next(x);
						if(xbx != null){
							xax.link = xbx;
							break;
						}
					}
				}
			}
//				tr(i, nn, i-cur.len-1, nn);
			if(i < nn){
				xax.freq0++;
			}else if(i-xax.len+1 >= nn+2){
				xax.freq1++;
			}
			
			cur = xax;
		}
		
		for(int i = p-1;i >= 2;i--){
			nodes[i].link.freq0 += nodes[i].freq0;
			nodes[i].link.freq1 += nodes[i].freq1;
		}
		
		nodeslen = p;
		return nodes;
	}
	
	public static void main(String[] args) throws Exception
	{
//		int n = 500000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		for (int i = 0; i < n; i++) {
////			sb.append("ABCDEFGHIJKLMNOPQRSTUVWXYZ");
////			sb.append("ZYXWVUTSRQPONMLKJIHGFEDCBA");
//			sb.append((char)(gen.nextInt(1)+'A'));
//		}
////		for (int i = 0; i < n/52; i++) {
////			sb.append("ABCDEFGHIJKLMNOPQRSTUVWXYZ");
////			sb.append("ZYXWVUTSRQPONMLKJIHGFEDCBA");
//////			sb.append((char)(gen.nextInt(1)+'A'));
////		}
//		sb.append("\n");
//		for (int i = 0; i < n; i++) {
////			sb.append("ABCDEFGHIJKLMNOPQRSTUVWXYZ");
////			sb.append("ZYXWVUTSRQPONMLKJIHGFEDCBA");
//			sb.append((char)(gen.nextInt(1)+'A'));
//		}
//		PrintWriter inp = new PrintWriter("c:\\temp\\in2.in");
//		inp.println(sb);
//		inp.close();
//		
//		INPUT = sb.toString();
		
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private static char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private static char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0