結果

問題 No.789 範囲の合計
ユーザー EmKjpEmKjp
提出日時 2019-05-09 22:52:54
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 378 ms / 1,000 ms
コード長 7,106 bytes
コンパイル時間 1,032 ms
コンパイル使用メモリ 120,960 KB
実行使用メモリ 46,732 KB
最終ジャッジ日時 2024-07-02 00:52:38
合計ジャッジ時間 5,502 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
25,264 KB
testcase_01 AC 35 ms
23,220 KB
testcase_02 AC 358 ms
46,732 KB
testcase_03 AC 201 ms
32,280 KB
testcase_04 AC 352 ms
45,960 KB
testcase_05 AC 337 ms
46,256 KB
testcase_06 AC 352 ms
44,696 KB
testcase_07 AC 196 ms
32,176 KB
testcase_08 AC 280 ms
38,820 KB
testcase_09 AC 261 ms
34,724 KB
testcase_10 AC 378 ms
45,232 KB
testcase_11 AC 347 ms
41,736 KB
testcase_12 AC 344 ms
44,548 KB
testcase_13 AC 35 ms
25,180 KB
testcase_14 AC 35 ms
27,480 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.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using System.Runtime.CompilerServices;

partial class Solver
{
    public void Run()
    {
        var n = ni();
        var T = new int[n];
        var L = new int[n];
        var R = new int[n];
        for (int i = 0; i < n; i++)
        {
            T[i] = ni();
            L[i] = ni();
            R[i] = ni();
        }
        var d = IndexDictionaryFactory.Create(L.Concat(R));
        var tree = new AnonymousSegmentTree<int>((v1, v2) => v1 + v2);
        tree.Build(d.Count, i => 0);
        long ans = 0;

        for (int i = 0; i < n; i++)
        {
            if (T[i] == 0)
            {
                var x = d.GetIndex(L[i]);
                var y = R[i];
                var current = tree.Query(x, x + 1);
                tree.Update(x, current + y);
            }
            else
            {
                var left = d.GetIndex(L[i]);
                var right = d.GetIndex(R[i]);
                ans += tree.Query(left, right + 1);
            }
        }
        cout.WriteLine(ans);
    }
}


public class IndexDictionary<T>
{
    private readonly Dictionary<T, int> _toIndex;
    private readonly T[] _array;

    public int Count
    {
        get { return _array.Length; }
    }

    public T this[int index]
    {
        get { return _array[index]; }
    }

    public int GetIndex(T value) { return _toIndex[value]; }

    public IndexDictionary(IEnumerable<T> source) : this(source, Comparer<T>.Default) { }

    public IndexDictionary(IEnumerable<T> source, IComparer<T> comparer)
    {
        _array = source.Distinct().ToArray();
        Array.Sort(_array, comparer);
        _toIndex = new Dictionary<T, int>(_array.Length);
        int index = -1;
        foreach (var x in _array)
        {
            index++;
            _toIndex[x] = index;
        }
    }
}

public class IndexDictionaryFactory
{
    public static IndexDictionary<T> Create<T>(IEnumerable<T> source)
    {
        return new IndexDictionary<T>(source);
    }
}


public abstract class SegmentTree<TNodeValue> where TNodeValue : struct
{
    protected int N { get; private set; }
    protected TNodeValue?[] node;

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected static int Left(int p) { return p * 2 + 1; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected static int Right(int p) { return p * 2 + 2; }

    public SegmentTree() { }

    public void Build(IList<TNodeValue> array)
    {
        Build(array.Count, i => array[i]);
    }

    virtual public void Build(int _n, Func<int, TNodeValue> create)
    {
        N = 1;
        while (N < _n) N *= 2;
        node = new TNodeValue?[2 * N];

        for (int i = 0; i < _n; i++) node[i + N - 1] = create(i);
        for (int i = N - 2; i >= 0; i--) node[i] = Merge(node[Left(i)], node[Right(i)]);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected TNodeValue? Merge(TNodeValue? left, TNodeValue? right)
    {
        if (left != null && right != null) return Merge(left.Value, right.Value);
        if (left == null) return right;
        return left;
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected abstract TNodeValue Merge(TNodeValue left, TNodeValue right);

    public void Update(int index, TNodeValue val)
    {
        int p = index + N - 1;
        node[p] = val;
        while (p > 0)
        {
            p = (p - 1) / 2;
            node[p] = Merge(node[Left(p)], node[Right(p)]);
        }
    }

    protected virtual TNodeValue? Query(int begin, int end, int k, int l, int r)
    {
        if (r <= begin || end <= l) return null;
        if (begin <= l && r <= end) return node[k];
        int mid = (l + r) / 2;
        return Merge(
            Query(begin, end, Left(k), l, mid),
            Query(begin, end, Right(k), mid, r)
        );
    }

    public TNodeValue Query(int begin, int end)
    {
        return Query(begin, end, 0, 0, N).Value;
    }
};

public class AnonymousSegmentTree<TNodeValue> : SegmentTree<TNodeValue> where TNodeValue : struct
{
    readonly Func<TNodeValue, TNodeValue, TNodeValue> _mergeMethod;

    public AnonymousSegmentTree(Func<TNodeValue, TNodeValue, TNodeValue> merge)
    {
        _mergeMethod = merge;
    }

    protected override TNodeValue Merge(TNodeValue left, TNodeValue right)
    {
        return _mergeMethod(left, right);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}

public class Scanner
{
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0