結果

問題 No.430 文字列検索
ユーザー ぴろずぴろず
提出日時 2016-10-02 22:57:32
言語 Java21
(openjdk 21)
結果
AC  
実行時間 115 ms / 2,000 ms
コード長 4,418 bytes
コンパイル時間 2,308 ms
コンパイル使用メモリ 74,916 KB
実行使用メモリ 56,912 KB
最終ジャッジ日時 2023-08-15 17:23:14
合計ジャッジ時間 4,532 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
49,348 KB
testcase_01 AC 102 ms
56,912 KB
testcase_02 AC 102 ms
53,288 KB
testcase_03 AC 101 ms
52,780 KB
testcase_04 AC 40 ms
49,300 KB
testcase_05 AC 41 ms
49,204 KB
testcase_06 AC 40 ms
49,296 KB
testcase_07 AC 40 ms
49,348 KB
testcase_08 AC 77 ms
50,844 KB
testcase_09 AC 47 ms
49,500 KB
testcase_10 AC 50 ms
49,464 KB
testcase_11 AC 115 ms
55,404 KB
testcase_12 AC 113 ms
55,392 KB
testcase_13 AC 115 ms
55,848 KB
testcase_14 AC 106 ms
55,028 KB
testcase_15 AC 104 ms
54,780 KB
testcase_16 AC 110 ms
55,572 KB
testcase_17 AC 110 ms
55,212 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no430a;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
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;
		Node root = new Node();
		for(int i=0;i<m;i++) {
			root.append(io.next(), 0);
		}
		for(int i=0;i<s.length();i++) {
			Node now = root;
			int idx = i;
			while(now != null) {
				if (now.finish) sum++;
				if (idx >= s.length()) break;
				now = now.next[s.charAt(idx)-'A'];
				idx++;
			}
		}
		System.out.println(sum);
	}

}
class Node {
	Node[] next = new Node[26];
	boolean finish = false;
	void append(String s,int i) {
		if (s.length() == i) {
			finish = true;
			return;
		}
		int x = s.charAt(i) - 'A';
		if (next[x] == null) {
			next[x] = new Node();
		}
		next[x].append(s, i + 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