結果

問題 No.515 典型LCP
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2017-05-05 23:06:32
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 808 ms / 1,000 ms
コード長 7,305 bytes
コンパイル時間 2,617 ms
コンパイル使用メモリ 112,608 KB
実行使用メモリ 44,672 KB
最終ジャッジ日時 2023-10-12 11:04:41
合計ジャッジ時間 11,741 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 526 ms
42,708 KB
testcase_01 AC 523 ms
44,672 KB
testcase_02 AC 558 ms
39,552 KB
testcase_03 AC 53 ms
22,556 KB
testcase_04 AC 53 ms
22,568 KB
testcase_05 AC 575 ms
42,452 KB
testcase_06 AC 575 ms
40,324 KB
testcase_07 AC 564 ms
40,368 KB
testcase_08 AC 583 ms
40,348 KB
testcase_09 AC 490 ms
41,656 KB
testcase_10 AC 272 ms
39,648 KB
testcase_11 AC 274 ms
39,632 KB
testcase_12 AC 271 ms
41,580 KB
testcase_13 AC 695 ms
43,432 KB
testcase_14 AC 79 ms
40,916 KB
testcase_15 AC 808 ms
40,824 KB
testcase_16 AC 699 ms
38,780 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var sb = new StringBuilder();
            var pos = new int[n];
            var len = new int[n];
            for (int i = 0; i < n; i++)
            {
                pos[i] = sb.Length;
                var ss = sc.Scan();
                len[i] = ss.Length;
                sb.Append(ss);
            }
            var s = sb.ToString();
            var hash = new Hashing(s);
            var m = sc.Integer();
            var x = sc.Long();
            var d = sc.Long();
            long mod = n;
            mod *= n - 1;
            var ans = 0L;
            for (int k = 0; k < m; k++)
            {
                var i = x / (n - 1);
                var j = x % (n - 1);
                if (i > j) Swap(ref i, ref j);
                else j++;
                var lcp = hash.LCP(pos[i], pos[j], Math.Min(len[i], len[j]));
                ans += lcp;
                Debug.WriteLine(lcp);
                x = (x + d) % mod;

            }
            IO.Printer.Out.WriteLine(ans);
        }

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}
#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
#region Hashing
public class Hashing
{
    int n;
    string s;
    Random rand = new Random();

    ulong[] modtable = { 1000000007, 1000000009, 1000000021, 1000000033 };
    ulong band = 100007;
    ulong MOD = (ulong)1e9 + 7;
    ulong[] pow, phash;
    public Hashing(string str)
    {
        s = str;
        n = s.Length;
        pow = new ulong[n + 1];
        phash = new ulong[n + 1];
        pow[0] = 1;
        for (int i = 0; i < n; i++)
        {
            phash[i + 1] = (s[i] + phash[i] * band);
            pow[i + 1] = (pow[i] * band);
        }
        MOD = modtable[rand.Next() % modtable.Length];
        band = (ulong)rand.Next(26, (int)MOD);
    }
    public ulong Hash(int l, int r)
    {
        return phash[r] - (phash[l] * pow[r - l]);
    }
    //s[il,ir)とs[jl,jr)をconcatしたときにどっちが小さいか比較
    //weak strict orderなので大丈夫
    public int CompConcat(int i, int ir, int j, int jr)
    {
        var ls = Hash(i, ir) * pow[jr - j] + Hash(j, jr);
        var rs = Hash(j, jr) * pow[ir - i] + Hash(i, ir);
        if (ls == rs) return 0;

        var l = 0; var r = ir - i + jr - j + 1;
        while (l + 1 < r)
        {
            var m = (l + r) / 2;
            var lhash = i + m <= ir ? Hash(i, i + m) : Hash(i, ir) * pow[m - (ir - i)] + Hash(j, j + m - (ir - i));
            var rhash = j + m <= jr ? Hash(j, j + m) : Hash(j, jr) * pow[m - (jr - j)] + Hash(i, i + m - (jr - j));
            if (lhash == rhash) l = m;
            else r = m;
        }
        var lc = (i + l) < ir ? s[i + l] : s[j + l - (ir - i)];
        var rc = (j + l) < jr ? s[j + l] : s[i + l - (jr - j)];
        return lc.CompareTo(rc);
    }

    public int LCP(int i, int j, int len)
    {
        var l = 0; var r = len + 1;
        while (l + 1 < r)
        {
            var m = (l + r) / 2;
            if (Hash(i, i + m) == Hash(j, j + m)) l = m;
            else r = m;
        }
        return l;
    }
}
#endregion
0