#433797 (C#(csc)) No.878 Range High-Element Query

• 問題: No.878 Range High-Element Query
• ユーザー: EmKjp
• 提出日時: 2020-02-23 18:50:34
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 248 ms / 2,000 ms
• コード長: 9,014 bytes
• コンパイル時間: 3,691 ms
• コンパイル使用メモリ: 117,552 KB
• 実行使用メモリ: 29,568 KB
• 最終ジャッジ日時: 2024-10-10 19:22:49
• 合計ジャッジ時間: 5,601 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	34 ms; 19,072 KB
testcase_01	AC	37 ms; 19,072 KB
testcase_02	AC	37 ms; 19,072 KB
testcase_03	AC	37 ms; 18,944 KB
testcase_04	AC	37 ms; 19,072 KB
testcase_05	AC	37 ms; 19,072 KB
testcase_06	AC	37 ms; 18,944 KB
testcase_07	AC	36 ms; 18,816 KB
testcase_08	AC	37 ms; 18,944 KB
testcase_09	AC	36 ms; 18,944 KB
testcase_10	AC	36 ms; 18,944 KB
testcase_11	AC	227 ms; 29,056 KB
testcase_12	AC	184 ms; 27,136 KB
testcase_13	AC	191 ms; 28,032 KB
testcase_14	AC	154 ms; 26,240 KB
testcase_15	AC	182 ms; 27,136 KB
testcase_16	AC	235 ms; 29,440 KB
testcase_17	AC	248 ms; 29,568 KB
testcase_18	AC	246 ms; 29,568 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

struct Query {
    public int Index, L, R;
}
struct Data {
    public int Index, Value;
}

internal partial class Solver {
    public void Run() {
        var n = ni();
        var q = ni();
        var a = ni(n);

        var p = E.Range(0, n).OrderBy(i => a[i]).ToArray();

        var queries = new List<Query>();

        for (int _ = 0; _ < q; _++) {
            var t = ni();
            var l = ni() - 1;
            var r = ni() - 1;
            queries.Add(new Query { Index = _, L = l, R = r });
        }

        queries.Sort((q1, q2) => -q1.L.CompareTo(q2.L));

        var pq = new PriorityQueue<Data>((x, y) => x.Value.CompareTo(y.Value));
        var bit = new BinaryIndexTree(n);
        var ans = new long[q];
        int cur = 0;

        for (int i = n - 1; i >= 0; i--) {
            var x = a[i];
            bit.Add(i, 1);

            while (pq.Count > 0 && pq.Peek().Value < x) {
                bit.Add(pq.Peek().Index, -1);
                pq.Dequeue();
            }

            pq.Enqueue(new Data { Value = x, Index = i });

            while (cur < queries.Count && queries[cur].L == i) {
                var qu = queries[cur];
                ans[qu.Index] = bit.Sum(i, qu.R + 1);
                cur++;
            }
        }

        cout.WriteLine(string.Join("\n", ans));
    }
}

public class BinaryIndexTree {
    private readonly long[] array;
    public BinaryIndexTree(int size) {
        array = new long[size];
    }
    public long Sum(int begin, int end) {
        if (begin != 0) {
            return Sum(0, end) - Sum(0, begin);
        }

        long val = 0;
        end--;
        for (; end >= 0; end = (end & (end + 1)) - 1) {
            val += array[end];
        }

        return val;
    }

    public void Add(int k, long val) {
        for (; k < array.Length; k |= k + 1) {
            array[k] += val;
        }
    }

    /// <summary>return min pos where sum(A[0] .. A[pos]) >= w</summary>
    public int LowerBound(long w) {
        if (w <= 0) {
            return 0;
        }

        int x = 0, k = 1, N = array.Length;
        while ((k << 1) <= N) {
            k <<= 1;
        }

        for (; k > 0; k >>= 1) {
            if (x + k - 1 < N && array[x + k - 1] < w) {
                w -= array[x + k - 1];
                x += k;
            }
        }
        return (x == N) ? -1 : x;
    }
}

public class PriorityQueue<T> {
    private T[] _array = new T[100];
    private int _size = 0;
    private readonly Comparison<T> _compare;

    public PriorityQueue() {
        _compare = Comparer<T>.Default.Compare;
    }

    public PriorityQueue(Comparison<T> comp) {
        _compare = comp;
    }

    public int Count { get { return _size; } }

    private void Swap(int a, int b) {
        var t = _array[a];
        _array[a] = _array[b];
        _array[b] = t;
    }

    private void Expand() {
        var newlist = new T[_array.Length * 2];
        Array.Copy(_array, newlist, _array.Length);
        _array = newlist;
    }

    public bool Any() {
        return _size > 0;
    }

    public void Enqueue(T newValue) {
        if (_size >= _array.Length) {
            Expand();
        }
        _array[_size++] = newValue;
        int pos = _size - 1;
        while (pos > 0) {
            int parent = (pos - 1) / 2;
            if (_compare(_array[parent], _array[pos]) > 0) {
                Swap(parent, pos);
                pos = parent;
            } else {
                break;
            }
        }
    }

    public T Peek() {
        return _array[0];
    }

    public T Dequeue() {
        var top = _array[0];
        _array[0] = _array[--_size];
        int pos = 0;
        while (pos * 2 + 1 < _size) {
            int left = pos * 2 + 1;
            int right = left + 1;
            int next = left;
            if (right < _size && _compare(_array[left], _array[right]) > 0) {
                next = right;
            }

            if (_compare(_array[pos], _array[next]) > 0) {
                Swap(next, pos);
                pos = next;
            } else {
                break;
            }
        }

        return top;
    }
};

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

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

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

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

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

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

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

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new InvalidOperationException();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}