結果

問題 No.898 tri-βutree
ユーザー ひばちひばち
提出日時 2019-10-04 21:43:54
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 807 ms / 4,000 ms
コード長 10,455 bytes
コンパイル時間 2,816 ms
コンパイル使用メモリ 67,436 KB
実行使用メモリ 63,024 KB
最終ジャッジ日時 2023-08-08 15:53:52
合計ジャッジ時間 18,182 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 457 ms
63,024 KB
testcase_01 AC 66 ms
21,792 KB
testcase_02 AC 68 ms
21,704 KB
testcase_03 AC 68 ms
21,576 KB
testcase_04 AC 68 ms
23,688 KB
testcase_05 AC 67 ms
21,684 KB
testcase_06 AC 68 ms
23,748 KB
testcase_07 AC 800 ms
54,484 KB
testcase_08 AC 785 ms
52,604 KB
testcase_09 AC 785 ms
54,528 KB
testcase_10 AC 794 ms
54,584 KB
testcase_11 AC 798 ms
52,604 KB
testcase_12 AC 798 ms
52,780 KB
testcase_13 AC 807 ms
54,552 KB
testcase_14 AC 785 ms
56,612 KB
testcase_15 AC 779 ms
52,768 KB
testcase_16 AC 787 ms
54,476 KB
testcase_17 AC 792 ms
54,560 KB
testcase_18 AC 793 ms
52,688 KB
testcase_19 AC 783 ms
54,528 KB
testcase_20 AC 790 ms
52,512 KB
testcase_21 AC 794 ms
52,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Convert;
using static System.Math;
using System.Text;
using Pi=csat.Pair<int,int>;
using PL=csat.Pair<long,int>;

namespace csat
{
    class Program
    {
        public static bool chmin<T>(ref T t,T v)where T:IComparable<T>
        {if(t.CompareTo(v)==1){t=v;return true;} return false;}
        public static bool chmax<T>(ref T t,T v)where T:IComparable<T>
        {if(t.CompareTo(v)==-1){t=v;return true;}return false;}
        public static void swap<T>(ref T t1,ref T t2)
        {var tm=t1;t1=t2;t2=tm;}
        public static void Fail<T>(T s)
        {WriteLine(s);Console.Out.Close();Environment.Exit(0);}
        static void Main(string[] args)
        {
            var sw=new StreamWriter(Console.OpenStandardOutput()){AutoFlush=false};
            Console.SetOut(sw);
            var p=new Program();
            for(var i=1;i>0;i--)
                p.Solve();
            Console.Out.Flush();
        }
        void Solve(){
            var num=Input.num;
            var tr=new Tree(num);
            for(var i=0;i<num-1;i++){
                int a,b,c;
                Input.Make(out a,out b,out c);
                tr.AddEdge(a,b,c);
            }
            var q=Input.num;
            tr.LCABuild();
            while(q-->0){
                int x,y,z;
                Input.Make(out x,out y,out z);
                var res=long.MaxValue;
                var lca=tr.LCA(x,y);
                chmin(ref res,tr.Dist(x,y)+tr.Dist(lca,z));
                lca=tr.LCA(y,z);
                chmin(ref res,tr.Dist(y,z)+tr.Dist(lca,x));
                lca=tr.LCA(z,x);
                chmin(ref res,tr.Dist(z,x)+tr.Dist(lca,y));
                WriteLine(res);
            }
        }
    }
public class Tree
{
    public List<Pair<long, int>>[] edge;
    public int Count { get; }
    public Tree(int num)
    {
        Count = num;
        edge = Enumerable.Repeat(0, num).Select(_ => new List<Pair<long, int>>()).ToArray();
    }
    private static void swap<T>(ref T v1, ref T v2)
    { var t = v2; v2 = v1; v1 = t; }
    /// <summary>
    /// 辺を追加します
    /// </summary>
    /// <param name="u"></param>
    /// <param name="v"></param>
    /// <param name="weight"></param>
    public void AddEdge(int u, int v, long weight = 1)
    {
        edge[u].Add(new Pair<long, int>(weight, v));
        edge[v].Add(new Pair<long, int>(weight, u));
    }
    /// <summary>
    /// 木の直径をO(E)で求める
    /// 依存:Pair
    /// </summary>
    /// <param name="edge">辺の集合</param>
    /// <returns></returns>
    public long Diameter()
        => Diameter(Diameter(0).v2).v1;

    private Pair<long, int> Diameter(int st)
    {
        var dist = Enumerable.Repeat(-1L, Count).ToArray();
        dist[st] = 0;
        var que = new Queue<int>();
        que.Enqueue(st);
        var maxj = st;
        while (que.Any())
        {
            var p = que.Dequeue();
            foreach (var e in edge[p])
                if (dist[e.v2] == -1)
                {
                    dist[e.v2] = dist[p] + e.v1;
                    if (dist[maxj] < dist[e.v2]) maxj = e.v2;
                    que.Enqueue(e.v2);
                }
        }
        return new Pair<long, int>(dist[maxj], maxj);
    }

    private List<int> etList;
    /// <summary>
    /// オイラーツアー
    /// </summary>
    /// <param name="tree"></param>
    /// <param name="root"></param>
    /// <returns></returns>
    public List<int> EularTour(int root = 0)
    {
        etList = new List<int>(Count * 2);
        EularTour(root, -1);
        return etList;
    }
    private void EularTour(int index, int pa)
    {
        etList.Add(index);
        foreach (var c in edge[index])
            if (c.v2 != pa)
                EularTour(c.v2, index);
        etList.Add(index);
    }

    private int[][] parent;
    private int[] depth;
    private long[] dist;
    /// <summary>
    /// ダブリングで祖先テーブルを構築します
    /// 計算量:O(VlogV)
    /// </summary>
    /// <param name="root">根</param>
    public void LCABuild(int root = 0)
    {
        int ct = 0;
        for (var i = 31; i >= 0; i--)
            if ((1 & Count >> i) == 1)
            { ct = i; break; }
        parent = Enumerable.Repeat(0, ct + 1).Select(_ => Enumerable.Repeat(-1, Count).ToArray()).ToArray();
        depth = new int[Count];dist=new long[Count];
        LCAdfs(root, -1);
        for (var i = 1; i <= ct; i++)
            for (var j = 0; j < Count; j++)
                if (parent[i - 1][j] != -1)
                    parent[i][j] = parent[i - 1][parent[i - 1][j]];
    }
    private void LCAdfs(int index, int pa)
    {
        parent[0][index] = pa;
        foreach (var e in edge[index])
            if (e.v2 != pa)
            {
                depth[e.v2] = depth[index] + 1;
                dist[e.v2]=dist[index]+e.v1;
                LCAdfs(e.v2, index);
            }
    }
    public long Dist(int u,int v){
        return dist[u]+dist[v]-2*dist[LCA(u,v)];
    }
    /// <summary>
    /// 二頂点の最小共通祖先を求めます
    /// 計算量:O(logV)
    /// </summary>
    /// <param name="u"></param>
    /// <param name="v"></param>
    /// <returns></returns>
    public int LCA(int u, int v)
    {
        if (depth[u] > depth[v])
            swap(ref u, ref v);
        for (var i = parent.Length - 1; i >= 0; i--)
            if ((1 & (depth[v] - depth[u]) >> i) == 1)
                v = parent[i][v];
        if (u == v) return u;
        for (var i = parent.Length - 1; i >= 0; i--)
            if (parent[i][u] != parent[i][v])
            { u = parent[i][u]; v = parent[i][v]; }
        return parent[0][u];
    }

}

public class Input
{
    public static string read => ReadLine().Trim();
    public static int[] ar => read.Split(' ').Select(int.Parse).ToArray();
    public static int num => ToInt32(read);
    public static long[] arL => read.Split(' ').Select(long.Parse).ToArray();
    public static long numL => ToInt64(read);
    public static T[] create<T>(int n, Func<int, T> f)
        => Enumerable.Repeat(0, n).Select(f).ToArray();
    public static char[][] grid(int h)
        => create(h, _ => read.ToCharArray());
    public static int[] ar1D(int n)
        => create(n, _ => num);
    public static long[] arL1D(int n)
        => create(n, _ => numL);
    public static string[] strs(int n)
        => create(n, _ => read);
    public static int[][] ar2D(int n)
        => create(n, _ => ar);
    public static long[][] arL2D(int n)
        => create(n, _ => arL);
    public static List<T>[] edge<T>(int n)
        => create(n, _ => new List<T>());
    public static T GetValue<T>(string g)
    {
        var t = typeof(T);
        if (t == typeof(int))
            return (T)(object)int.Parse(g);
        if (t == typeof(long))
            return (T)(object)long.Parse(g);
        if (t == typeof(string))
            return (T)(object)g;
        if (t == typeof(char))
            return (T)(object)char.Parse(g);
        if (t == typeof(double))
            return (T)(object)double.Parse(g);
        if (t == typeof(bool))
            return (T)(object)bool.Parse(g);
        return default(T);
    }
    public static void Make<T1, T2>(out T1 v1, out T2 v2)
    {
        v1 = Next<T1>();
        v2 = Next<T2>();
    }
    public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3)
    {
        Make(out v1, out v2);
        v3 = Next<T3>();
    }
    public static 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 static 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 static 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>();
    }
    private static Queue<string> sc;
    public static T Next<T>() { sc = sc ?? new Queue<string>(); if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); return GetValue<T>(sc.Dequeue()); }
    public static void Next<T>(ref T val) => val = Next<T>();
    public const long Inf = (long)1e18;
    public const double eps = 1e-6;
    public const string Alfa = "abcdefghijklmnopqrstuvwxyz";
    public const int MOD = 1000000007;
}
 
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1 { get; set; }
    public T2 v2 { get; set; }
    public Pair() { v1 = Input.Next<T1>(); v2 = Input.Next<T2>(); }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }
 
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString()
        => $"{v1.ToString()} {v2.ToString()}";
    public override bool Equals(object obj)
        => this == (Pair<T1, T2>)obj;
    public override int GetHashCode()
        => v1.GetHashCode() ^ v2.GetHashCode();
    public static bool operator ==(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == 0;
    public static bool operator !=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != 0;
    public static bool operator >(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == 1;
    public static bool operator >=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != -1;
    public static bool operator <(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) == -1;
    public static bool operator <=(Pair<T1, T2> p1, Pair<T1, T2> p2)
        => p1.CompareTo(p2) != 1;
}
 
public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3 { get; set; }
    public Pair() : base() { v3 = Input.Next<T3>(); }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }
 
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString()
        => $"{base.ToString()} {v3.ToString()}";
}
}
0