結果

問題 No.789 範囲の合計
コンテスト
ユーザー ひばち
提出日時 2020-05-04 22:02:51
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 276 ms / 1,000 ms
コード長 9,450 bytes
コンパイル時間 1,250 ms
コンパイル使用メモリ 114,176 KB
実行使用メモリ 28,928 KB
最終ジャッジ日時 2024-06-25 00:48:30
合計ジャッジ時間 5,366 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 15
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
        var seg = new DynamicSegmentTree<int>((int)1e9 + 1, 0, (a, b) => a + b, (a, b) => a + b);
        var res = 0L;
        while (N-- > 0)
        {
            var t = sc.Next<int>();
            if (t == 0)
            {
                int x, y;
                sc.Make(out x, out y);
                seg.Update(x, y);
            }
            else
            {
                int l, r;
                sc.Make(out l, out r);
                r++;
                res += seg.Query(l, r);
            }
        }
        Console.WriteLine(res);
    }
}
class DynamicSegmentTree<T>
{
    int sz;
    Node root;
    T id;
    Func<T, T, T> merge;
    Func<T, T, T> update;
    public DynamicSegmentTree(int N, T id, Func<T, T, T> merge, Func<T, T, T> update = null)
    {
        sz = 1;
        while (sz < N) sz <<= 1;
        this.id = id;
        this.merge = merge;
        this.update = update ?? ((a, b) => b);
        root = new Node(id, null);
    }
    Node InsertNode(Node leaf, int l, int r,int idx,bool isLeft)
    {
        var rt = new Node(id, null, idx);
        while (true)
        {
            var v = new Node(id, leaf.par);
            if (isLeft)
                leaf.par.lft = v;
            else leaf.par.rgt = v;
            leaf.par = v;
            bool a = leaf.idx < ((l + r) >> 1), b = idx < ((l + r) >> 1);
            if (a)
            {
                isLeft = true;
                v.lft = leaf; r = (l + r) >> 1;
                if (!b) { v.rgt = rt; break; }
            }
            else
            {
                isLeft = false;
                v.rgt = leaf;l = (l + r) >> 1;
                if (b) { v.lft = rt; break; }
            }
        }
        rt.par = leaf.par;
        return rt;
    }
    public void Update(int i,T val)
    {
        var now = root;
        int l = 0, r = sz;
        while (r - l > 1)
        {
            if (now.idx != -1) break;
            if (i < ((l + r) >> 1))
            {
                if (now.lft == null)
                {
                    now.lft = new Node(id, now, i); now = now.lft; break;
                }
                if (now.lft.idx != -1 && now.lft.idx != i)
                { now = InsertNode(now.lft, l, (r + l) >> 1, i, true); break; }
                now = now.lft;
                r = (l + r) >> 1;
            }
            else
            {
                if (now.rgt == null)
                {
                    now.rgt = new Node(id, now, i); now = now.rgt; break;
                }
                if (now.rgt.idx != -1 && now.rgt.idx != i)
                { now = InsertNode(now.rgt, (l + r) >> 1, r, i, false); break; }
                now = now.rgt;
                l = (l + r) >> 1;
            }
        }
        now.val = update(now.val, val);
        while (now.par != null)
        {
            var p = now.par;
            var v = id;
            if (p.lft != null) v = merge(v, p.lft.val);
            if (p.rgt != null) v = merge(v, p.rgt.val);
            p.val = v;
            now = p;
        }
    }
    public T Query(int l, int r) => Query(l, r, root, 0, sz);
    private T Query(int l, int r, Node now, int a, int b)
    {
        if (l <= now.idx && now.idx < r) return now.val;
        if (b <= l || r <= a) return id;
        if (l <= a && b <= r) return now.val;
        var rt = id;
        if (now.lft != null)
            rt = merge(rt, Query(l, r, now.lft, a, (a + b) >> 1));
        if (now.rgt != null)
            rt = merge(rt, Query(l, r, now.rgt, (a + b) >> 1, b));
        return rt;
    }
    class Node
    {
        public T val;
        public Node par, lft, rgt;
        public int idx;
        public Node(T v, Node p, int i = -1) { val = v; par = p; idx = i; }
    }
}

#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) > 0) { 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) < 0) { 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; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    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; }
    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 IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    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