結果

問題 No.430 文字列検索
ユーザー magurogumamaguroguma
提出日時 2020-10-09 23:55:17
言語 Go
(1.22.1)
結果
AC  
実行時間 148 ms / 2,000 ms
コード長 7,876 bytes
コンパイル時間 11,303 ms
コンパイル使用メモリ 214,072 KB
実行使用メモリ 55,516 KB
最終ジャッジ日時 2023-09-27 20:14:36
合計ジャッジ時間 13,186 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 148 ms
55,516 KB
testcase_02 AC 43 ms
18,212 KB
testcase_03 AC 43 ms
18,216 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 9 ms
5,520 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 79 ms
39,356 KB
testcase_12 AC 90 ms
42,880 KB
testcase_13 AC 90 ms
42,920 KB
testcase_14 AC 72 ms
34,580 KB
testcase_15 AC 54 ms
23,788 KB
testcase_16 AC 54 ms
23,924 KB
testcase_17 AC 54 ms
23,920 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
URL:
https://yukicoder.me/problems/no/430
*/

package main

import (
	"bufio"
	"fmt"
	"io"
	"math"
	"os"
	"strconv"
)

var (
	S string
	m int
	C []string
)

func main() {
	defer stdout.Flush()

	S = reads()
	m = readi()
	for i := 0; i < m; i++ {
		C = append(C, reads())
	}

	pma := BuildPMA(C)

	A := Match(pma, S)

	debugf("A: %v\n", A)

	fmt.Println(sum(A...))
}

type PMA struct {
	next    [256]*PMA
	matched []int
}

func SetUnion(a, b []int) []int {
	res := []int{}

	memo := map[int]bool{}
	for _, e := range a {
		memo[e] = true
	}
	for _, e := range b {
		memo[e] = true
	}

	for k := range memo {
		res = append(res, k)
	}

	return res
}

func BuildPMA(pattern []string) *PMA {
	var now *PMA

	root := new(PMA)
	root.next[0] = root

	// build Trie
	for i := 0; i < len(pattern); i++ {
		now = root
		for j := 0; j < len(pattern[i]); j++ {
			if now.next[pattern[i][j]] == nil {
				now.next[pattern[i][j]] = new(PMA)
			}
			now = now.next[pattern[i][j]]
		}
		now.matched = append(now.matched, i)
	}

	// Aho-Corasick method
	que := []*PMA{}
	// Initialize
	for i := 1; i < 256; i++ {
		if root.next[i] == nil {
			root.next[i] = root
		} else {
			root.next[i].next[0] = root
			que = append(que, root.next[i])
		}
	}
	// BFS
	for len(que) > 0 {
		now = que[0]
		que = que[1:]

		// すべての文字についてチェック
		for i := 1; i < 256; i++ {
			// 次の遷移先が存在する場合
			if now.next[i] != nil {
				nxt := now.next[0]
				for nxt.next[i] == nil {
					nxt = nxt.next[0]
				}
				now.next[i].next[0] = nxt.next[i]
				now.next[i].matched = SetUnion(now.next[i].matched, nxt.next[i].matched)
				que = append(que, now.next[i])
			}
		}
	}

	return root
}

func Match(pma *PMA, text string) []int {
	res := make([]int, len(text))

	for i := 0; i < len(text); i++ {
		c := text[i]
		for pma.next[c] == nil {
			pma = pma.next[0]
		}
		pma = pma.next[c]
		// for j := 0; j < len(pma.matched); j++ {
		// 	res[pma.matched[j]]++
		// }
		res[i] += len(pma.matched)
	}

	return res
}

/*******************************************************************/

/********** common constants **********/

const (
	MOD = 1000000000 + 7
	// MOD          = 998244353
	ALPH_N  = 26
	INF_I64 = math.MaxInt64
	INF_B60 = 1 << 60
	INF_I32 = math.MaxInt32
	INF_B30 = 1 << 30
	NIL     = -1
	EPS     = 1e-10
)

/********** bufio setting **********/

func init() {
	// bufio.ScanWords <---> bufio.ScanLines
	reads = newReadString(os.Stdin, bufio.ScanWords)
	stdout = bufio.NewWriter(os.Stdout)
}

// mod can calculate a right residual whether value is positive or negative.
func mod(val, m int) int {
	res := val % m
	if res < 0 {
		res += m
	}
	return res
}

// min returns the min integer among input set.
// This function needs at least 1 argument (no argument causes panic).
func min(integers ...int) int {
	m := integers[0]
	for i, integer := range integers {
		if i == 0 {
			continue
		}
		if m > integer {
			m = integer
		}
	}
	return m
}

// max returns the max integer among input set.
// This function needs at least 1 argument (no argument causes panic).
func max(integers ...int) int {
	m := integers[0]
	for i, integer := range integers {
		if i == 0 {
			continue
		}
		if m < integer {
			m = integer
		}
	}
	return m
}

// chmin accepts a pointer of integer and a target value.
// If target value is SMALLER than the first argument,
//	then the first argument will be updated by the second argument.
func chmin(updatedValue *int, target int) bool {
	if *updatedValue > target {
		*updatedValue = target
		return true
	}
	return false
}

// chmax accepts a pointer of integer and a target value.
// If target value is LARGER than the first argument,
//	then the first argument will be updated by the second argument.
func chmax(updatedValue *int, target int) bool {
	if *updatedValue < target {
		*updatedValue = target
		return true
	}
	return false
}

// sum returns multiple integers sum.
func sum(integers ...int) int {
	var s int
	s = 0

	for _, i := range integers {
		s += i
	}

	return s
}

/********** FAU standard libraries **********/

//fmt.Sprintf("%b\n", 255) 	// binary expression

/********** I/O usage **********/

//str := reads()
//i := readi()
//X := readis(n)
//S := readrs()
//a := readf()
//A := readfs(n)

//str := ZeroPaddingRuneSlice(num, 32)
//str := PrintIntsLine(X...)

/*********** Input ***********/

var (
	// reads returns a WORD string.
	reads  func() string
	stdout *bufio.Writer
)

func newReadString(ior io.Reader, sf bufio.SplitFunc) func() string {
	r := bufio.NewScanner(ior)
	r.Buffer(make([]byte, 1024), int(1e+9)) // for Codeforces
	r.Split(sf)

	return func() string {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Text()
	}
}

// readi returns an integer.
func readi() int {
	return int(_readInt64())
}
func readi2() (int, int) {
	return int(_readInt64()), int(_readInt64())
}
func readi3() (int, int, int) {
	return int(_readInt64()), int(_readInt64()), int(_readInt64())
}
func readi4() (int, int, int, int) {
	return int(_readInt64()), int(_readInt64()), int(_readInt64()), int(_readInt64())
}

// readll returns as integer as int64.
func readll() int64 {
	return _readInt64()
}
func readll2() (int64, int64) {
	return _readInt64(), _readInt64()
}
func readll3() (int64, int64, int64) {
	return _readInt64(), _readInt64(), _readInt64()
}
func readll4() (int64, int64, int64, int64) {
	return _readInt64(), _readInt64(), _readInt64(), _readInt64()
}

func _readInt64() int64 {
	i, err := strconv.ParseInt(reads(), 0, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// readis returns an integer slice that has n integers.
func readis(n int) []int {
	b := make([]int, n)
	for i := 0; i < n; i++ {
		b[i] = readi()
	}
	return b
}

// readlls returns as int64 slice that has n integers.
func readlls(n int) []int64 {
	b := make([]int64, n)
	for i := 0; i < n; i++ {
		b[i] = readll()
	}
	return b
}

// readf returns an float64.
func readf() float64 {
	return float64(_readFloat64())
}

func _readFloat64() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// ReadFloatSlice returns an float64 slice that has n float64.
func readfs(n int) []float64 {
	b := make([]float64, n)
	for i := 0; i < n; i++ {
		b[i] = readf()
	}
	return b
}

// readrs returns a rune slice.
func readrs() []rune {
	return []rune(reads())
}

/*********** Output ***********/

// PrintIntsLine returns integers string delimited by a space.
func PrintIntsLine(A ...int) string {
	res := []rune{}

	for i := 0; i < len(A); i++ {
		str := strconv.Itoa(A[i])
		res = append(res, []rune(str)...)

		if i != len(A)-1 {
			res = append(res, ' ')
		}
	}

	return string(res)
}

// PrintIntsLine returns integers string delimited by a space.
func PrintInts64Line(A ...int64) string {
	res := []rune{}

	for i := 0; i < len(A); i++ {
		str := strconv.FormatInt(A[i], 10) // 64bit int version
		res = append(res, []rune(str)...)

		if i != len(A)-1 {
			res = append(res, ' ')
		}
	}

	return string(res)
}

// Printf is function for output strings to buffered os.Stdout.
// You may have to call stdout.Flush() finally.
func printf(format string, a ...interface{}) {
	fmt.Fprintf(stdout, format, a...)
}

/*********** Debugging ***********/

// debugf is wrapper of fmt.Fprintf(os.Stderr, format, a...)
func debugf(format string, a ...interface{}) {
	fmt.Fprintf(os.Stderr, format, a...)
}

// ZeroPaddingRuneSlice returns binary expressions of integer n with zero padding.
// For debugging use.
func ZeroPaddingRuneSlice(n, digitsNum int) []rune {
	sn := fmt.Sprintf("%b", n)

	residualLength := digitsNum - len(sn)
	if residualLength <= 0 {
		return []rune(sn)
	}

	zeros := make([]rune, residualLength)
	for i := 0; i < len(zeros); i++ {
		zeros[i] = '0'
	}

	res := []rune{}
	res = append(res, zeros...)
	res = append(res, []rune(sn)...)

	return res
}
0