結果

問題 No.962 LCPs
ユーザー りあんりあん
提出日時 2019-12-24 23:43:55
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 364 ms / 2,000 ms
コード長 7,317 bytes
コンパイル時間 2,983 ms
コンパイル使用メモリ 121,000 KB
実行使用メモリ 106,176 KB
最終ジャッジ日時 2024-09-22 16:12:17
合計ジャッジ時間 7,798 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
23,784 KB
testcase_01 AC 24 ms
27,740 KB
testcase_02 AC 23 ms
23,408 KB
testcase_03 AC 25 ms
25,696 KB
testcase_04 AC 24 ms
23,660 KB
testcase_05 AC 24 ms
23,904 KB
testcase_06 AC 25 ms
23,540 KB
testcase_07 AC 24 ms
23,596 KB
testcase_08 AC 24 ms
23,660 KB
testcase_09 AC 24 ms
23,772 KB
testcase_10 AC 24 ms
23,728 KB
testcase_11 AC 23 ms
23,908 KB
testcase_12 AC 24 ms
25,824 KB
testcase_13 AC 23 ms
25,692 KB
testcase_14 AC 24 ms
25,700 KB
testcase_15 AC 24 ms
25,572 KB
testcase_16 AC 24 ms
25,828 KB
testcase_17 AC 51 ms
29,804 KB
testcase_18 AC 41 ms
25,832 KB
testcase_19 AC 41 ms
25,564 KB
testcase_20 AC 37 ms
23,648 KB
testcase_21 AC 37 ms
27,732 KB
testcase_22 AC 36 ms
25,576 KB
testcase_23 AC 35 ms
23,280 KB
testcase_24 AC 33 ms
23,856 KB
testcase_25 AC 33 ms
23,660 KB
testcase_26 AC 33 ms
23,732 KB
testcase_27 AC 36 ms
25,704 KB
testcase_28 AC 33 ms
23,536 KB
testcase_29 AC 33 ms
23,908 KB
testcase_30 AC 35 ms
25,564 KB
testcase_31 AC 37 ms
25,704 KB
testcase_32 AC 32 ms
23,664 KB
testcase_33 AC 41 ms
25,696 KB
testcase_34 AC 33 ms
23,528 KB
testcase_35 AC 34 ms
25,700 KB
testcase_36 AC 34 ms
23,660 KB
testcase_37 AC 60 ms
41,328 KB
testcase_38 AC 59 ms
41,328 KB
testcase_39 AC 59 ms
43,260 KB
testcase_40 AC 60 ms
43,644 KB
testcase_41 AC 60 ms
43,256 KB
testcase_42 AC 60 ms
43,248 KB
testcase_43 AC 60 ms
43,260 KB
testcase_44 AC 59 ms
45,424 KB
testcase_45 AC 59 ms
43,384 KB
testcase_46 AC 58 ms
43,256 KB
testcase_47 AC 175 ms
80,984 KB
testcase_48 AC 176 ms
71,680 KB
testcase_49 AC 252 ms
88,940 KB
testcase_50 AC 273 ms
93,136 KB
testcase_51 AC 242 ms
88,168 KB
testcase_52 AC 172 ms
70,660 KB
testcase_53 AC 226 ms
91,000 KB
testcase_54 AC 165 ms
75,500 KB
testcase_55 AC 113 ms
62,044 KB
testcase_56 AC 300 ms
97,620 KB
testcase_57 AC 29 ms
25,712 KB
testcase_58 AC 28 ms
23,788 KB
testcase_59 AC 30 ms
25,704 KB
testcase_60 AC 30 ms
23,668 KB
testcase_61 AC 30 ms
23,660 KB
testcase_62 AC 30 ms
25,836 KB
testcase_63 AC 42 ms
27,872 KB
testcase_64 AC 364 ms
106,176 KB
testcase_65 AC 41 ms
25,828 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 System.IO;
using System.Threading;
using System.Text;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n = sc.Int;
        var trie = new Trie('a', 26);
        long ans = 0;
        for (int i = 0; i < n; i++)
        {
            var s = sc.Str;
            ans += trie.insert(s, i);
        }
        Prt(ans);

    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(bool cond) { if (!cond) throw new Exception(); }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}
class Trie {
    int cnt, dep;
    int last, llen;
    private readonly char fir;
    private readonly int len;
    Trie[] childs;

    public Trie(char fir, int len) : this(fir, len, 0) {}
    Trie(char fir, int len, int dep) {
        cnt = 0;
        this.dep = dep;
        this.fir = fir;
        this.len = len;
        this.last = -1;
        this.llen = 0;

        childs = new Trie[len];
    }

    // Count(prefix == s)
    public int getcnt(string s) {
        if (dep == s.Length) return cnt;
        if (childs[s[dep] - fir] == null) return 0;
        return childs[s[dep] - fir].getcnt(s);
    }
    public int get_longest_prefix(string s) {
        if (dep == s.Length) return dep;
        if (childs[s[dep] - fir] == null) return dep;
        return childs[s[dep] - fir].get_longest_prefix(s);
    }
    public long insert(string s, int idx) {
        if (last == idx - 1) {
            last = idx;
            ++llen;
        }
        else {
            last = idx;
            llen = 1;
        }
        if (dep == 0) llen = 0;
        ++cnt;
        if (dep == s.Length) return llen * (long)(llen + 1) / 2;
        if (childs[s[dep] - fir] == null) {
            childs[s[dep] - fir] = new Trie(fir, len, dep + 1);
        }
        return llen * (long)(llen + 1) / 2 + childs[s[dep] - fir].insert(s, idx);
    }
    public void calc() {}
}
0