結果

問題 No.430 文字列検索
コンテスト
ユーザー ぴろず
提出日時 2016-10-02 22:39:56
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 5,225 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 2,237 ms
コンパイル使用メモリ 78,268 KB
実行使用メモリ 63,116 KB
最終ジャッジ日時 2024-11-10 00:01:55
合計ジャッジ時間 11,008 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 7 TLE * 4 -- * 3
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

package no430;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.Iterator;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		String s = io.next();
		int m = io.nextInt();
		int sum = 0;
		for(int i=0;i<m;i++) {
			KMPPattern pat = new KMPPattern(io.next());
			KMPMatcher mat = pat.matcher(s);
			while(mat.hasNext()) {
				mat.next();
				sum++;
			}
		}
		System.out.println(sum);
	}

}
class KMPPattern {
	String s;
	int[] fail;
	public KMPPattern(String s) {
		this.s = s;
		int m = s.length();
		fail = new int[m+1];
		int j = fail[0] = -1;
		for(int i=1;i<=m;i++) {
			while(j >= 0 && s.charAt(j) != s.charAt(i-1)) {
				j = fail[j];
			}
			fail[i] = ++j;
		}
	}
	public KMPMatcher matcher(String t) {
		return new KMPMatcher(t, s, fail);
	}
}
class KMPMatcher implements Iterator<Integer>{
	String t,s;
	int[] fail;
	int i = 0,k = 0;
	int nextbuffer = -2;
	public KMPMatcher(String t,String s,int[] fail) {
		this.t = t;
		this.s = s;
		this.fail = fail;
	}
	private int nextIndex() {
		int n = t.length();
		int m = s.length();
		for(; i < n; i++) {
			while(k >= 0 && s.charAt(k) != t.charAt(i)) {
				k = fail[k];
			}
			if (++k >= m) {
				k = fail[k];
				return ++i - m;
			}
		}
		return -1;
	}
	public Integer next() {
		if (nextbuffer == -2) {
			return nextIndex();
		}
		int ret = nextbuffer;
		nextbuffer = -2;
		return ret;
	}
	public Integer next(int fromIndex) {
		i = fromIndex;
		k = 0;
		nextbuffer = -2;
		return next();
	}
	public boolean hasNext() {
		if (nextbuffer == -2) {
			nextbuffer = nextIndex();
		}
		return nextbuffer != -1;
	}
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0