結果

問題 No.1843 Tree ANDistance
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2022-02-27 17:57:03
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 781 ms / 2,000 ms
コード長 10,014 bytes
コンパイル時間 3,084 ms
コンパイル使用メモリ 115,876 KB
実行使用メモリ 94,264 KB
最終ジャッジ日時 2023-09-19 05:24:25
合計ジャッジ時間 22,307 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 643 ms
60,248 KB
testcase_01 AC 648 ms
58,084 KB
testcase_02 AC 776 ms
94,264 KB
testcase_03 AC 781 ms
87,572 KB
testcase_04 AC 644 ms
59,700 KB
testcase_05 AC 617 ms
61,528 KB
testcase_06 AC 619 ms
62,420 KB
testcase_07 AC 625 ms
56,568 KB
testcase_08 AC 639 ms
59,400 KB
testcase_09 AC 775 ms
88,408 KB
testcase_10 AC 768 ms
86,040 KB
testcase_11 AC 627 ms
57,504 KB
testcase_12 AC 562 ms
54,744 KB
testcase_13 AC 576 ms
55,264 KB
testcase_14 AC 77 ms
25,692 KB
testcase_15 AC 79 ms
23,572 KB
testcase_16 AC 71 ms
23,700 KB
testcase_17 AC 70 ms
21,772 KB
testcase_18 AC 68 ms
21,648 KB
testcase_19 AC 80 ms
23,760 KB
testcase_20 AC 71 ms
23,780 KB
testcase_21 AC 65 ms
23,708 KB
testcase_22 AC 64 ms
21,696 KB
testcase_23 AC 64 ms
21,668 KB
testcase_24 AC 65 ms
21,804 KB
testcase_25 AC 65 ms
21,720 KB
testcase_26 AC 65 ms
21,768 KB
testcase_27 AC 66 ms
21,728 KB
testcase_28 AC 452 ms
48,988 KB
testcase_29 AC 317 ms
43,288 KB
testcase_30 AC 359 ms
57,528 KB
testcase_31 AC 673 ms
80,128 KB
testcase_32 AC 466 ms
51,124 KB
testcase_33 AC 177 ms
34,852 KB
testcase_34 AC 359 ms
47,196 KB
testcase_35 AC 65 ms
21,568 KB
testcase_36 AC 65 ms
21,688 KB
testcase_37 AC 64 ms
21,736 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.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;

static class Program{
	const long inf=long.MaxValue>>1;
	const int mod=(int)1e9+7;
	static Sc sc=new Sc();
	static void Main(){
		Pt pt=new Pt(Solve);
		pt.Sm();
	}
	static void Solve(Pt pt) {
		int n=sc.I,m=n-1;
		var li=new List<(int v,int d)>[n+1];
		var b=new bool[n+1];
		var dt=new Dt[n+1];
		for(int i=1;i<=n;i++){
			li[i]=new List<(int,int)>();
			dt[i]=new Dt(1);
		}
		for(int i=0;i<m;i++){
			var e=sc.Ia;
			li[e[0]].Add((e[1],e[2]));
			li[e[1]].Add((e[0],e[2]));
		}
		Fu1(1);
		b=new bool[n+1];
		Fu2(1,0);
		Mint ans=0;
		for(int i = 1;i <= n;i++) {ans+=dt[i].Sum();}
		pt.Wl(ans/2);
		void Fu1(int a){
			b[a]=true;
			for(int i=0;i<li[a].Count;i++){
				if(!b[li[a][i].v]){
					Fu1(li[a][i].v);
					dt[a].Add(dt[li[a][i].v],li[a][i].d);
				}
			}
		}
		void Fu2(int a,int g){
			b[a]=true;
			for(int i=0;i<li[a].Count;i++){
				if(!b[li[a][i].v]){
					var p=new Dt(dt[a]);
					p.Sub(dt[li[a][i].v],li[a][i].d);
					dt[li[a][i].v].Add(p,li[a][i].d);
					Fu2(li[a][i].v,a);
				}
			}
		}
		
	}
}
public struct Mint{
	const int mod=(int)1e9+7;
	private long d;
	public Mint(long d){this.d=d;}
	public static implicit operator Mint(long d){return new Mint(d%mod);}
	public static explicit operator long(Mint d){return d.d;}
	public override string ToString(){return d.ToString();}
	public static Mint operator+(Mint a,long b){a.d=(mod+a.d+b%mod)%mod;return a;}
	public static Mint operator+(Mint a,Mint b){a.d=(a.d+b.d)%mod;return a;}
	public static Mint operator-(Mint a,long b){a.d=(mod+a.d-b%mod)%mod;return a;}
	public static Mint operator-(Mint a,Mint b){a.d=(mod+a.d-b.d)%mod;return a;}
	public static Mint operator*(Mint a,long b){a.d=b%mod*a.d%mod;return a;}
	public static Mint operator*(Mint a,Mint b){a.d=a.d*b.d%mod;return a;}
	public static Mint operator/(Mint a,long b){a.d=a.d*Mi(b)%mod;return a;}
	public static Mint operator/(Mint a,Mint b){a.d=a.d*Mi(b.d)%mod;return a;}
	public static bool operator==(Mint a,long b){return (long)a==b;}
	public static bool operator!=(Mint a,long b){return (long)a!=b;}
	public override bool Equals(object obj){return false;}
	public override int GetHashCode(){return 0;}
	public static long Mi(long a){
		a=(a+mod)%mod;
		long b=mod,u=1,v=0;
		while(b>0){
			long t=a/b;
			a-=t*b;(a,b)=(b,a);
			u-=t*v;(u,v)=(v,u);
		}
		u%=mod;
		if(u<0){u+=mod;}
		return u%mod;
	}
}
public class Dt{
	public int n;
	public int[] h;
	const int m=31,mod=(int)1e9+7;
	public Dt(int z){
		n=z;
		h=Enumerable.Repeat(z,m).ToArray();
	}
	public Dt(Dt d){
		n=d.n;
		h=new int[m];
		Array.Copy(d.h,h,m);
	}
	public void Add(Dt d,int c) {
		n+=d.n;
		for(int i = 0;i < m;i++) {
			if(((1<<i)&c)!=0) {h[i]+=d.h[i];}
		}
	}
	public void Sub(Dt d,int c) {
		n-=d.n;
		for(int i = 0;i < m;i++) {
			if(((1<<i)&c)!=0) {h[i]-=d.h[i];}
		}
	}
	public long Sum() {
		long p=0;
		for(int i = 0;i < m;i++) {p=(p+(h[i]-1)*(1L<<i))%mod;}
		return p;
	}
}

public class Pt{
	private StringBuilder sb=new StringBuilder();
	public Pt(Action<Pt> f){f(this);}
	public void W(int s){sb.Append(s);}
	public void W(long s){sb.Append(s);}
	public void W(double s){sb.Append(s);}
	public void W(decimal s){sb.Append(s);}
	public void W(string s){sb.Append(s);}
	public void W(object s){sb.Append(s);}
	public void W(string f,int s){sb.Append(s.ToString(f));}
	public void W(string f,long s){sb.Append(s.ToString(f));}
	public void W(string f,double s){sb.Append(s.ToString(f));}
	public void W(string f,decimal s){sb.Append(s.ToString(f));}
	public void Wl(int s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(long s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(double s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(decimal s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(string s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(object s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(string f,int s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,long s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,double s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(string f,decimal s){sb.Append(s.ToString(f)).Append(Environment.NewLine);}
	public void Wl(int[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(long[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(double[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(string[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(object[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(){sb.Append(Environment.NewLine);}
	public void Sm(){Console.Write(sb);}
	public static bool operator==(Pt a,Pt b){return a.sb.ToString()==b.sb.ToString();}
	public static bool operator!=(Pt a,Pt b){return a.sb.ToString()!=b.sb.ToString();}
	public override bool Equals(object obj){return false;}
	public override int GetHashCode(){return 0;}
}
public class Sc{
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string Rl(){return Console.ReadLine();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string[] Sp(string st){return st.Split();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
	public virtual int I{get{return int.Parse(Rl());}}
	public virtual long L{get{return long.Parse(Rl());}}
	public virtual double D{get{return double.Parse(Rl());}}
	public virtual string S{get{return Rl();}}
	public int[] Ia{get{return Array.ConvertAll(Sp(Rl()),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Sp(Rl()),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Sp(Rl()),double.Parse);}}
	public string[] Sa{get{return Sp(Rl());}}
	public object[] Oa{get{return Sp(Rl());}}
	public int[] Ia2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),double.Parse);}}
	public double[] Da3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),double.Parse);}
	public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
	public T[] Arr<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;}
	public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Sp(Rl()));}return a;}
	public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Sp(Rl()));}return a;}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T) Tp2<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T) Tp3<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T) Tp4<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T) Tp5<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T,T) Tp6<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]),Ct<T>(s[5]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T2) Tp2<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T1,T2) Tp3<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
}
public class Scr:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	private bool bo=false;
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string Rl(){
		if(bo){return li[l++%li.Count];}
		li.Add(Console.ReadLine());
		return li[li.Count-1];
	}
	public void Again(){bo=true;}
}
public class Sc2:Sc{
	private string[] sps=new string[]{" ","　","\t"};
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string[] Sp(string st){return st.Split(sps,StringSplitOptions.RemoveEmptyEntries);}
	public override int I{get{return int.Parse(Sp(Rl())[0]);}}
	public override long L{get{return long.Parse(Sp(Rl())[0]);}}
	public override double D{get{return double.Parse(Sp(Rl())[0]);}}
	public override string S{get{return Sp(Rl())[0];}}
}
public class Sct:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	public void Add(int s){li.Add(s.ToString());}
	public void Add(long s){li.Add(s.ToString());}
	public void Add(double s){li.Add(s.ToString());}
	public void Add(string s){li.Add(s.ToString());}
	public void Add(object s){li.Add(s.ToString());}
	public void Add(int[] s){li.Add(string.Join(" ",s));}
	public void Add(long[] s){li.Add(string.Join(" ",s));}
	public void Add(double[] s){li.Add(string.Join(" ",s));}
	public void Add(string[] s){li.Add(string.Join(" ",s));}
	public void Add(object[] s){li.Add(string.Join(" ",s));}
	protected override string Rl(){return li[l++];}
	public void Clear(){li.Clear();l=0;}
	public void Again(){l=0;}
	public void Pf(){Console.WriteLine(string.Join("\n",li));}
}
0