結果

問題 No.2634 Tree Distance 3
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-02-17 00:16:50
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 932 ms / 3,000 ms
コード長 18,644 bytes
コンパイル時間 7,760 ms
コンパイル使用メモリ 159,152 KB
実行使用メモリ 232,340 KB
最終ジャッジ日時 2024-02-17 00:17:40
合計ジャッジ時間 47,500 ms
ジャッジサーバーID
（参考情報） 		judge16 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 615 ms
84,608 KB
testcase_01 AC 608 ms
84,608 KB
testcase_02 AC 587 ms
84,608 KB
testcase_03 AC 601 ms
84,608 KB
testcase_04 AC 583 ms
84,608 KB
testcase_05 AC 591 ms
84,608 KB
testcase_06 AC 621 ms
84,608 KB
testcase_07 AC 586 ms
84,608 KB
testcase_08 AC 488 ms
88,004 KB
testcase_09 AC 495 ms
89,672 KB
testcase_10 AC 516 ms
89,424 KB
testcase_11 AC 472 ms
85,340 KB
testcase_12 AC 483 ms
81,936 KB
testcase_13 AC 491 ms
90,272 KB
testcase_14 AC 485 ms
84,488 KB
testcase_15 AC 480 ms
87,876 KB
testcase_16 AC 607 ms
82,388 KB
testcase_17 AC 383 ms
59,220 KB
testcase_18 AC 483 ms
65,492 KB
testcase_19 AC 505 ms
70,628 KB
testcase_20 AC 194 ms
44,880 KB
testcase_21 AC 907 ms
91,292 KB
testcase_22 AC 838 ms
91,292 KB
testcase_23 AC 806 ms
91,292 KB
testcase_24 AC 832 ms
88,952 KB
testcase_25 AC 859 ms
89,080 KB
testcase_26 AC 860 ms
88,952 KB
testcase_27 AC 932 ms
88,952 KB
testcase_28 AC 881 ms
88,956 KB
testcase_29 AC 831 ms
88,956 KB
testcase_30 AC 694 ms
86,424 KB
testcase_31 AC 668 ms
86,560 KB
testcase_32 AC 667 ms
86,428 KB
testcase_33 AC 467 ms
71,148 KB
testcase_34 AC 142 ms
40,612 KB
testcase_35 AC 275 ms
55,964 KB
testcase_36 AC 184 ms
44,912 KB
testcase_37 AC 318 ms
59,028 KB
testcase_38 AC 64 ms
27,428 KB
testcase_39 AC 65 ms
27,428 KB
testcase_40 AC 63 ms
27,300 KB
testcase_41 AC 63 ms
27,300 KB
testcase_42 AC 64 ms
27,300 KB
testcase_43 AC 238 ms
50,564 KB
testcase_44 AC 178 ms
43,132 KB
testcase_45 AC 562 ms
78,660 KB
testcase_46 AC 379 ms
61,040 KB
testcase_47 AC 643 ms
83,192 KB
testcase_48 AC 650 ms
86,424 KB
testcase_49 AC 649 ms
86,276 KB
testcase_50 AC 668 ms
85,968 KB
testcase_51 AC 645 ms
86,276 KB
testcase_52 AC 658 ms
86,432 KB
testcase_53 AC 63 ms
27,300 KB
testcase_54 AC 63 ms
27,300 KB
testcase_55 AC 63 ms
27,300 KB
testcase_56 AC 64 ms
27,300 KB
testcase_57 AC 64 ms
27,300 KB
testcase_58 AC 57 ms
26,660 KB
testcase_59 AC 58 ms
26,660 KB
testcase_60 AC 596 ms
84,612 KB
testcase_61 AC 590 ms
84,612 KB
testcase_62 AC 618 ms
84,612 KB
testcase_63 AC 451 ms
80,328 KB
testcase_64 AC 325 ms
62,892 KB
testcase_65 AC 429 ms
78,100 KB
testcase_66 AC 172 ms
46,440 KB
testcase_67 AC 157 ms
44,336 KB
testcase_68 AC 478 ms
81,504 KB
testcase_69 AC 444 ms
81,632 KB
testcase_70 AC 460 ms
232,340 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (101 ms)。
MSBuild のバージョン 17.7.3+8ec440e68 (.NET)
/home/judge/data/code/Main.cs(92,4067): warning CS8632: '#nullable' 注釈コンテキスト内のコードでのみ、Null 許容参照型の注釈を使用する必要があります。 [/home/judge/data/code/main.csproj]
  main -> /home/judge/data/code/bin/Release/net7.0/main.dll
  main -> /home/judge/data/code/bin/Release/net7.0/publish/

ソースコード

diff # 

using System;
using System.ComponentModel;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Text;
using static Functions;
using static OutputLib;

using ModInt = StaticModInt<Mod998244353>;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}

public class Solver
{
    public Solver()
    {
        Solve();
    }

    void Solve()
    {
        int n = ri;
        var a = new int[n];
        for (int i = 0; i < n; i++) a[i] = ri;

        var g = new Graph<int>(n);
        for (int i = 0; i < n - 1; i++) g.AddEdge(ri - 1, ri - 1, 1);
        var td = new TreeDoubling<int>(g, (x, y) => x + y, x => -x, () => 0);

        var ax = new (int i, int a)[n];
        for (int i = 0; i < n; i++) ax[i] = (i, a[i]);
        Array.Sort(ax, (p1, p2) => -(p1.a - p2.a));
        int u = -1, v = -1;
        var ans = new int[n];
        var st = new Stack<int>();
        for (int i = 0; i < n; i++)
        {
            var (x, _) = ax[i];
            st.Push(x);
            if (u == -1) (u, v) = (x, x);
            int d0 = td.Dist(u, v);
            int d1 = td.Dist(x, v);
            int d2 = td.Dist(u, x);
            if (d0 < d1 && d2 <= d1) u = x;
            if (d0 < d2 && d1 < d2) v = x;
            if (i == n - 1 || a[x] > ax[i + 1].a)
                while (st.Count > 0)
                {
                    int y = st.Pop();
                    ans[y] = Math.Max(td.Dist(y, u), td.Dist(y, v));
                }
        }
        WriteJoin(" ", ans);
    }

    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    (int, int) ri2 { [MethodImpl(256)] get => (ri, ri); }
    (int, int, int) ri3 { [MethodImpl(256)] get => (ri, ri, ri); }
    (int, int, int, int) ri4 { [MethodImpl(256)] get => (ri, ri, ri, ri); }
    (int, int, int, int, int) ri5 { [MethodImpl(256)] get => (ri, ri, ri, ri, ri); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    (long, long) rl2 { [MethodImpl(256)] get => (rl, rl); }
    (long, long, long) rl3 { [MethodImpl(256)] get => (rl, rl, rl); }
    (long, long, long, long) rl4 { [MethodImpl(256)] get => (rl, rl, rl, rl); }
    (long, long, long, long, long) rl5 { [MethodImpl(256)] get => (rl, rl, rl, rl, rl); }
    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());
}
public static class Functions { [MethodImpl(256)] public static int Popcount(ulong x) { x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL); x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL); x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL); x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL); x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL); x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL); return (int)x; } [MethodImpl(256)] public static int Popcount(long x) { x = (x & 0x5555555555555555L) + ((x >> 1) & 0x5555555555555555L); x = (x & 0x3333333333333333L) + ((x >> 2) & 0x3333333333333333L); x = (x & 0x0f0f0f0f0f0f0f0fL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fL); x = (x & 0x00ff00ff00ff00ffL) + ((x >> 8) & 0x00ff00ff00ff00ffL); x = (x & 0x0000ffff0000ffffL) + ((x >> 16) & 0x0000ffff0000ffffL); x = (x & 0x00000000ffffffffL) + ((x >> 32) & 0x00000000ffffffffL); return (int)x; } [MethodImpl(256)] public static int Popcount(int x) { x = (x & 0x55555555) + ((x >> 1) & 0x55555555); x = (x & 0x33333333) + ((x >> 2) & 0x33333333); x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f); x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff); x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff); return x; } [MethodImpl(256)] public static int Ctz(long x) { if (x == 0) return -1; return Popcount((ulong)((x & -x) - 1)); } [MethodImpl(256)] public static int CeilPow2(int n) { int x = 0; while ((1 << x) < n) x++; return x; } [MethodImpl(256)] public static int SafeMod(int x, int m) { int r = x % m; return r < 0 ? r + Math.Abs(m) : r; } [MethodImpl(256)] public static long SafeMod(long x, long m) { long r = x % m; return r < 0 ? r + Math.Abs(m) : r; } [MethodImpl(256)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1); [MethodImpl(256)] public static int Sign(double x) => x == 0 ? 0 : (x < 0 ? -1 : 1); [MethodImpl(256)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; } [MethodImpl(256)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1; [MethodImpl(256)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b; [MethodImpl(256)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static uint Gcd(uint a, uint b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static ulong Gcd(ulong a, ulong b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static (long x, long y, long g) ExtGcd(long a, long b) { if (b == 0) return (Sign(a), 0, Math.Abs(a)); long c = SafeMod(a, b); var (x2, y2, g) = ExtGcd(b, c); long x = SafeMod(y2, b); long y = (g - a * x) / b; return (x, y, g); } [MethodImpl(256)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(256)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(256)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; } [MethodImpl(256)] public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); [MethodImpl(256)] public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); [MethodImpl(256)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; } [MethodImpl(256)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; } [MethodImpl(256)] public static int LowerBound(long[] arr, long val, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), t => Sign(t - val), l, r); [MethodImpl(256)] public static int LowerBound(int[] arr, int val, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), t => t - val, l, r); [MethodImpl(256)] public static int LowerBound<T>(T[] arr, T val, int l = -1, int r = -1) where T : IComparable<T> => LowerBound(arr.AsSpan(), t => t.CompareTo(val), l, r); [MethodImpl(256)] public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), comp, l, r); [MethodImpl(256)] public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1) { if (data.Length == 0) return -1; if (l == -1) l = 0; if (r == -1) r = data.Length; while (l < r) { int x = (l + r) / 2; if (comp(data[x]) < 0) l = x + 1; else r = x; } return l; } [MethodImpl(256)] public static int RangeCount<T>(T[] arr, T geq, T lt, int l = -1, int r = -1) where T : IComparable<T> => Math.Max(0, LowerBound(arr.AsSpan(), t => t.CompareTo(lt), l, r) - LowerBound(arr.AsSpan(), t => t.CompareTo(geq), l, r)); [MethodImpl(256)] public static string ToBase2(long v, int digit = -1) { if (digit == -1) { digit = 0; while ((v >> digit) > 0) digit++; } var c = new string[digit]; for (int i = 0; i < digit; i++) c[digit - 1 - i] = ((v >> i) & 1) == 0 ? "0" : "1"; return string.Join("", c); } [MethodImpl(256)] public static string ToBaseN(long v, int n, int digit = -1) { if (digit == -1) { digit = 0; long pow = 1; while (v >= pow) { digit++; pow *= n; } } var c = new int[digit]; for (int i = 0; i < digit; i++, v /= n) c[digit - 1 - i] = (int)(v % n); return string.Join("", c); } }
public 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()); } 
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(string str) => Console.WriteLine(str); [MethodImpl(256)] public static void Write(string str, object arg1) => Console.WriteLine(str, arg1); [MethodImpl(256)] public static void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2); [MethodImpl(256)] public static void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3); [MethodImpl(256)] public static void Write(string str, params object[] arg) => Console.WriteLine(str, arg); [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"); } 
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); 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(); } 
public class Graph<T> { public struct Edge { public int from, to; public T data; public Edge(int _from, int _to, T _data) { from = _from; to = _to; data = _data; } public Edge(int _to, T _data) { from = -1; to = _to; data = _data; } } int n; public int Size => n; public List<Edge>[] edges; public Graph(List<int>[] _g, Func<T> _e) { n = _g.Length; edges = new List<Edge>[n]; for (int i = 0; i < n; i++) edges[i] = new List<Edge>(); for (int i = 0; i < n; i++) foreach (var j in _g[i]) edges[i].Add(new Edge(i, j, _e())); } public Graph(int _n) { n = _n; edges = new List<Edge>[n]; for (int i = 0; i < n; i++) edges[i] = new List<Edge>(); } public void AddEdge(int x, int y, T data) { edges[x].Add(new Edge(x, y, data)); edges[y].Add(new Edge(y, x, data)); } public void AddDirectedEdge(int src, int to, T data) { edges[src].Add(new Edge(src, to, data)); } }
public class TreeDoubling<T> { int n, log, root; int[] depth; T[] data; int[,] par; readonly Func<T, T, T> add; readonly Func<T, T> inv; public TreeDoubling(in Graph<T> g, Func<T, T, T> add, Func<T, T> inv, Func<T> e, int root = 0) { n = g.Size; this.root = root; this.add = add; this.inv = inv; while ((1 << log) < n) log++; if (log <= 0) log = 1; depth = new int[n]; data = new T[n]; for (int i = 0; i < n; i++) data[i] = e(); par = new int[n, log]; for (int i = 0; i < n; i++) for (int j = 0; j < log; j++) par[i, j] = -1; var st = new Stack<int>(); st.Push(root); while (st.Count > 0) { int x = st.Pop(); for (int j = 0; j < log - 1 && par[x, j] > -1; j++) par[x, j + 1] = par[par[x, j], j]; foreach (var y in g.edges[x]) { if (y.to == par[x, 0]) continue; depth[y.to] = depth[x] + 1; data[y.to] = add(data[x], y.data); par[y.to, 0] = x; st.Push(y.to); } } } [MethodImpl(256)] public int LCA(int x, int y) { if (depth[x] > depth[y]) { x ^= y; y ^= x; x ^= y; } int diff = depth[y] - depth[x]; for (int i = 0; diff > 0; i++) { if ((diff & 1) == 1) y = par[y, i]; diff >>= 1; } if (x == y) return x; for (int i = log - 1; i >= 0; i--) { if (par[x, i] != par[y, i]) { x = par[x, i]; y = par[y, i]; } } return par[x, 0]; } [MethodImpl(256)] public T Data(int x) => data[x]; [MethodImpl(256)] public T Data(int x, int y) { int z = LCA(x, y); return add(add(data[x], inv(data[z])), add(data[y], inv(data[z]))); } [MethodImpl(256)] public int Dist(int x, int y) { int z = LCA(x, y); return depth[x] + depth[y] - 2 * depth[z]; } [MethodImpl(256)] public int Ancestor(int x, int k = 1) { if (depth[x] < k) return -1; for (int i = 0; i < log; i++) if (((k >> i) & 1) == 1) x = par[x, i]; return x; } [MethodImpl(256)] public int AncestorPow2(int x, int log) => (depth[x] >> log) == 0 ? -1 : par[x, log]; }
0