#126466 (Java21) No.430 文字列検索

• 問題: No.430 文字列検索
• ユーザー: threepipes_s
• 提出日時: 2016-10-28 20:11:12
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 861 ms / 2,000 ms
• コード長: 8,581 bytes
• コンパイル時間: 3,273 ms
• コンパイル使用メモリ: 97,672 KB
• 実行使用メモリ: 74,880 KB
• 最終ジャッジ日時: 2024-05-03 07:25:58
• 合計ジャッジ時間: 9,875 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	53 ms; 37,332 KB
testcase_01	AC	861 ms; 74,880 KB
testcase_02	AC	342 ms; 53,384 KB
testcase_03	AC	387 ms; 49,852 KB
testcase_04	AC	54 ms; 37,160 KB
testcase_05	AC	53 ms; 37,228 KB
testcase_06	AC	53 ms; 37,276 KB
testcase_07	AC	55 ms; 37,276 KB
testcase_08	AC	301 ms; 52,452 KB
testcase_09	AC	57 ms; 36,868 KB
testcase_10	AC	112 ms; 40,196 KB
testcase_11	AC	515 ms; 53,060 KB
testcase_12	AC	510 ms; 52,696 KB
testcase_13	AC	498 ms; 52,976 KB
testcase_14	AC	472 ms; 51,592 KB
testcase_15	AC	448 ms; 50,444 KB
testcase_16	AC	360 ms; 49,496 KB
testcase_17	AC	374 ms; 53,520 KB

ソースコード

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Random;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
	static ContestScanner in;static Writer out;static StringBuilder sb=new StringBuilder();
	public static void main(String[] args)
	{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();
	in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}
	static void dump(int[]a){sb.setLength(0);for(int i=0;i<a.length;i++)
	sb.append(a[i]).append("\t");out.println(sb.toString().trim());}
	static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
	static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
	static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
	static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
	static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
	static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
	static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
	static void m_sort(int[]a,int s,int sz,int[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
	while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
	} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
	static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
	static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
	static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
	static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
	static void m_sort(long[]a,int s,int sz,long[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
	while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
	static void swap(long[]a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
	static void swap(int[]a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
	static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
	{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	static int binarySearchSmallerMax(int[]a,int v,int l,int r)
	{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	List<Integer>[]randomTree(int n,Random r){List<Integer>[]g=graph(n);
	for(int i=1;i<n;i++){int p=r.nextInt(i);g[p].add(i);g[i].add(p);}return g;}
	@SuppressWarnings("unchecked")
	static List<Integer>[]graph(int n){List<Integer>[]g=new List[n];
	for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
	void solve() throws NumberFormatException, IOException{
		char[] s = in.nextToken().toCharArray();
		int m = in.nextInt();
		char[][] t = new char[m][];
		long[] val = new long[s.length];
		int maxLen = 0;
		for(int i=0; i<s.length; i++){
			val[i] = s[i]-'A'+1;
		}
		for(int i=0; i<m; i++){
			t[i] = in.nextToken().toCharArray();
			maxLen = Math.max(maxLen, t[i].length);
		}
//		RollingHash rh = new RollingHash(s.length*10, 10);
		long[] stack = new long[s.length*10];
		long[] pow = initPow(10);
//		long[] inv = initInv(10);
		int idx = 0;
		maxLen = Math.min(maxLen, s.length);
		for(int i=1; i<=maxLen; i++){
			long hash = 0;
			for(int j=0; j<i; j++){
				hash = hash*base%mod;
				hash = (hash+val[j])%mod;
			}
			stack[idx++] = hash;
			for(int j=i; j<s.length; j++){
				hash = hash*base%mod;
				hash = (hash-val[j-i]*pow[i]%mod+mod)%mod + val[j];
				stack[idx++] = hash;
			}
		}
		Arrays.sort(stack, 0, idx);
		OrderedMultiSet<Long> ms = new OrderedMultiSet<>();
		for(int i=0; i<idx; i++) ms.add(stack[i]);
		int ans = 0;
		for(int i=0; i<m; i++){
			long hash = 0;
			for(int j=0; j<t[i].length; j++){
				hash = hash*base%mod;
				hash = (hash+t[i][j]-'A'+1)%mod;
			}
			ans += ms.get(hash);
		}
		System.out.println(ans);
	}

	final static long mod = 2078526727;
	final static long base = 257; // larger than 1byte prime
	
	long[] initPow(int len){
		long[] pow = new long[len+1];
		pow[0] = 1;
		for(int i=1; i<=len; i++){
			pow[i] = pow[i-1]*base%mod;
		}
		return pow;
	}
	long[] initInv(int len){
		long[] inv = new long[len+1];
		inv[0] = 1;
		final long b = modinv(base, mod);
		for(int i=1; i<=len; i++){
			inv[i] = inv[i-1]*b%mod;
		}
		return inv;
	}
	long modinv(long n, long mod){
		return modpow(n, mod-2, mod);
	}
	long modpow(long n, long a, long mod){
		long res = 1;
		while(a > 0){
			if((a&1)==1) res = res*n%mod;
			n = n*n%mod;
			a >>= 1;
		}
		return res;
	}
}

@SuppressWarnings("serial")
class MultiSet<T> extends HashMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public MultiSet<T> merge(MultiSet<T> set)
	{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
@SuppressWarnings("serial")
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
	{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
	int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
	public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
	public int hashCode(){return hash;}
	public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
	@Override
	public String toString() {
		return String.format("(%d, %d)", a, b);
	}
}
class Timer{
	long time;public void set(){time=System.currentTimeMillis();}
	public long stop(){return time=System.currentTimeMillis()-time;}
	public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
	@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
	private BufferedReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws IOException
	{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public long nextLong()throws IOException,NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt()throws NumberFormatException,IOException
	{return(int)nextLong();}
	public double nextDouble()throws NumberFormatException,IOException 
	{return Double.parseDouble(nextToken());}
	public void close() throws IOException {in.close();}
}