結果

問題 No.723 2つの数の和
ユーザー AreTrashAreTrash
提出日時 2019-01-21 03:10:56
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 212 ms / 2,000 ms
コード長 4,398 bytes
コンパイル時間 2,612 ms
コンパイル使用メモリ 111,972 KB
実行使用メモリ 41,736 KB
最終ジャッジ日時 2023-10-12 14:16:09
合計ジャッジ時間 7,508 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 69 ms
21,800 KB
testcase_01 AC 69 ms
21,836 KB
testcase_02 AC 69 ms
21,708 KB
testcase_03 AC 176 ms
34,980 KB
testcase_04 AC 209 ms
39,648 KB
testcase_05 AC 194 ms
36,596 KB
testcase_06 AC 202 ms
39,028 KB
testcase_07 AC 132 ms
32,920 KB
testcase_08 AC 137 ms
33,552 KB
testcase_09 AC 211 ms
37,848 KB
testcase_10 AC 129 ms
30,752 KB
testcase_11 AC 87 ms
24,580 KB
testcase_12 AC 148 ms
34,180 KB
testcase_13 AC 212 ms
38,220 KB
testcase_14 AC 109 ms
30,520 KB
testcase_15 AC 131 ms
30,972 KB
testcase_16 AC 164 ms
35,264 KB
testcase_17 AC 191 ms
40,364 KB
testcase_18 AC 185 ms
35,760 KB
testcase_19 AC 197 ms
41,736 KB
testcase_20 AC 68 ms
21,740 KB
testcase_21 AC 67 ms
21,708 KB
testcase_22 AC 68 ms
23,732 KB
testcase_23 AC 201 ms
40,228 KB
testcase_24 AC 114 ms
31,152 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.Linq;

namespace No723
{
    public class Program
    {
        void Solve(StreamScanner ss, StreamWriter sw)
        {
            //---------------------------------
            var N = ss.Next(int.Parse);
            var X = ss.Next(long.Parse);
            var A = ss.Next(long.Parse, N).OrderBy(x => x).ToArray();

            var bs = A.GetBinarySearch();
            var ret = 0L;
            for (var i = 0; i < N; i++) ret += bs.SetFunc(x => A[x] + A[i]).Count(X);
            sw.WriteLine(ret);
            //---------------------------------
        }

        static void Main()
        {
            var ss = new StreamScanner(new StreamReader(Console.OpenStandardInput()));
            var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false};
            new Program().Solve(ss, sw);
            sw.Flush();
        }
    }

    public static partial class BinarySearch
    {
        public static BinarySearch<T> Default<T>(Func<long, T> func, long left, long right) where T : IComparable<T>
        {
            return new BinarySearch<T>().SetFunc(func).SetInterval(left, right);
        }

        public static BinarySearch<T> Array<T>(T[] array) where T : IComparable<T>
        {
            return new BinarySearch<T>().SetFunc(x => array[x]).SetInterval(0, array.Length);
        }

        public static BinarySearch<T> GetBinarySearch<T>(this T[] source) where T : IComparable<T>
        {
            return Array(source);
        }
    }

    public class BinarySearch<T> where T : IComparable<T>
    {
        Func<long, T> Func { get; set; } = null;
        long Left { get; set; } = 0;
        long Right { get; set; } = 0;
        bool IsOrderAscending { get; set; } = true;

        public BinarySearch<T> SetFunc(Func<long, T> func)
        {
            Func = func;
            return this;
        }

        public BinarySearch<T> SetInterval(long left, long right)
        {
            if (left > right) throw new ArgumentException($"{nameof(left)} <= {nameof(right)}");
            Left = left;
            Right = right;
            return this;
        }

        public BinarySearch<T> SetOrder(bool isOrderAscending)
        {
            IsOrderAscending = isOrderAscending;
            return this;
        }

        long BoundToTheRight(Func<long, bool> pred, long left, long right)
        {
            while (true)
            {
                if (left == right) return right;
                var mid = (left + right - 1) >> 1;
                if (pred(mid)) right = mid;
                else left = mid + 1;
            }
        }

        public long LowerBound(T value)
        {
            var sign = IsOrderAscending ? 1 : -1;
            return BoundToTheRight(x => sign * Func(x).CompareTo(value) >= 0, Left, Right);
        }

        public long UpperBound(T value)
        {
            var sign = IsOrderAscending ? 1 : -1;
            return BoundToTheRight(x => sign * Func(x).CompareTo(value) > 0, Left, Right);
        }

        public long Range(T vLeft, T vRight)
        {
            return Math.Max(0, UpperBound(vRight) - LowerBound(vLeft));
        }

        public long Count(T value)
        {
            return Range(value, value);
        }
    }

    public class StreamScanner
    {
        static readonly char[] Sep = {' '};
        readonly Queue<string> buffer = new Queue<string>();
        readonly TextReader textReader;

        public StreamScanner(TextReader textReader)
        {
            this.textReader = textReader;
        }

        public T Next<T>(Func<string, T> parser)
        {
            if (buffer.Count != 0) return parser(buffer.Dequeue());
            var nextStrings = textReader.ReadLine().Split(Sep, StringSplitOptions.RemoveEmptyEntries);
            foreach (var nextString in nextStrings) buffer.Enqueue(nextString);
            return Next(parser);
        }

        public T[] Next<T>(Func<string, T> parser, int x)
        {
            var ret = new T[x];
            for (var i = 0; i < x; ++i) ret[i] = Next(parser);
            return ret;
        }

        public T[][] Next<T>(Func<string, T> parser, int x, int y)
        {
            var ret = new T[y][];
            for (var i = 0; i < y; ++i) ret[i] = Next(parser, x);
            return ret;
        }
    }
}
0