結果

問題 No.430 文字列検索
ユーザー yupiteru_kunyupiteru_kun
提出日時 2020-11-03 12:16:07
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 84 ms / 2,000 ms
コード長 13,665 bytes
コンパイル時間 962 ms
コンパイル使用メモリ 116,736 KB
実行使用メモリ 32,384 KB
最終ジャッジ日時 2024-11-10 00:48:34
合計ジャッジ時間 2,553 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 34 ms
20,224 KB
testcase_01 AC 84 ms
32,384 KB
testcase_02 AC 47 ms
24,064 KB
testcase_03 AC 45 ms
23,936 KB
testcase_04 AC 34 ms
20,352 KB
testcase_05 AC 32 ms
20,480 KB
testcase_06 AC 35 ms
20,352 KB
testcase_07 AC 34 ms
20,352 KB
testcase_08 AC 38 ms
20,168 KB
testcase_09 AC 35 ms
20,736 KB
testcase_10 AC 35 ms
20,352 KB
testcase_11 AC 63 ms
27,904 KB
testcase_12 AC 65 ms
27,648 KB
testcase_13 AC 68 ms
27,776 KB
testcase_14 AC 59 ms
27,520 KB
testcase_15 AC 57 ms
27,520 KB
testcase_16 AC 56 ms
28,032 KB
testcase_17 AC 57 ms
27,904 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;

namespace Program
{
    public static class ProblemC
    {
        static bool SAIKI = false;
        static public int numberOfRandomCases = 0;
        static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
        {
        }
        static public void Solve()
        {
            var S = NS;
            var M = NN;
            var CList = NSList(M);
            var trie = new LIB_Trie<char>();
            foreach (var item in CList)
            {
                trie.Add(item);
            }
            Console.WriteLine(trie.AhoCorasick(S).Values.Sum(e => e.Count));
        }
        class Printer : StreamWriter
        {
            public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
            public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
            public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
        }
        static LIB_FastIO fastio = new LIB_FastIODebug();
        static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
        static long NN => fastio.Long();
        static double ND => fastio.Double();
        static string NS => fastio.Scan();
        static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
        static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
        static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
        static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
        static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
        static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
        static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
        static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
        static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
        static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
        static IEnumerator<uint> _xsi = _xsc();
        static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
        static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; }
        static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
        static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);
        static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);
        static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);
        static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);
    }
}
namespace Library {
    class LIB_Dict<K, V> : Dictionary<K, V>
    {
        Func<K, V> d;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_Dict(Func<K, V> _d) { d = _d; }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_Dict() : this(_ => default(V)) { }
        new public V this[K i]
        {
            get
            {
                return TryGetValue(i, out var v) ? v : base[i] = d(i);
            }
            set
            {
                base[i] = value;
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override int GetHashCode()
        {
            unchecked
            {
                var ret = 23;
                for (var e = GetEnumerator(); e.MoveNext();) ret = (ret * 37) ^ (e.Current.Key.GetHashCode() << 5 + e.Current.Key.GetHashCode()) ^ e.Current.Value.GetHashCode();
                return ret;
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override bool Equals(object obj)
        {
            var o = (LIB_Dict<K, V>)obj;
            foreach (var kv in o)
            {
                if (!ContainsKey(kv.Key) || !this[kv.Key].Equals(kv.Value))
                    return false;
            }
            return o.Count == Count;
        }
    }
    class LIB_FastIO
    {
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIO() { str = Console.OpenStandardInput(); }
        readonly Stream str;
        readonly byte[] buf = new byte[2048];
        int len, ptr;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        byte read()
        {
            if (ptr >= len)
            {
                ptr = 0;
                if ((len = str.Read(buf, 0, 2048)) <= 0)
                {
                    return 0;
                }
            }
            return buf[ptr++];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        char Char()
        {
            byte b = 0;
            do b = read();
            while (b < 33 || 126 < b);
            return (char)b;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public long Long()
        {
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = (ret << 3) + (ret << 1) + b - '0';
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
    class LIB_FastIODebug : LIB_FastIO
    {
        Queue<string> param = new Queue<string>();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIODebug() { }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override string Scan() => NextString();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override long Long() => long.Parse(NextString());
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override double Double() => double.Parse(NextString());
    }
    class LIB_Trie<T>
    {
        class TrieNode
        {
            public Dictionary<T, TrieNode> Next;
            public TrieNode fail;
            public List<int> Accept;
            public HashSet<int> UnionAccept;
            public int Count;
            public TrieNode()
            {
                Next = new Dictionary<T, TrieNode>();
                Accept = new List<int>();
                UnionAccept = new HashSet<int>();
            }
        }
        bool builtAhoCorasick;
        List<int> patLens;
        TrieNode root;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_Trie()
        {
            root = new TrieNode();
            builtAhoCorasick = false;
            patLens = new List<int>();
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_Dict<int, List<int>> AhoCorasick(IEnumerable<T> str)
        {
            if (!builtAhoCorasick)
            {
                builtAhoCorasick = true;
                var q = new Queue<TrieNode>();
                foreach (var item in root.Next)
                {
                    item.Value.fail = root;
                    foreach (var item2 in item.Value.Accept) item.Value.UnionAccept.Add(item2);
                    q.Enqueue(item.Value);
                }
                root.fail = root;
                while (q.Count > 0)
                {
                    var t = q.Dequeue();
                    foreach (var item in t.Next)
                    {
                        foreach (var item2 in item.Value.Accept) item.Value.UnionAccept.Add(item2);
                        q.Enqueue(item.Value);
                        var r = t.fail;
                        while (r != root && !r.Next.ContainsKey(item.Key)) r = r.fail;
                        if (!r.Next.TryGetValue(item.Key, out item.Value.fail))
                        {
                            item.Value.fail = root;
                        }
                        foreach (var item2 in item.Value.fail.UnionAccept)
                        {
                            item.Value.UnionAccept.Add(item2);
                        }
                    }
                }
            }
            var ret = new LIB_Dict<int, List<int>>(_ => new List<int>());
            var v = root;
            var pos = 0;
            foreach (var item in str)
            {
                ++pos;
                while (v != root && !v.Next.ContainsKey(item)) v = v.fail;
                if (!v.Next.TryGetValue(item, out v)) v = root;
                foreach (var item2 in v.UnionAccept) ret[item2].Add(pos - patLens[item2]);
            }
            return ret;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public void Add(IEnumerable<T> str)
        {
            builtAhoCorasick = false;
            var id = root.Count;
            var node = root;
            var len = 0;
            foreach (var item in str)
            {
                ++len;
                ++node.Count;
                TrieNode nextNode;
                if (!node.Next.TryGetValue(item, out nextNode)) nextNode = node.Next[item] = new TrieNode();
                node = nextNode;
            }
            patLens.Add(len);
            ++node.Count;
            node.Accept.Add(id);
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public List<int> Query(IEnumerable<T> str)
        {
            var ret = new List<int>();
            var node = root;
            foreach (var item in str)
            {
                foreach (var item2 in node.Accept) ret.Add(item2);
                TrieNode nextNode;
                if (!node.Next.TryGetValue(item, out nextNode)) return ret;
                node = nextNode;
            }
            foreach (var item in node.Accept) ret.Add(item);
            return ret;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public int[] Find(IEnumerable<T> str)
        {
            var node = root;
            foreach (var item in str)
            {
                TrieNode nextNode;
                if (!node.Next.TryGetValue(item, out nextNode)) return new int[0];
                node = nextNode;
            }
            return node.Accept.ToArray();
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public int Count() => root.Count;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public int Count(IEnumerable<T> prefix)
        {
            var node = root;
            foreach (var item in prefix)
            {
                TrieNode nextNode;
                if (!node.Next.TryGetValue(item, out nextNode)) return 0;
                node = nextNode;
            }
            return node.Count;
        }
    }
}
0