結果
問題 | No.430 文字列検索 |
ユーザー | iwkjosec |
提出日時 | 2019-10-04 12:46:27 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 116 ms / 2,000 ms |
コード長 | 2,948 bytes |
コンパイル時間 | 888 ms |
コンパイル使用メモリ | 114,256 KB |
実行使用メモリ | 51,204 KB |
最終ジャッジ日時 | 2024-04-14 09:51:34 |
合計ジャッジ時間 | 2,817 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
23,940 KB |
testcase_01 | AC | 116 ms
50,820 KB |
testcase_02 | AC | 67 ms
24,080 KB |
testcase_03 | AC | 67 ms
24,048 KB |
testcase_04 | AC | 27 ms
23,956 KB |
testcase_05 | AC | 26 ms
25,860 KB |
testcase_06 | AC | 27 ms
23,700 KB |
testcase_07 | AC | 27 ms
25,852 KB |
testcase_08 | AC | 114 ms
51,204 KB |
testcase_09 | AC | 27 ms
25,732 KB |
testcase_10 | AC | 34 ms
26,256 KB |
testcase_11 | AC | 76 ms
29,636 KB |
testcase_12 | AC | 76 ms
30,016 KB |
testcase_13 | AC | 75 ms
27,792 KB |
testcase_14 | AC | 73 ms
26,004 KB |
testcase_15 | AC | 72 ms
26,236 KB |
testcase_16 | AC | 67 ms
24,212 KB |
testcase_17 | AC | 67 ms
24,340 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
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; } } public class RollingHash { ulong[] hash; ulong[] pow; const ulong @base = 131; const ulong mod = (1UL << 61) - 1; static ulong Mul(ulong a, ulong b) { const ulong MASK30 = (1UL << 30) - 1; const ulong MASK31 = (1UL << 31) - 1; var ah = a >> 31; var al = a & MASK31; var bh = b >> 31; var bl = b & MASK31; var mid = al * bh + ah * bl; var midu = mid >> 30; var midd = (mid & MASK30); return Mod(ah * bh * 2 + midu + (midd << 31) + al * bl); } static ulong Mod(ulong v) { v = (v & mod) + (v >> 61); if (v > mod) v -= mod; return v; } public RollingHash(string s) { hash = new ulong[s.Length + 1]; pow = new ulong[s.Length + 1]; pow[0] = 1; for (int i = 1; i < pow.Length; i++) { pow[i] = Mul(pow[i - 1], @base); hash[i] = (Mul(hash[i - 1], @base) + s[i - 1]) % mod; } } public static ulong ComputeHash(string s) { var h = 0UL; for (int i = 0; i < s.Length; i++) { h = Mul(h, @base) + s[i]; } return h % mod; } public ulong Hash(int l, int r) { var a = hash[r]; var b = Mul(hash[l], pow[r - l]); if (a < b) a += mod; return (a - b) % mod; ; } }