結果

問題 No.430 文字列検索
ユーザー mikitmikit
提出日時 2019-09-27 19:02:25
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,230 bytes
コンパイル時間 3,734 ms
コンパイル使用メモリ 80,868 KB
実行使用メモリ 58,608 KB
最終ジャッジ日時 2023-10-25 01:16:45
合計ジャッジ時間 22,210 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
54,328 KB
testcase_01 AC 602 ms
58,584 KB
testcase_02 AC 1,514 ms
58,556 KB
testcase_03 AC 897 ms
58,556 KB
testcase_04 AC 66 ms
53,704 KB
testcase_05 AC 66 ms
53,696 KB
testcase_06 AC 67 ms
53,696 KB
testcase_07 AC 68 ms
53,696 KB
testcase_08 AC 107 ms
54,796 KB
testcase_09 AC 79 ms
54,492 KB
testcase_10 AC 86 ms
52,792 KB
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 AC 1,395 ms
58,560 KB
testcase_17 AC 1,380 ms
58,568 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.stream.IntStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.nio.charset.Charset;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author mikit
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        LightScanner in = new LightScanner(inputStream);
        LightWriter out = new LightWriter(outputStream);
        FManySlimes solver = new FManySlimes();
        solver.solve(1, in, out);
        out.close();
    }

    static class FManySlimes {
        public void solve(int testNumber, LightScanner in, LightWriter out) {
            int[] s = in.string().chars().toArray();
            int ans = 0, n = in.ints();
            for (int i = 0; i < n; i++) {
                KMP kmp = new KMP(in.string());
                int offset = 0;
                while (true) {
                    offset = kmp.search(s, offset);
                    if (offset == -1) break;
                    ans++;
                    offset++;
                }
            }
            out.ans(ans).ln();
        }

    }

    static class LightScanner {
        private BufferedReader reader = null;
        private StringTokenizer tokenizer = null;

        public LightScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        public String string() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new UncheckedIOException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int ints() {
            return Integer.parseInt(string());
        }

    }

    static class KMP {
        private final int n;
        private final int[] target;
        private final int[] table;

        public KMP(int[] target) {
            this.n = target.length;
            this.target = Arrays.copyOf(target, n);
            this.table = new int[n];
            this.table[0] = -1;
            int i = 2, j = 0;
            while (i < n) {
                if (this.target[i - 1] == this.target[j]) {
                    this.table[i] = ++j;
                    i++;
                } else if (j > 0) {
                    j = this.table[j];
                } else {
                    this.table[i] = 0;
                    i++;
                }
            }
        }

        public KMP(String target) {
            this(target.chars().toArray());
        }

        public int search(int[] s, int offset) {
            int m = offset, i = 0;
            while (m + i < s.length) {
                if (target[i] == s[m + i]) {
                    if (++i == n) return m;
                } else {
                    m = m + i - table[i];
                    if (i > 0) i = table[i];
                }
            }
            return -1;
        }

    }

    static class LightWriter implements AutoCloseable {
        private final Writer out;
        private boolean autoflush = false;
        private boolean breaked = true;

        public LightWriter(Writer out) {
            this.out = out;
        }

        public LightWriter(OutputStream out) {
            this(new BufferedWriter(new OutputStreamWriter(out, Charset.defaultCharset())));
        }

        public LightWriter print(char c) {
            try {
                out.write(c);
                breaked = false;
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
            return this;
        }

        public LightWriter print(String s) {
            try {
                out.write(s, 0, s.length());
                breaked = false;
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
            return this;
        }

        public LightWriter ans(String s) {
            if (!breaked) {
                print(' ');
            }
            return print(s);
        }

        public LightWriter ans(int i) {
            return ans(Integer.toString(i));
        }

        public LightWriter ln() {
            print(System.lineSeparator());
            breaked = true;
            if (autoflush) {
                try {
                    out.flush();
                } catch (IOException ex) {
                    throw new UncheckedIOException(ex);
                }
            }
            return this;
        }

        public void close() {
            try {
                out.close();
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
        }

    }
}
0