結果

問題 No.2598 Kadomatsu on Tree
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-08-11 20:08:32
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 510 ms / 2,000 ms
コード長 12,892 bytes
コンパイル時間 7,251 ms
コンパイル使用メモリ 167,948 KB
実行使用メモリ 275,500 KB
最終ジャッジ日時 2024-08-11 20:09:07
合計ジャッジ時間 27,154 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
23,936 KB
testcase_01 AC 40 ms
23,808 KB
testcase_02 AC 43 ms
23,936 KB
testcase_03 AC 40 ms
23,936 KB
testcase_04 AC 40 ms
24,320 KB
testcase_05 AC 41 ms
24,320 KB
testcase_06 AC 47 ms
23,796 KB
testcase_07 AC 42 ms
23,808 KB
testcase_08 AC 41 ms
23,936 KB
testcase_09 AC 39 ms
23,796 KB
testcase_10 AC 40 ms
23,936 KB
testcase_11 AC 42 ms
24,064 KB
testcase_12 AC 42 ms
23,780 KB
testcase_13 AC 52 ms
26,740 KB
testcase_14 AC 53 ms
27,136 KB
testcase_15 AC 52 ms
26,880 KB
testcase_16 AC 55 ms
27,136 KB
testcase_17 AC 45 ms
24,576 KB
testcase_18 AC 54 ms
27,008 KB
testcase_19 AC 54 ms
26,852 KB
testcase_20 AC 46 ms
24,832 KB
testcase_21 AC 48 ms
24,832 KB
testcase_22 AC 55 ms
26,752 KB
testcase_23 AC 465 ms
67,408 KB
testcase_24 AC 431 ms
68,452 KB
testcase_25 AC 433 ms
68,212 KB
testcase_26 AC 473 ms
67,756 KB
testcase_27 AC 435 ms
67,728 KB
testcase_28 AC 451 ms
68,112 KB
testcase_29 AC 424 ms
68,772 KB
testcase_30 AC 423 ms
67,456 KB
testcase_31 AC 460 ms
68,352 KB
testcase_32 AC 441 ms
67,868 KB
testcase_33 AC 455 ms
69,232 KB
testcase_34 AC 444 ms
67,328 KB
testcase_35 AC 448 ms
69,392 KB
testcase_36 AC 447 ms
69,504 KB
testcase_37 AC 470 ms
69,240 KB
testcase_38 AC 451 ms
69,376 KB
testcase_39 AC 491 ms
69,524 KB
testcase_40 AC 435 ms
69,668 KB
testcase_41 AC 465 ms
69,548 KB
testcase_42 AC 468 ms
69,416 KB
testcase_43 AC 441 ms
69,792 KB
testcase_44 AC 447 ms
69,628 KB
testcase_45 AC 477 ms
69,760 KB
testcase_46 AC 436 ms
69,536 KB
testcase_47 AC 476 ms
69,404 KB
testcase_48 AC 489 ms
123,148 KB
testcase_49 AC 86 ms
35,700 KB
testcase_50 AC 301 ms
91,904 KB
testcase_51 AC 123 ms
49,920 KB
testcase_52 AC 171 ms
60,636 KB
testcase_53 AC 251 ms
50,000 KB
testcase_54 AC 194 ms
46,824 KB
testcase_55 AC 112 ms
34,304 KB
testcase_56 AC 303 ms
54,380 KB
testcase_57 AC 168 ms
44,516 KB
testcase_58 AC 449 ms
67,900 KB
testcase_59 AC 444 ms
68,752 KB
testcase_60 AC 464 ms
118,656 KB
testcase_61 AC 510 ms
125,696 KB
testcase_62 AC 471 ms
275,500 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (81 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
/home/judge/data/code/Main.cs(92,3674): warning CS8632: '#nullable' 注釈コンテキスト内のコードでのみ、Null 許容参照型の注釈を使用する必要があります。 [/home/judge/data/code/main.csproj]
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

using Lib;
using ModInt = Lib.StaticModInt<Lib.Mod998244353>;
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using static Lib.OutputLib;
public class Solver
{
    const bool MultiTestCase = false;
    void Solve()
    {
        int n = ri;
        var g = sc.ReadUnweightedTree(n);
        ReadArray(out int[] a, n);

        var dp = new ReRootingDP<int, bool, bool>(
            n,
            0,
            (x, y) => x + y,
            (x, _) => x,
            (x, _) => x + 1
        );
        for (int i = 0; i < n; i++)
            foreach (var j in g[i])
                if (i < j) dp.AddEdge(i, j, false);
        dp.Calc();

        ModInt ans = 0;
        for (int i = 0; i < n; i++)
        {
            ModInt l1 = 0, l2 = 0;
            ModInt g1 = 0, g2 = 0;
            foreach (var j in g[i])
            {
                long v = dp[j, i];
                if (a[j] < a[i])
                {
                    l1 += v;
                    l2 += v * v;
                }
                if (a[j] > a[i])
                {
                    g1 += v;
                    g2 += v * v;
                }
            }
            ans += l1 * l1 - l2;
            ans += g1 * g1 - g2;
        }
        ans /= 2;
        Write(ans);
    }

#pragma warning disable CS0162
    public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162

    const int IINF = 1 << 30;
    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
    ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
    double rd { [MethodImpl(256)] get => sc.Double(); }
    string rs { [MethodImpl(256)] get => sc.Scan(); }
    string rline { [MethodImpl(256)] get => sc.Line(); }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
    void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; }
    void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; }
    void ReadArray<T>(out T[] a, int n, Func<T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); }
    void ReadArray<T>(out T[] a, int n, Func<int, T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); }
}

static class Program
{
    static public void Main(string[] args)
    {
        SourceExpander.Expander.Expand();
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}
#region Expanded by https://github.com/kzrnm/SourceExpander
namespace Lib{public class ReRootingDP<T,V,E>where T:struct{private readonly int n;private readonly T id;private readonly Func<T,T,T>op;private readonly Func<T,E,T>add_edge;private readonly Func<T,V,T>add_vertex;private readonly List<(int to,E data)>[]edges;private readonly V[]vertex_data;int edge_count=0;(int to,E data)[]csr;int[]csr_idx;T[]ans,dp;public T this[int i,int j]{get=>dp[GetDPIndex(i,j)];}public T this[int i]{get=>ans[i];}public ReRootingDP(int n,T id,Func<T,T,T>op,Func<T,E,T>add_edge,Func<T,V,T>add_vertex){this.n=n;this.id=id;this.op=op;this.add_edge=add_edge;this.add_vertex=add_vertex;edges=new List<(int,E)>[n];for(int i=0;i<n;i++)edges[i]=new List<(int,E)>();vertex_data=new V[n];}public void SetVertex(int u,V data)=>vertex_data[u]=data;public int AddEdge(int u,int v,E data){edges[u].Add((v,data));edges[v].Add((u,data));return edge_count++;}public int AddEdge(int u,int v,E data,E rdata){edges[u].Add((v,data));edges[v].Add((u,rdata));return edge_count++;}public void UnsafeDirectedAddEdge(int u,int v,E data)=>edges[u].Add((v,data));public T[]Calc(){CSRBuild();dp=new T[2*(n-1)];ans=new T[n];seen=new bool[n];for(int i=0;i<n;i++)if(!seen[i])DFS1(i);seen=new bool[n];for(int i=0;i<n;i++)if(!seen[i])DFS2(i);return(T[])ans.Clone();}bool[]seen;private void DFS1(int x,int p=-1){seen[x]=true;T val=id;for(int idx=csr_idx[x];idx<csr_idx[x+1];idx++){var(y,e)=csr[idx];if(y==p)continue;DFS1(y,x);val=op(val,add_edge(dp[GetDPIndex(y,x)],e));}if(p==-1)ans[x]=add_vertex(val,vertex_data[x]);else dp[GetDPIndex(x,p)]=add_vertex(val,vertex_data[x]);}private void DFS2(int x,int p=-1){seen[x]=true;int deg=csr_idx[x+1]-csr_idx[x];var dp_r=new T[deg+1];dp_r[deg]=id;for(int i=deg-1;i>=0;i--){var(y,e)=csr[csr_idx[x]+i];dp_r[i]=op(dp_r[i+1],add_edge(dp[GetDPIndex(y,x)],e));}if(p!=-1)ans[x]=add_vertex(dp_r[0],vertex_data[x]);T sum_l=id;for(int i=0;i<deg;i++){var(y,e)=csr[csr_idx[x]+i];if(y!=p){dp[GetDPIndex(x,y)]=add_vertex(op(sum_l,dp_r[i+1]),vertex_data[x]);DFS2(y,x);}sum_l=op(sum_l,add_edge(dp[GetDPIndex(y,x)],e));}}[MethodImpl(256)]private void CSRBuild(){csr_idx=new int[n+1];csr=new(int to,E data)[2*(n-1)];for(int x=0,z=0;x<n;x++){edges[x].Sort((p1,p2)=>p1.to-p2.to);for(int i=0;i<edges[x].Count;i++)csr[z++]=edges[x][i];csr_idx[x+1]=z;}}[MethodImpl(256)]private int GetDPIndex(int x,int y){int l=csr_idx[x],r=csr_idx[x+1];while(r-l>1){int m=(l+r)/2;if(csr[m].to<=y)l=m;else r=m;}return l;}}}
namespace Lib{public partial class StreamScanner{public int[][]ReadUnweightedTree(int n,int origin=1){var gr=new List<int>[n];for(int i=0;i<n;i++)gr[i]=new List<int>();for(int i=0;i<n-1;i++){int u=(int)(Integer()-origin);int v=(int)(Integer()-origin);gr[u].Add(v);gr[v].Add(u);}var g=new int[n][];for(int i=0;i<n;i++)g[i]=gr[i].ToArray();return g;}}}
namespace Lib{public partial class StreamScanner{public StreamScanner(Stream stream){str=stream;}private readonly Stream str;private readonly byte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byte Read(){if(isEof)throw new EndOfStreamException();if(ptr>=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b=0;do b=Read();while(b<33||126<b);return(char)b;}[MethodImpl(256)]public string Line(){var sb=new StringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public string Scan(){var sb=new StringBuilder();for(var b=Char();b>=33&&b<=126;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public long Integer(){long ret=0;byte b=0;var ng=false;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;true;b=Read()){if(b<'0'||'9'<b)return ng?-ret:ret;else ret=ret*10+b-'0';}}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b=0;do b=Read();while(b<'0'||'9'<b);for(;true;b=Read()){if(b<'0'||'9'<b)return ret;else ret=ret*10+b-'0';}}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}
namespace Lib{public interface IStaticMod{uint Mod{get;}bool IsPrime{get;}}public readonly struct Mod1000000007:IStaticMod{public uint Mod=>1000000007;public bool IsPrime=>true;}public readonly struct Mod998244353:IStaticMod{public uint Mod=>998244353;public bool IsPrime=>true;}public readonly struct StaticModInt<T>:IEquatable<StaticModInt<T>>where T:struct,IStaticMod{internal readonly uint _v;private static readonly T op=default;public int Value=>(int)_v;public static int Mod=>(int)op.Mod;public static StaticModInt<T>Zero=>default;public static StaticModInt<T>One=>new StaticModInt<T>(1u);[MethodImpl(256)]public static StaticModInt<T>Raw(int v){var u=unchecked((uint)v);return new StaticModInt<T>(u);}[MethodImpl(256)]public StaticModInt(long v):this(Round(v)){}[MethodImpl(256)]public StaticModInt(ulong v):this((uint)(v%op.Mod)){}[MethodImpl(256)]private StaticModInt(uint v)=>_v=v;[MethodImpl(256)]private static uint Round(long v){var x=v%op.Mod;if(x<0)x+=op.Mod;return(uint)x;}[MethodImpl(256)]public static StaticModInt<T>operator ++(StaticModInt<T>v){var x=v._v+1;if(x==op.Mod)x=0;return new StaticModInt<T>(x);}[MethodImpl(256)]public static StaticModInt<T>operator --(StaticModInt<T>v){var x=v._v;if(x==0)x=op.Mod;return new StaticModInt<T>(x-1);}[MethodImpl(256)]public static StaticModInt<T>operator+(StaticModInt<T>lhs,StaticModInt<T>rhs){var v=lhs._v+rhs._v;if(v>=op.Mod)v-=op.Mod;return new StaticModInt<T>(v);}[MethodImpl(256)]public static StaticModInt<T>operator-(StaticModInt<T>lhs,StaticModInt<T>rhs){unchecked{var v=lhs._v-rhs._v;if(v>=op.Mod)v+=op.Mod;return new StaticModInt<T>(v);}}[MethodImpl(256)]public static StaticModInt<T>operator*(StaticModInt<T>lhs,StaticModInt<T>rhs)=>new StaticModInt<T>((uint)((ulong)lhs._v*rhs._v%op.Mod));[MethodImpl(256)]public static StaticModInt<T>operator/(StaticModInt<T>lhs,StaticModInt<T>rhs)=>new StaticModInt<T>((uint)((ulong)lhs._v*Inv(rhs._v)%op.Mod));[MethodImpl(256)]public static StaticModInt<T>operator+(StaticModInt<T>v)=>v;[MethodImpl(256)]public static StaticModInt<T>operator-(StaticModInt<T>v)=>new StaticModInt<T>(v._v==0?0:op.Mod-v._v);[MethodImpl(256)]public static bool operator==(StaticModInt<T>lhs,StaticModInt<T>rhs)=>lhs._v==rhs._v;[MethodImpl(256)]public static bool operator!=(StaticModInt<T>lhs,StaticModInt<T>rhs)=>lhs._v!=rhs._v;[MethodImpl(256)]public static implicit operator StaticModInt<T>(int v)=>new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(uint v)=>new StaticModInt<T>((long)v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(long v)=>new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(ulong v)=>new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator long(StaticModInt<T>v)=>v._v;[MethodImpl(256)]public static implicit operator ulong(StaticModInt<T>v)=>v._v;[MethodImpl(256)]public StaticModInt<T>Pow(long n){var x=this;var r=new StaticModInt<T>(1U);if(n<0)(x,n)=(x.Inv(),-n);while(n>0){if((n&1)>0)r*=x;x*=x;n>>=1;}return r;}[MethodImpl(256)]public StaticModInt<T>Inv()=>new StaticModInt<T>(Inv(_v));[MethodImpl(256)]static ulong Inv(ulong x){long u=op.Mod,xu=1,yu=0,v=(long)x,xv=0,yv=1;while(v!=0){long w=SafeMod(u,v);long q=(u-w)/v;long xw=xu-xv*q;long yw=yu-yv*q;u=v;xu=xv;yu=yv;v=w;xv=xw;yv=yw;}return(ulong)(yu<0?yu+op.Mod:yu);}[MethodImpl(256)]static long SafeMod(long x,long m){long r=x%m;if(r<0)r+=m;return r;}[MethodImpl(256)]public override string ToString()=>_v.ToString();[MethodImpl(256)]public string ToString(string format,IFormatProvider formatProvider)=>_v.ToString(format,formatProvider);[MethodImpl(256)]public override bool Equals(object?obj)=>obj is StaticModInt<T>m&&Equals(m);[MethodImpl(256)]public bool Equals(StaticModInt<T>other)=>_v==other._v;[MethodImpl(256)]public override int GetHashCode()=>_v.GetHashCode();}}
namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin<T>(string s,IEnumerable<T>t)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat<T>(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i<sz1;i++){for(int j=0;j<sz2;j++)b[j]=a[i,j];WriteJoin(sep,b);}}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,string sep=" "){for(int i=0;i<a.Length;i++)WriteJoin(sep,a[i]);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){for(int i=0;i<a.Length;i++)WriteJoin(sep,a[i].Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public static void Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static void Yn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}}
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander
0