結果

問題 No.515 典型LCP
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2017-05-06 01:47:43
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 12,701 bytes
コンパイル時間 1,359 ms
コンパイル使用メモリ 112,256 KB
実行使用メモリ 115,328 KB
最終ジャッジ日時 2024-09-14 10:13:29
合計ジャッジ時間 13,141 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 AC 872 ms
110,336 KB
testcase_02 AC 556 ms
102,980 KB
testcase_03 AC 26 ms
18,304 KB
testcase_04 AC 26 ms
18,560 KB
testcase_05 AC 657 ms
114,176 KB
testcase_06 AC 661 ms
113,920 KB
testcase_07 AC 659 ms
114,176 KB
testcase_08 AC 705 ms
114,048 KB
testcase_09 AC 489 ms
102,840 KB
testcase_10 AC 483 ms
102,700 KB
testcase_11 AC 480 ms
102,828 KB
testcase_12 AC 478 ms
102,704 KB
testcase_13 AC 482 ms
103,616 KB
testcase_14 AC 305 ms
102,884 KB
testcase_15 AC 638 ms
113,280 KB
testcase_16 AC 641 ms
113,408 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 str = new string[n];
            var pos = new int[n];
            var len = new int[n];
            for (int i = 0; i < n; i++)
            {

                pos[i] = sb.Length;
                sb.Append(sc.Scan());
                len[i] = sb.Length - pos[i];
            }
            var s = sb.ToString();
            var sa = new SuffixArray(s);
            sa.BuildLCP();
            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 = Math.Min(sa.GetLCP(pos[i], pos[j]), Math.Min(len[i], len[j]));
                ans += 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


#region SuffixArray
/// <summary>
/// O(N) 構築
/// </summary>
/// 
public class SuffixArray
{
    int[] S;
    int N;
    int[] SA;
    int[] rank;
    sparseTableRMQ rmq;
    public SuffixArray(string str)
    {
        N = str.Length;
        S = new int[N + 1];
        for (int i = 0; i < N; i++)
            S[i] = str[i];
        SA = sais(S, S.Max());
        rank = new int[N + 1];
        for (int i = 0; i <= N; i++) rank[SA[i]] = i;
    }

    void createBeginBucket(int[] v, int[] b)
    {
        for (int i = 0; i < b.Length; i++) b[i] = 0;
        for (int i = 0; i < v.Length; i++) b[v[i]]++;
        int sum = 0;
        for (int i = 0; i < b.Length; i++) { b[i] += sum; var tmp = b[i]; b[i] = sum; sum = tmp; }
    }
    void createEndBucket(int[] v, int[] b)
    {
        for (int i = 0; i < b.Length; i++) b[i] = 0;
        for (int i = 0; i < v.Length; i++) b[v[i]]++;
        for (int i = 1; i < b.Length; i++) b[i] += b[i - 1];
    }
    void inducedSort(int[] v, int[] sa, int mv, int[] b, bool[] isl)
    {
        createBeginBucket(v, b);
        for (int i = 0; i < v.Length; i++) if (sa[i] > 0 && isl[sa[i] - 1]) sa[b[v[sa[i] - 1]]++] = sa[i] - 1;
    }
    void invertInducedSort(int[] v, int[] sa, int mv, int[] b, bool[] isl)
    {
        createEndBucket(v, b);
        for (int i = v.Length - 1; i >= 0; i--)
            if (sa[i] > 0 && !isl[sa[i] - 1]) sa[--b[v[sa[i] - 1]]] = sa[i] - 1;
    }
    int[] sais(int[] v, int mv)
    {
        if (v.Length == 1) return new int[] { 0 };
        var isl = new bool[v.Length];
        var b = new int[mv + 1];
        var sa = new int[v.Length];
        for (int i = 0; i < v.Length; i++)
            sa[i] = -1;
        for (int i = v.Length - 2; i >= 0; i--)
            isl[i] = v[i] > v[i + 1] || (v[i] == v[i + 1] && isl[i + 1]);
        createEndBucket(v, b);
        for (int i = 0; i < v.Length; i++) if (isLMS(i, isl)) sa[--b[v[i]]] = i;
        inducedSort(v, sa, mv, b, isl);
        invertInducedSort(v, sa, mv, b, isl);


        var cur = 0;
        var ord = new int[v.Length];
        for (int i = 0; i < v.Length; i++) if (isLMS(i, isl)) ord[i] = cur++;
        var next = new int[cur];
        cur = -1;
        int prev = -1;
        for (int i = 0; i < v.Length; i++)
        {
            if (!isLMS(sa[i], isl)) continue;
            var diff = false;
            for (int d = 0; d < v.Length; d++)
            {
                if (prev == -1 || v[sa[i] + d] != v[prev + d] || isl[sa[i] + d] != isl[prev + d])
                {
                    diff = true; break;
                }
                else if (d > 0 && isLMS(sa[i] + d, isl)) break;
            }
            if (diff) { cur++; prev = sa[i]; }
            next[ord[sa[i]]] = cur;
        }
        var reord = new int[next.Length];
        for (int i = 0; i < v.Length; i++) if (isLMS(i, isl)) reord[ord[i]] = i;
        var nextsa = sais(next, cur);
        createEndBucket(v, b);
        for (int i = 0; i < sa.Length; i++) sa[i] = -1;
        for (int i = nextsa.Length - 1; i >= 0; i--) sa[--b[v[reord[nextsa[i]]]]] = reord[nextsa[i]];
        inducedSort(v, sa, mv, b, isl);
        invertInducedSort(v, sa, mv, b, isl);
        return sa;
    }
    bool isLMS(int x, bool[] isl) { return x > 0 && isl[x - 1] && !isl[x]; }

    public void BuildLCP()
    {
        var k = 0;
        var h = new int[N];
        for (int i = 0; i < N; i++)
        {
            var j = SA[rank[i] - 1];
            if (k > 0) k--;
            for (; j + k < N && i + k < N; k++) if (S[j + k] != S[i + k]) break;
            h[rank[i] - 1] = k;
        }
        rmq = new sparseTableRMQ(h);
    }
    public int GetLCP(int i, int j)
    {
        i = rank[i]; j = rank[j];
        return rmq.Query(Math.Min(i, j), Math.Max(i, j));
    }
    /// <summary>
    /// rankがiのものを返す
    /// </summary>
    public int this[int index]
    {
        get { return index == 0 ? N : SA[index - 1]; }
    }
    /// <summary>
    /// s[i:]のランクを返す
    /// </summary>
    public int Rank(int index)
    {
        return rank[index];
    }
    #region SparseTableRMQ
    public class sparseTableRMQ
    {
        int n;
        int[] A;
        public sparseTableRMQ(int[] a)
        {
            var k = 1;
            n = a.Length;
            for (int i = 1; i < n; i <<= 1) k++;

            A = new int[n * k];
            for (int i = 0; i < n; i++)
                A[i] = a[i];
            var d = 0;
            for (int i = 1; i < n; i <<= 1, d += n)
            {
                for (int j = 0; j < n; j++)
                    A[d + n + j] = A[d + j];
                for (int j = 0; j < n - i; j++)
                    A[d + n + j] = Math.Min(A[d + j], A[d + j + i]);
            }
        }
        /// <summary>
        /// value of [l,r)
        /// </summary>
        public int Query(int l, int r)
        {
            r--;
            int z = r - l, k = 0;
            if ((z >> (k + 16)) > 0) k += 16;
            if ((z >> (k + 8)) > 0) k += 8;
            if ((z >> (k + 4)) > 0) k += 4;
            if ((z >> (k + 2)) > 0) k += 2;
            if ((z >> (k + 1)) > 0) k += 1;
            //var vl = A[l + n * k];
            //var vr = A[r - e + 1 + (n * k)];
            return Math.Min(A[l + (n * k)], A[r + (n * k) - (1 << k) + 1]);
        }
    }
    #endregion
}
#endregion
0