結果

問題 No.900 aδδitivee
ユーザー ひばちひばち
提出日時 2020-03-11 18:19:55
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 564 ms / 2,000 ms
コード長 12,101 bytes
コンパイル時間 5,515 ms
コンパイル使用メモリ 116,220 KB
実行使用メモリ 55,564 KB
最終ジャッジ日時 2023-08-10 01:38:09
合計ジャッジ時間 20,422 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
23,668 KB
testcase_01 AC 70 ms
21,728 KB
testcase_02 AC 71 ms
23,628 KB
testcase_03 AC 70 ms
23,616 KB
testcase_04 AC 71 ms
21,576 KB
testcase_05 AC 70 ms
21,644 KB
testcase_06 AC 71 ms
21,624 KB
testcase_07 AC 564 ms
47,808 KB
testcase_08 AC 560 ms
45,972 KB
testcase_09 AC 555 ms
47,808 KB
testcase_10 AC 546 ms
43,952 KB
testcase_11 AC 552 ms
45,752 KB
testcase_12 AC 558 ms
48,004 KB
testcase_13 AC 552 ms
48,132 KB
testcase_14 AC 549 ms
47,824 KB
testcase_15 AC 564 ms
45,764 KB
testcase_16 AC 560 ms
47,752 KB
testcase_17 AC 558 ms
47,932 KB
testcase_18 AC 557 ms
47,792 KB
testcase_19 AC 547 ms
45,732 KB
testcase_20 AC 551 ms
47,796 KB
testcase_21 AC 553 ms
47,848 KB
testcase_22 AC 545 ms
55,420 KB
testcase_23 AC 557 ms
55,564 KB
testcase_24 AC 549 ms
55,372 KB
testcase_25 AC 539 ms
55,396 KB
testcase_26 AC 548 ms
55,372 KB
testcase_27 AC 548 ms
55,328 KB
testcase_28 AC 540 ms
55,356 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.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var N = sc.Int;

        g = Create(N, () => new List<int>());var we= new int[N];
        for (var i = 0; i < N-1; i++)
        {
            int a, b;
            sc.Make(out a, out b);
            g[a].Add(b);we[b] = sc.Next<int>();
        }
        idx++;
        l = new int[N];r = new int[N];
        EulerTour(0,-1);
        r[0] = idx;
        var s = new int[N << 1];
        for(int i = 1; i < N; i++)
        {
            s[l[i]]++;
            s[r[i]]--;
        }
        var seg = new data.LSeg(N<<1, 0, 0, s,(a, b) => a + b, (a, b) => a + b, (a, b) => a + b);
        for (int i = 0; i < N; i++)
        {
            seg[l[i]] = we[i];
            seg[r[i]] = -we[i];
        }
        seg.Build();
        var Q = sc.Int;
        while (Q-- > 0)
        {
            int q, a, x;
            q = sc.Next<int>();
            if (q == 1)
            {
                sc.Make(out a, out x);
                seg.Update(l[a]+1, r[a], x);
            }
            else
            {
                sc.Make(out a);
                WriteLine(seg.Query(0, l[a]+1));
            }
        }
    }
    int idx;
    List<int>[] g;
    int[] l, r;
    public void EulerTour(int i,int p)
    {
        foreach (var e in g[i])
        {
            if (e == p) continue;
            l[e] = idx++;
            EulerTour(e, i);
            r[e] = idx++;
        }
    }
}
namespace data{
    using T = System.Int64;
    using E = System.Int64;
    public class LSeg : LazySegmentTree<T, E>
    {
        public int[] s;
        public LSeg(int N, T idT, E idE, int[] sc, Func<T, T, T> mergeT, Func<T, E, T> update = null, Func<E, E, E> mergeE = null) : base(N, idT, idE, mergeT, update, mergeE, (a, b) => a * b)
        {
            s = new int[2 * size - 1];
            for (int i = 0; i < N; i++)
                s[i + size - 1] = sc[i];
            for (int i = size - 2; i >= 0; i--) s[i] = s[Left(i)] + s[Right(i)];
        }
        protected new void eval(int len, int k)
        {
            if (lazy[k].CompareTo(idE) == 0) return;
            if (Right(k) < size * 2)
            {
                lazy[Left(k)] = mergeE(lazy[Left(k)], lazy[k]);
                lazy[Right(k)] = mergeE(lazy[Right(k)], lazy[k]);
            }
            data[k] = update(data[k], sec(lazy[k], s[k]));
            lazy[k] = idE;
        }
        public new void Update(int left, int right, E value, int k = 0, int l = 0, int r = -1)
        {
            if (r == -1) r = size;
            eval(r - l, k);
            if (r <= left || right <= l) return;
            if (left <= l && r <= right)
            {
                lazy[k] = mergeE(lazy[k], value);
                eval(r - l, k);
            }
            else
            {
                Update(left, right, value, Left(k), l, (l + r) >> 1);
                Update(left, right, value, Right(k), (l + r) >> 1, r);
                data[k] = mergeT(data[Left(k)], data[Right(k)]);
            }
        }
        public new T Query(int left, int right, int k = 0, int l = 0, int r = -1)
        {
            if (r == -1) r = size;
            if (r <= left || right <= l) return idT;
            eval(r - l, k);
            if (left <= l && r <= right) return data[k];
            else
                return mergeT(Query(left, right, Left(k), l, (l + r) >> 1), Query(left, right, Right(k), (l + r) >> 1, r));
        }
    }
}
public class LazySegmentTree<T, E>
where E : IComparable<E>
{
    public readonly int size;
    protected readonly T idT;
    protected readonly T[] data;
    protected readonly E idE;
    protected readonly E[] lazy;
    protected readonly Func<T, T, T> mergeT;
    protected readonly Func<T, E, T> update;
    protected readonly Func<E, E, E> mergeE;
    protected readonly Func<E, int, E> sec;

    public T this[int i]
    {
        get { return data[i + size - 1]; }
        set { data[i + size - 1] = value; }
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected int Parent(int index)
        => (index - 1) >> 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected int Left(int index)
        => (index << 1) + 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected int Right(int index)
        => (index + 1) << 1;
    public LazySegmentTree(int N, T idT, E idE, Func<T, T, T> mergeT, Func<T, E, T> update = null, Func<E, E, E> mergeE = null, Func<E, int, E> sec = null)
    {
        this.mergeT = mergeT;
        this.size = 1;
        this.idT = idT;
        this.idE = idE;
        this.update = update ?? ((a, b) => a);
        this.mergeE = mergeE ?? ((a, b) => b);
        this.sec = sec ?? ((a, b) => a);

        while (this.size < N)
            this.size <<= 1;
        data = new T[2 * this.size - 1];
        for (var i = 0; i < 2 * this.size - 1; i++)
            data[i] = idT;
        lazy = Enumerable.Repeat(0, 2 * this.size + 1).Select(_ => idE).ToArray();
    }
    protected void eval(int len, int k)
    {
        if (lazy[k].CompareTo(idE) == 0) return;
        if (Right(k) < size * 2)
        {
            lazy[Left(k)] = mergeE(lazy[Left(k)], lazy[k]);
            lazy[Right(k)] = mergeE(lazy[Right(k)], lazy[k]);
        }
        data[k] = update(data[k], sec(lazy[k], len));
        lazy[k] = idE;
    }
    public void Build()
    {
        for (int i = size - 2; i >= 0; i--)
            data[i] = mergeT(data[Left(i)], data[Right(i)]);
    }
    public void Update(int left, int right, E value, int k = 0, int l = 0, int r = -1)
    {
        if (r == -1) r = size;
        eval(r - l, k);
        if (r <= left || right <= l) return;
        if (left <= l && r <= right)
        {
            lazy[k] = mergeE(lazy[k], value);
            eval(r - l, k);
        }
        else
        {
            Update(left, right, value, Left(k), l, (l + r) >> 1);
            Update(left, right, value, Right(k), (l + r) >> 1, r);
            data[k] = mergeT(data[Left(k)], data[Right(k)]);
        }
    }
    public T Query(int left, int right, int k = 0, int l = 0, int r = -1)
    {
        if (r == -1) r = size;
        if (r <= left || right <= l) return idT;
        eval(r - l, k);
        if (left <= l && r <= right) return data[k];
        else
            return mergeT(Query(left, right, Left(k), l, (l + r) >> 1), Query(left, right, Right(k), (l + r) >> 1, r));
    }

    public int Find(int st, Func<T, bool> check)
    {
        var x = idT;
        return Find(st, check, ref x, 0, 0, size);
    }
    private int Find(int st, Func<T, bool> check, ref T x, int k, int l, int r)
    {
        if (l + 1 == r)
        { x = mergeT(x, data[k]); return check(x) ? k - size + 1 : -1; }
        eval(r - l, k);
        var m = (l + r) >> 1;
        if (m <= st) return Find(st, check, ref x, Right(k), m, r);
        if (st <= l && !check(mergeT(x, data[k])))
        { x = mergeT(x, data[k]); return -1; }
        var xl = Find(st, check, ref x, Left(k), l, m);
        if (xl >= 0) return xl;
        return Find(st, check, ref x, Right(k), m, r);
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    public static T[] Shuffle<T>(this IList<T> A) { T[] rt = A.ToArray(); Random rnd = new Random(); for (int i = rt.Length - 1; i >= 1; i--) swap(ref rt[i], ref rt[rnd.Next(i + 1)]); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public 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 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 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>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    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 void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    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()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion
0