結果
| 問題 | No.430 文字列検索 |
| コンテスト | |
| ユーザー |
 uwi
|
| 提出日時 | 2016-10-03 01:39:08 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 116 ms / 2,000 ms |
| コード長 | 5,957 bytes |
| 記録 | |
| コンパイル時間 | 3,678 ms |
| コンパイル使用メモリ | 83,440 KB |
| 実行使用メモリ | 41,704 KB |
| 最終ジャッジ日時 | 2024-11-10 00:08:01 |
| 合計ジャッジ時間 | 5,801 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 14 |
ソースコード
package contest161002;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class N430_4 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
char[] s = ns().toCharArray();
TrieByList trie = new TrieByList();
for(int T = ni();T > 0;T--){
char[] t = ns().toCharArray();
trie.add(t);
}
trie.buildFailure();
out.println(trie.countHit(s));
}
public static class TrieByList {
public Node root = new Node((char)0, 0);
public int gen = 1;
public static class Node
{
public int id;
public char c;
public int ptn = 0;
public int p = 0;
public Node[] child = null;
public int hit = 0;
public Node fail;
public Node(char c, int id)
{
this.id = id;
this.c = c;
}
public void appendChild(Node n)
{
if(p == 0){
child = new Node[1];
}else if(p+1 >= child.length){
child = Arrays.copyOf(child, child.length*2);
}
int z = n.c-'A';
int nind = Integer.bitCount(ptn<<31-z);
ptn |= 1<<z;
System.arraycopy(child, nind, child, nind+1, p-nind);
child[nind] = n;
p++;
}
public Node search(char c)
{
if(ptn<<31-(c-'A')<0){
return child[Integer.bitCount(ptn<<31-(c-'A'))-1];
}else{
return null;
}
}
public String toString(String indent)
{
StringBuilder sb = new StringBuilder();
sb.append(indent + id + ":" + c);
if(hit != 0)sb.append(" H:" + hit);
if(fail != null)sb.append(" F:" + fail.id);
sb.append("\n");
for(int i = 0;i < p;i++){
sb.append(child[i].toString(indent + " "));
}
return sb.toString();
}
}
public void add(char[] s)
{
Node cur = root;
Node pre = null;
for(char c : s){
pre = cur;
cur = pre.search(c);
if(cur == null){
cur = new Node(c, gen++);
pre.appendChild(cur);
}
}
cur.hit++;
}
public void buildFailure()
{
root.fail = null;
Queue<Node> q = new ArrayDeque<Node>();
q.add(root);
while(!q.isEmpty()){
Node cur = q.poll();
inner:
for(int i = 0;i < cur.p;i++){
Node ch = cur.child[i];
q.add(ch);
for(Node to = cur.fail; to != null; to = to.fail){
Node lch = to.search(ch.c);
if(lch != null){
ch.fail = lch;
ch.hit += lch.hit; // propagation of hit
continue inner;
}
}
ch.fail = root;
}
}
}
public void search(char[] q)
{
Node cur = root;
outer:
for(char c : q){
for(;cur != null;cur = cur.fail){
Node next = cur.search(c);
if(next != null){
cur = next;
continue outer;
}
// dead
}
cur = root;
}
}
public int countHit(char[] q)
{
Node cur = root;
int hit = 0;
outer:
for(char c : q){
for(;cur != null;cur = cur.fail){
Node next = cur.search(c);
if(next != null){
hit += next.hit;
cur = next;
continue outer;
}
}
cur = root;
}
return hit;
}
public String toString()
{
return root.toString("");
}
}
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
public static void main(String[] args) throws Exception { new N430_4().run(); }
private byte[] inbuf = new byte[1024];
private int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private char[][] nm(int n, int m) {
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private int ni() { return (int)nl(); }
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}