結果

問題 No.430 文字列検索
ユーザー tanzakutanzaku
提出日時 2016-10-02 22:31:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 132 ms / 2,000 ms
コード長 7,760 bytes
コンパイル時間 4,438 ms
コンパイル使用メモリ 90,496 KB
実行使用メモリ 46,596 KB
最終ジャッジ日時 2024-11-10 00:01:20
合計ジャッジ時間 4,959 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
37,576 KB
testcase_01 AC 132 ms
46,596 KB
testcase_02 AC 105 ms
41,660 KB
testcase_03 AC 103 ms
41,728 KB
testcase_04 AC 47 ms
37,064 KB
testcase_05 AC 46 ms
37,280 KB
testcase_06 AC 47 ms
37,312 KB
testcase_07 AC 47 ms
37,376 KB
testcase_08 AC 61 ms
38,204 KB
testcase_09 AC 51 ms
37,472 KB
testcase_10 AC 51 ms
37,428 KB
testcase_11 AC 126 ms
45,980 KB
testcase_12 AC 125 ms
46,004 KB
testcase_13 AC 127 ms
46,320 KB
testcase_14 AC 118 ms
45,892 KB
testcase_15 AC 113 ms
42,452 KB
testcase_16 AC 108 ms
42,228 KB
testcase_17 AC 105 ms
42,308 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	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) {
			String S = io.nextString();
			int M = io.nextInt();
			AhoCorasick aho = new AhoCorasick();
			for(int i = 0; i < M; i++) {
				aho.makeTrie(i, io.nextString());
			}
			aho.makeFailureLink();
			long ans = 0;
			AhoCorasick.PMA pma = aho.root;
			for(int i = 0; i < S.length(); i++) {
				int j = S.charAt(i) - 'A';
				pma = pma.next[j];
				ans += pma.accept.size();
			}
			io.out.println(ans);
		}
	}
	
	static
	public class AhoCorasick {
		private static final int PATTERN = 26;
		
		public static class PMA {
			PMA failureLink;
			final PMA[] next = new PMA[PATTERN];
			List<Integer> accept = new ArrayList<Integer>();
		}

		private final PMA root = new PMA();
		public PMA getRoot() { return root; }
		
		
		public AhoCorasick() { }
		public AhoCorasick(final String[] patterns) {
			makeTrie(patterns);
			makeFailureLink();
		}

		private void makeTrie(final String[] patterns) {
			for(int i = 0; i < patterns.length; i++) {
				makeTrie(i, patterns[i]);
			}
		}

		private void makeTrie(final int idx, final char[] pattern) {
			PMA pma = root;
			for(int i = 0; i < pattern.length; i++) {
				pma = nextPMA(pma, pattern[i]);
			}
			pma.accept.add(idx);
		}

		private void makeTrie(final int idx, final String pattern) {
			PMA pma = root;
			for(int i = 0; i < pattern.length(); i++) {
				pma = nextPMA(pma, pattern.charAt(i));
			}
			pma.accept.add(idx);
		}
		
		private PMA nextPMA(final PMA pma, int c) {
			c -= 'A';
			if(pma.next[c] == null) {
				pma.next[c] = new PMA();
			}
			return pma.next[c];
		}
		
		private void makeFailureLink() {
//			int s = 0, t = 0; final PMA[] q = new PMA[799680 * 2];
			final Queue<PMA> q = new LinkedList<PMA>();
			root.failureLink = root;
			for(int i = 0; i < root.next.length; i++) {
				if(root.next[i] == null) {
					root.next[i] = root;
				} else {
					root.next[i].failureLink = root;
//					q[t++] = root.next[i];
					q.add(root.next[i]);
				}
			}

			while(!q.isEmpty()) {
//			while(s != t) {
				final PMA p = q.poll();
//				final PMA p = q[s++];
				for(int i = 0; i < p.next.length; i++) {
					if(p.next[i] == null) {
						p.next[i] = p.failureLink.next[i];
					} else {
						for(PMA fail = p.failureLink; ; fail = fail.failureLink) {
							if(fail.next[i] != null) {
								p.next[i].failureLink = fail.next[i];
								p.next[i].accept.addAll(fail.next[i].accept);
//								p.next[i].val = (p.next[i].val + fail.next[i].val) % mod;
								q.add(p.next[i]);
//								q[t++] = p.next[i];
								break;
							}
						}
					}
				}
			}
		}
	}


	/// 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; }
	
	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 Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[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 int 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 { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int 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 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 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; }
	}
}
0