#556782 (C#(csc)) No.515 典型LCP

提出ソース

結果

問題	No.515 典型LCP
ユーザー	ひばち
提出日時	2020-09-22 08:32:14
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	10,825 bytes
コンパイル時間	1,447 ms
コンパイル使用メモリ	118,788 KB
実行使用メモリ	39,864 KB
最終ジャッジ日時	2024-06-25 18:52:03
合計ジャッジ時間	6,552 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	AC	28 ms 19,328 KB
testcase_04	AC	29 ms 19,584 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using SC = Scanner;

public partial class Solver
{
    public void Solve()
    {
        var N = sc.Int;
        var S = Create(N, () => sc.Str.ToCharArray());
        var idx = Enumerable.Range(0, N).ToArray();
        Array.Sort(idx, (a, b) =>
        {
            for (int j = 0; j < Min(S[a].Length, S[b].Length); j++)
            {
                if (S[a][j] > S[b][j]) return 1;
                if (S[a][j] < S[b][j]) return -1;
            }
            if (S[a].Length == S[b].Length) return 0;
            if (S[a].Length > S[b].Length) return 1;
            else return -1;
        });
        var V = new int[N - 1];
        for (int i = 0; i < N - 1; i++)
        {
            int lcp = 0;
            while (lcp < Min(S[idx[i]].Length, S[idx[i + 1]].Length) && S[idx[i]][lcp] == S[idx[i + 1]][lcp]) lcp++;
            V[i] = lcp;
        }
        var sp = new SparseTable<int>(V, Min,int.MaxValue);
        int M; long X, D;
        sc.Make(out M, out X, out D); var res = 0L;
        for (int k = 0; k < M; k++)
        {
            int i = (int)(X / (N - 1));
            int j = (int)(X % (N - 1));
            if (i > j) swap(ref i, ref j);
            else j++;
            if (idx[i] > idx[j]) swap(ref i, ref j);
            X = (X + D) % ((long)N * (N - 1));
            res += sp[idx[i], idx[j]];
        }
        Console.WriteLine(res);
    }
}

public class SegmentTree<T>
{
    protected readonly T[] dat;
    protected readonly int _N, sz;
    protected readonly Func<T, T, T> merge;
    protected readonly Func<T, T, T> update;
    protected readonly T id;
    private bool finished = true;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected int Left(int i)
        => i << 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected int Right(int i)
        => (i << 1) | 1;
    public T this[int i]
    {
        get { return dat[i + sz]; }
        set { finished = false; dat[i + sz] = value; }
    }

    public SegmentTree(int N, T id, Func<T, T, T> merge, Func<T, T, T> update = null)
    {
        _N = N;
        this.sz = 1;
        while (sz < N) sz <<= 1;
        this.id = id;
        this.merge = merge;
        this.update = update ?? ((T val1, T val2) => val2);
        dat = Create(sz << 1, () => id);
    }

    public void Update(int i, T value)
    {
        i += sz;
        dat[i] = update(dat[i], value);
        while (i > 1)
        {
            i >>= 1;
            dat[i] = merge(dat[Left(i)], dat[Right(i)]);
        }
    }

    public void Build()
    {
        for (int i = sz - 1; i > 0; i--)
            dat[i] = merge(dat[Left(i)], dat[Right(i)]);
        finished = true;
    }

    public virtual T Query(int left, int right)
    {
        if (!finished) throw new Exception("You need to Execute \"Build()\"");
        T l = id, r = id;
        for (left += sz, right += sz; left < right; left >>= 1, right >>= 1)
        {
            if ((left & 1) == 1) l = merge(l, dat[left++]);
            if ((right & 1) == 1) r = merge(dat[--right], r);
        }
        return merge(l, r);
    }
    public int MaxRight(int l, Func<T, bool> f)
    {
        if (l == _N) return _N;
        l += sz;
        var sm = id;
        do
        {
            while ((l & 1) == 0) l >>= 1;
            if (!f(merge(sm, dat[l])))
            {
                while (l < sz)
                {
                    l <<= 1;
                    if (f(merge(sm, dat[l])))
                    {
                        sm = merge(sm, dat[l]);
                        l++;
                    }
                }
                return l - sz;
            }
            sm = merge(sm, dat[l]);
            l++;
        } while ((l & -l) != l);
        return _N;
    }
    public int MinLeft(int r, Func<T, bool> f)
    {
        if (r == 0) return 0;
        r += sz;
        var sm = id;
        do
        {
            r--;
            while (r > 1 && (r & 1) == 1) r >>= 1;
            if (!f(merge(dat[r], sm)))
            {
                while (r < sz)
                {
                    r = (r << 1) | 1;
                    if (f(merge(dat[r], sm)))
                    {
                        sm = merge(dat[r], sm); r--;
                    }
                }
                return r + 1 - sz;
            }
            sm = merge(dat[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
}
public class SparseTable<T>
{
    private Func<T, T, T> f;
    private T[][] table;
    private int[] len;
    T id;
    public T this[int l, int r]
    {
        get { if (l >= r) return id; return f(table[len[r - l]][l], table[len[r - l]][r - (1 << len[r - l])]); }
    }
    public SparseTable(IList<T> A, Func<T, T, T> f, T id = default(T))
    {
        this.f = f;
        this.id = id;
        var mask = 0;
        while ((1 << mask) <= A.Count) mask++;
        table = Create(mask, () => new T[A.Count]);
        for (var i = 0; i < A.Count; i++)
            table[0][i] = A[i];
        for (var i = 1; i < table.Length; i++)
            for (var j = 0; j + (1 << i) <= table[i - 1].Length; j++)
                table[i][j] = f(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);
        len = new int[A.Count + 1];
        for (var i = 2; i < len.Length; i++)
            len[i] = len[i >> 1] + 1;
    }
}

#region Template
public partial class Solver
{
    public SC sc = new SC();
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var sol = new Solver();
        int testcase = 1;
        //testcase = sol.sc.Int;
        //var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();
        while (testcase-- > 0)
            sol.Solve();
        Console.Out.Flush();
    }
}
public static class Template
{
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static void Out<T>(this IList<T> A, out T a) => a = A[0];
    public static void Out<T>(this IList<T> A, out T a, out T b) { a = A[0]; b = A[1]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c) { A.Out(out a, out b); c = A[2]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c, out T d) { A.Out(out a, out b, out c); d = A[3]; }
    public static string Concat<T>(this IEnumerable<T> A, string sp) => string.Join(sp, A);
    public static char ToChar(this int s, char begin = '0') => (char)(s + begin);
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static string ToStr<T>(this T[][] A) => A.Select(a => a.Concat(" ")).Concat("\n");
    public static int ArgMax<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}

#endregion

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード