結果
問題 | No.430 文字列検索 |
ユーザー | buno15 |
提出日時 | 2021-10-25 21:22:33 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,845 bytes |
コンパイル時間 | 2,659 ms |
コンパイル使用メモリ | 87,392 KB |
実行使用メモリ | 52,156 KB |
最終ジャッジ日時 | 2024-11-10 00:57:36 |
合計ジャッジ時間 | 6,201 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
42,420 KB |
testcase_01 | TLE | - |
testcase_02 | -- | - |
testcase_03 | -- | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.Serializable; import java.util.ArrayList; import java.util.Arrays; import java.util.Iterator; public class Main { static final int INF = 1000000000; static final long MOD = 1000000007; static final double EPS = 1e-10; public static void main(String args[]) throws IOException { IO io = new IO(); char s[] = io.getCharArr(); int m = io.getInt(); RollingHash rh = new RollingHash(s); int ans = 0; for (int i = 0; i < m; i++) { char c[] = io.getCharArr(); RollingHash rh2 = new RollingHash(c); for (int j = 0; j < s.length - c.length + 1; j++) { if (rh.get(j, j + c.length).equals(rh2.get(0, c.length))) { ans++; } } } System.out.println(ans); } } class RollingHash { final long base1 = 1007, base2 = 2009; final long MOD1 = 1000000007, MOD2 = 1000000009; long hash1[], hash2[], power1[], power2[]; public RollingHash(char str[]) { int n = (int) str.length; hash1 = new long[n + 1]; hash2 = new long[n + 1]; power1 = new long[n + 1]; power2 = new long[n + 1]; power1[0] = 1; power2[0] = 1; for (int i = 0; i < n; i++) { hash1[i + 1] = (hash1[i] * base1 + str[i]) % MOD1; hash2[i + 1] = (hash2[i] * base2 + str[i]) % MOD2; power1[i + 1] = (power1[i] * base1) % MOD1; power2[i + 1] = (power2[i] * base2) % MOD2; } } public Pair get(int l, int r) { long res1 = hash1[r] - hash1[l] * power1[r - l] % MOD1; if (res1 < 0) res1 += MOD1; long res2 = hash2[r] - hash2[l] * power2[r - l] % MOD2; if (res2 < 0) res2 += MOD2; return new Pair(res1, res2); } class Pair { long a; long b; public Pair(long a, long b) { this.a = a; this.b = b; } @Override public boolean equals(Object o) { Pair p = (Pair) o; if (this.a == p.a && this.b == p.b) { return true; } else { return false; } } } } class IO { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); public IO() { } public void println(String str) { System.out.println(str); } public void printArr(Object o[]) { for (int i = 0; i < o.length; i++) { System.out.print(o + " "); } System.out.println(); } public int getInt() throws IOException { return Integer.parseInt(br.readLine()); } public long getLong() throws IOException { return Long.parseLong(br.readLine()); } public double getDouble() throws IOException { return Double.parseDouble(br.readLine()); } public String getLine() throws IOException { return br.readLine(); } public int[] getIntArrPrim() throws IOException { String str[] = br.readLine().split(" "); int a[] = new int[str.length]; for (int i = 0; i < str.length; i++) { a[i] = Integer.parseInt(str[i]); } return a; } public Integer[] getIntArr() throws IOException { String str[] = br.readLine().split(" "); Integer a[] = new Integer[str.length]; for (int i = 0; i < str.length; i++) { a[i] = Integer.parseInt(str[i]); } return a; } public Long[] getLongArr() throws IOException { String str[] = br.readLine().split(" "); Long a[] = new Long[str.length]; for (int i = 0; i < str.length; i++) { a[i] = Long.parseLong(str[i]); } return a; } public long[] getLongArrPrim() throws IOException { String str[] = br.readLine().split(" "); long a[] = new long[str.length]; for (int i = 0; i < str.length; i++) { a[i] = Long.parseLong(str[i]); } return a; } public String[] getStrArr(String split) throws IOException { return br.readLine().split(split); } public char[] getCharArr() throws IOException { return br.readLine().toCharArray(); } public int[][] getIntMap(int w, int h, String split) throws IOException { int a[][] = new int[h][w]; for (int i = 0; i < h; i++) { String str[] = br.readLine().split(split); for (int j = 0; j < w; j++) { a[i][j] = Integer.parseInt(str[j]); } } return a; } public long[][] getLongMap(int w, int h, String split) throws IOException { long a[][] = new long[h][w]; for (int i = 0; i < h; i++) { String str[] = br.readLine().split(split); for (int j = 0; j < w; j++) { a[i][j] = Long.parseLong(str[j]); } } return a; } public double[][] getDoubleMap(int w, int h, String split) throws IOException { double a[][] = new double[h][w]; for (int i = 0; i < h; i++) { String str[] = br.readLine().split(split); for (int j = 0; j < w; j++) { a[i][j] = Double.parseDouble(str[j]); } } return a; } public char[][] getCharMap(int w, int h, String split) throws IOException { char a[][] = new char[h][w]; for (int i = 0; i < h; i++) { String str[] = br.readLine().split(split); for (int j = 0; j < w; j++) { a[i][j] = str[j].charAt(0); } } return a; } }