結果

問題 No.430 文字列検索
ユーザー iwkjoseciwkjosec
提出日時 2019-10-04 12:14:37
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 94 ms / 2,000 ms
コード長 3,891 bytes
コンパイル時間 794 ms
コンパイル使用メモリ 116,076 KB
実行使用メモリ 42,988 KB
最終ジャッジ日時 2024-11-10 00:35:32
合計ジャッジ時間 2,212 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
18,816 KB
testcase_01 AC 94 ms
42,856 KB
testcase_02 AC 51 ms
19,968 KB
testcase_03 AC 49 ms
19,968 KB
testcase_04 AC 24 ms
19,200 KB
testcase_05 AC 23 ms
19,456 KB
testcase_06 AC 24 ms
19,072 KB
testcase_07 AC 23 ms
19,072 KB
testcase_08 AC 91 ms
42,988 KB
testcase_09 AC 23 ms
19,200 KB
testcase_10 AC 29 ms
21,376 KB
testcase_11 AC 58 ms
22,912 KB
testcase_12 AC 59 ms
23,168 KB
testcase_13 AC 57 ms
23,040 KB
testcase_14 AC 57 ms
20,992 KB
testcase_15 AC 57 ms
21,248 KB
testcase_16 AC 52 ms
19,840 KB
testcase_17 AC 51 ms
19,968 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.Linq;
using static System.Console;
using static System.Math;

class Program
{
    static void Main()
    {
        var s = ReadLine();
        var m = int.Parse(ReadLine());
        var rh = new RollingHash(s);
        var d = new Map<ulong, int>();
        for (int i = 1; i < 11; i++)
        {
            for (int j = 0; j <= s.Length - i; j++)
            {
                d[rh.Hash(j, j + i)]++;
            }
        }
        var a = 0;
        for (int i = 0; i < m; i++)
        {
            var c = ReadLine();
            var h = RollingHash.ComputeHash(c);
            a += d[h];
        }
        WriteLine(a);
    }
}

public class Map<TKey, TValue> : Dictionary<TKey, TValue>
{
    public Map() { }
    public Map(int capacity) : base(capacity) { }
    public Map(IEqualityComparer<TKey> comparer) : base(comparer) { }
    public Map(int capacity, IEqualityComparer<TKey> comparer) : base(capacity, comparer) { }
    public Map(IDictionary<TKey, TValue> dictionary) : base(dictionary) { }
    public Map(IDictionary<TKey, TValue> dictionary, IEqualityComparer<TKey> comparer) : base(dictionary, comparer) { }
    public Map(IEnumerable<KeyValuePair<TKey, TValue>> collection) : base(collection) { }
    public Map(IEnumerable<KeyValuePair<TKey, TValue>> collection, IEqualityComparer<TKey> comparer) : base(collection, comparer) { }

    public new TValue this[TKey key]
    {
        get => TryGetValue(key, out var value) ? value : default;
        set => base[key] = value;
    }
}

class RollingHash
{
    const ulong MASK30 = (1UL << 30) - 1;
    const ulong MASK31 = (1UL << 31) - 1;
    const ulong MOD = (1UL << 61) - 1;
    const ulong POSITIVIZER = MOD * ((1UL << 3) - 1);
    static uint Base;
    static ulong[] powMemo = new ulong[50000 + 1];
    static RollingHash()
    {
        Base = (uint)new Random().Next(129, int.MaxValue);
        powMemo[0] = 1;
        for (int i = 1; i < powMemo.Length; i++)
            powMemo[i] = CalcMod(Mul(powMemo[i - 1], Base));
    }

    ulong[] hash;

    public RollingHash(string s)
    {
        hash = new ulong[s.Length + 1];
        for (int i = 0; i < s.Length; i++)
            hash[i + 1] = CalcMod(Mul(hash[i], Base) + s[i]);
    }
[System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
    public ulong Hash(int begin, int end)
    {
        return CalcMod(hash[end] + POSITIVIZER - Mul(hash[begin], powMemo[end - begin]));
    }
[System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
    public static ulong ComputeHash(string s)
    {
        var h = 0UL;
        for (int i = 0; i < s.Length; i++)
        {
            h = CalcMod(Mul(h, Base) + s[i]);
        }
        return h;
    }
[System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
    private static ulong Mul(ulong l, ulong r)
    {
        var lu = l >> 31;
        var ld = l & MASK31;
        var ru = r >> 31;
        var rd = r & MASK31;
        var middleBit = ld * ru + lu * rd;
        return ((lu * ru) << 1) + ld * rd + ((middleBit & MASK30) << 31) + (middleBit >> 30);
    }
[System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
    private static ulong Mul(ulong l, uint r)
    {
        var lu = l >> 31;
        var rd = r & MASK31;
        var middleBit = lu * rd;
        return (l & MASK31) * rd + ((middleBit & MASK30) << 31) + (middleBit >> 30);
    }
[System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.AggressiveInlining)]
    private static ulong CalcMod(ulong val)
    {
        val = (val & MOD) + (val >> 61);
        if (val > MOD) val -= MOD;
        return val;
    }
}
0