結果

問題 No.404 部分門松列
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-07-22 23:00:22
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,139 ms / 2,000 ms
コード長 7,445 bytes
コンパイル時間 3,965 ms
コンパイル使用メモリ 112,376 KB
実行使用メモリ 56,260 KB
最終ジャッジ日時 2023-09-11 02:24:39
合計ジャッジ時間 22,272 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
21,532 KB
testcase_01 AC 58 ms
21,552 KB
testcase_02 AC 58 ms
23,564 KB
testcase_03 AC 58 ms
23,552 KB
testcase_04 AC 59 ms
21,628 KB
testcase_05 AC 58 ms
21,596 KB
testcase_06 AC 59 ms
21,600 KB
testcase_07 AC 59 ms
23,648 KB
testcase_08 AC 59 ms
21,552 KB
testcase_09 AC 59 ms
23,520 KB
testcase_10 AC 59 ms
21,536 KB
testcase_11 AC 59 ms
23,528 KB
testcase_12 AC 59 ms
23,560 KB
testcase_13 AC 533 ms
45,564 KB
testcase_14 AC 641 ms
49,452 KB
testcase_15 AC 488 ms
40,092 KB
testcase_16 AC 437 ms
42,240 KB
testcase_17 AC 757 ms
51,240 KB
testcase_18 AC 444 ms
38,368 KB
testcase_19 AC 272 ms
31,776 KB
testcase_20 AC 667 ms
44,408 KB
testcase_21 AC 662 ms
40,820 KB
testcase_22 AC 548 ms
42,244 KB
testcase_23 AC 786 ms
38,984 KB
testcase_24 AC 898 ms
41,812 KB
testcase_25 AC 1,139 ms
56,260 KB
testcase_26 AC 1,047 ms
44,836 KB
testcase_27 AC 375 ms
31,584 KB
testcase_28 AC 691 ms
46,228 KB
testcase_29 AC 788 ms
43,516 KB
testcase_30 AC 632 ms
41,560 KB
testcase_31 AC 225 ms
29,764 KB
testcase_32 AC 684 ms
42,468 KB
testcase_33 AC 772 ms
48,540 KB
testcase_34 AC 759 ms
55,060 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.Linq;
using System.Linq.Expressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = sc.Integer(n);
            var q = sc.Integer();
            var ql = new int[q];
            var qh = new int[q];
            for (int i = 0; i < q; i++)
            {
                ql[i] = sc.Integer();
                qh[i] = sc.Integer();
            }
            var xs = new List<int>() { -1 };
            foreach (var x in a) xs.Add(x);
            foreach (var x in ql) xs.Add(x);
            foreach (var x in qh) xs.Add(x);

            xs = xs.Distinct().OrderBy(x => x).ToList();
            var size = xs.Count;
            var left = new FenwickTree(size);
            var right = new FenwickTree(size);
            for (int i = 0; i < n; i++)
            {
                var p = xs.BinarySearch(a[i]);
                right.Add(p, 1);
            }
            var count = new long[xs.Count];
            long intersect = 0;
            for (int i = 0; i < n; i++)
            {
                var p = xs.BinarySearch(a[i]);
                intersect -= left[p, p] * right[p, p];
                right.Add(p, -1);

                {
                    var l = left[p - 1];
                    var r = right[p - 1];
                    count[p] += l * r;
                }
                {
                    var l = left[p + 1, size];
                    var r = right[p + 1, size];
                    count[p] += l * r;

                }
                count[p] -= intersect;
                Debug.WriteLine(count.AsJoinedString());
                left.Add(p, 1);
                intersect += left[p, p] * right[p, p];
            }
            for (int i = 1; i < xs.Count; i++)
                count[i] += count[i - 1];
            for (int i = 0; i < q; i++)
            {
                var l = xs.BinarySearch(ql[i]);
                var h = xs.BinarySearch(qh[i]);
                IO.Printer.Out.WriteLine(count[h] - count[l - 1]);
            }
        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }


    }
}
#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion

#region FenwickTree
[System.Diagnostics.DebuggerDisplay("Data={ToString()}")]
public class FenwickTree
{
    int n;
    long[] bit;
    int max = 1;
    public FenwickTree(int size)
    {
        n = size; bit = new long[n + 1];
        while ((max << 1) <= n) max <<= 1;
    }
    /// <summary>sum[a,b]</summary>
    public long this[int i, int j] { get { return this[j] - this[i - 1]; } }
    /// <summary>sum[0,i]</summary>
    public long this[int i] { get { long s = 0; for (; i > 0; i -= i & -i) s += bit[i]; return s; } }
    public int LowerBound(long w)
    {
        if (w <= 0) return 0;
        int x = 0;
        for (int k = max; k > 0; k >>= 1)
            if (x + k <= n && bit[x + k] < w)
            {
                w -= bit[x + k];
                x += k;
            }
        return x + 1;
    }
    /// <summary>add v to bit[i]</summary>
    public void Add(int i, long v)
    {
        if (i == 0) System.Diagnostics.Debug.Fail("BIT is 1 indexed");
        for (; i <= n; i += i & -i) bit[i] += v;
    }
    public override string ToString() { return string.Join(",", Enumerable.Range(0, n + 1).Select(i => this[i, i])); }
}
#endregion
0