#588319 (C#(csc)) No.1308 ジャンプビーコン

提出ソース

結果

問題	No.1308 ジャンプビーコン
ユーザー	りあん
提出日時	2020-12-02 18:27:13
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	1,306 ms / 4,000 ms
コード長	7,340 bytes
コンパイル時間	1,406 ms
コンパイル使用メモリ	115,968 KB
実行使用メモリ	22,016 KB
最終ジャッジ日時	2024-09-15 06:44:27
合計ジャッジ時間	23,177 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	32 ms 19,200 KB
testcase_01	AC	32 ms 19,456 KB
testcase_02	AC	31 ms 19,456 KB
testcase_03	AC	32 ms 19,072 KB
testcase_04	AC	32 ms 19,200 KB
testcase_05	AC	32 ms 19,328 KB
testcase_06	AC	32 ms 19,328 KB
testcase_07	AC	32 ms 19,456 KB
testcase_08	AC	37 ms 19,584 KB
testcase_09	AC	37 ms 19,712 KB
testcase_10	AC	38 ms 19,712 KB
testcase_11	AC	37 ms 19,712 KB
testcase_12	AC	37 ms 19,712 KB
testcase_13	AC	94 ms 20,096 KB
testcase_14	AC	95 ms 20,224 KB
testcase_15	AC	94 ms 19,968 KB
testcase_16	AC	96 ms 19,968 KB
testcase_17	AC	95 ms 19,968 KB
testcase_18	AC	1,107 ms 21,632 KB
testcase_19	AC	1,104 ms 21,504 KB
testcase_20	AC	1,109 ms 21,888 KB
testcase_21	AC	1,094 ms 21,632 KB
testcase_22	AC	1,099 ms 21,504 KB
testcase_23	AC	32 ms 19,456 KB
testcase_24	AC	37 ms 19,584 KB
testcase_25	AC	37 ms 19,456 KB
testcase_26	AC	855 ms 21,632 KB
testcase_27	AC	865 ms 21,632 KB
testcase_28	AC	832 ms 21,632 KB
testcase_29	AC	1,028 ms 21,888 KB
testcase_30	AC	1,015 ms 21,760 KB
testcase_31	AC	1,306 ms 21,888 KB
testcase_32	AC	1,036 ms 22,016 KB
testcase_33	AC	1,195 ms 22,016 KB
testcase_34	AC	877 ms 21,632 KB
testcase_35	AC	858 ms 21,888 KB
testcase_36	AC	917 ms 21,760 KB
testcase_37	AC	909 ms 21,888 KB
testcase_38	AC	1,188 ms 21,632 KB
testcase_39	AC	1,192 ms 21,632 KB

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

コンパイルメッセージ

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.Text;
using System.Text.RegularExpressions;
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 << 28); // 256 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, q, c;
        sc.Multi(out n, out q, out c);
        edge = new List<P>[n];
        for (int i = 0; i < n; i++)
        {
            edge[i] = new List<P>();
        }
        for (int i = 0; i < n - 1; i++)
        {
            int u, v, l;
            sc.Multi(out u, out v, out l);
            --u;
            --v;
            edge[u].Add(new P(l, v));
            edge[v].Add(new P(l, u));
        }
        var x = sc.IntArr.Select(y => y - 1).ToArray();
        dp = new long[n];
        for (int i = 0; i < n; i++)
        {
            dp[i] = LM;
        }
        dp[x[0]] = 0;
        for (int i = 1; i < q; i++)
        {
            long dist = dfs(x[i - 1], -1, x[i]);
            dfs(x[i], -1, c, dist);
        }
        Prt(dp.Min());
    }
    List<P>[] edge;
    long[] dp;
    long dfs(int p, int par, int to) {
        if (p == to) return 0;
        foreach (var item in edge[p])
        {
            if (item.v2 == par) continue;
            long d = dfs(item.v2, p, to) + item.v1;
            if (d < LM) return d;
        }
        return LM;
    }
    long dfs(int p, int par, long l, long ds) {
        dp[p] += Math.Min(l, ds);
        foreach (var item in edge[p])
        {
            if (item.v2 == par) continue;
            dp[p] = Math.Min(dp[p], dfs(item.v2, p, l + item.v1, ds));
        }
        return dp[p];
    }
}

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(params bool[] conds) {
        if (conds.Any(x => !x)) 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;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    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.SelectMany(x => x));
    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 => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    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]);
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード