結果

問題 No.430 文字列検索
ユーザー GrenacheGrenache
提出日時 2016-10-02 22:46:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 536 ms / 2,000 ms
コード長 4,428 bytes
コンパイル時間 3,414 ms
コンパイル使用メモリ 79,648 KB
実行使用メモリ 78,144 KB
最終ジャッジ日時 2024-11-10 00:02:13
合計ジャッジ時間 7,793 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
36,812 KB
testcase_01 AC 536 ms
76,876 KB
testcase_02 AC 277 ms
47,992 KB
testcase_03 AC 251 ms
47,776 KB
testcase_04 AC 47 ms
37,192 KB
testcase_05 AC 46 ms
36,984 KB
testcase_06 AC 48 ms
37,124 KB
testcase_07 AC 45 ms
37,116 KB
testcase_08 AC 509 ms
78,144 KB
testcase_09 AC 47 ms
37,060 KB
testcase_10 AC 118 ms
46,396 KB
testcase_11 AC 276 ms
52,064 KB
testcase_12 AC 300 ms
52,556 KB
testcase_13 AC 296 ms
52,324 KB
testcase_14 AC 282 ms
50,464 KB
testcase_15 AC 272 ms
49,140 KB
testcase_16 AC 261 ms
47,664 KB
testcase_17 AC 268 ms
47,324 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder430 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		String s = sc.next();
		int n = s.length();

		int m = sc.nextInt();
		String[] c = new String[m];
		for (int i = 0; i < m; i++) {
			c[i] = sc.next();
		}

		Map<String, Integer> hm = new HashMap<>();
		for (int i = 1; i <= 10; i++) {
			for (int j = 0; j + i <= n; j++) {
				String tmp = s.substring(j, j + i);
				if (hm.containsKey(tmp)) {
					hm.put(tmp, hm.get(tmp) + 1);
				} else {
					hm.put(tmp, 1);
				}
			}
		}

		int ret = 0;
		for (int i = 0; i < m; i++) {
			if (hm.containsKey(c[i])) {
				ret += hm.get(c[i]);
			}
		}

		pr.println(ret);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0