結果

問題 No.507 ゲーム大会(チーム決め)
ユーザー AreTrashAreTrash
提出日時 2019-01-17 12:58:45
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 162 ms / 3,000 ms
コード長 4,143 bytes
コンパイル時間 2,449 ms
コンパイル使用メモリ 110,156 KB
実行使用メモリ 31,508 KB
最終ジャッジ日時 2023-09-13 22:43:33
合計ジャッジ時間 5,808 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
21,756 KB
testcase_01 AC 65 ms
21,724 KB
testcase_02 AC 65 ms
21,864 KB
testcase_03 AC 63 ms
19,664 KB
testcase_04 AC 64 ms
23,780 KB
testcase_05 AC 64 ms
21,780 KB
testcase_06 AC 63 ms
23,860 KB
testcase_07 AC 161 ms
27,448 KB
testcase_08 AC 162 ms
29,472 KB
testcase_09 AC 157 ms
29,408 KB
testcase_10 AC 155 ms
27,512 KB
testcase_11 AC 136 ms
27,488 KB
testcase_12 AC 156 ms
27,444 KB
testcase_13 AC 160 ms
27,476 KB
testcase_14 AC 155 ms
27,440 KB
testcase_15 AC 157 ms
31,508 KB
testcase_16 AC 158 ms
29,568 KB
testcase_17 AC 65 ms
23,728 KB
testcase_18 AC 64 ms
21,648 KB
testcase_19 AC 64 ms
21,852 KB
testcase_20 AC 64 ms
19,680 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 No507
{
    public class Program
    {
        int N;
        int M;
        int K;
        int[] A;

        void Solve(StreamScanner ss, StreamWriter sw)
        {
            //---------------------------------
            N = ss.Next(int.Parse);
            M = ss.Next(int.Parse);
            K = ss.Next(int.Parse);
            A = ss.Next(int.Parse, N - 1).OrderByDescending(x => x).ToArray();

            var ret = BinarySearch.LowerBound(CountStrongPairs, M, 0, A.Length) - 1;
            sw.WriteLine(ret == -1 ? ret : A[ret]);
            //---------------------------------
        }

        int CountStrongPairs(long index)
        {
            var ret = 0;

            for (int left = 0, right = A.Length - 1; left < A.Length && left < right; left++)
            {
                if (left == index) continue;

                for (; left < right; right--)
                {
                    if (right == index || A[right] + A[left] <= A[index] + K) continue;
                    right--;
                    ret++;
                    break;
                }
            }

            return 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();
        }

        static readonly Func<string, string> String = s => s;
    }

    public static partial class BinarySearch
    {
        static long BoundToTheRight(Func<long, bool> pred, long left, long right)
        {
            if (left > right) throw new ArgumentException("left must <= right");

            while (true)
            {
                if (left == right) return right;
                var mid = (left + right - 1) / 2;
                if (pred(mid)) right = mid;
                else left = mid + 1;
            }
        }

        public static long LowerBound<T>(Func<long, T> func, T value, long left, long right) where T : IComparable<T>
        {
            return BoundToTheRight(x => func(x).CompareTo(value) >= 0, left, right);
        }

        public static long UpperBound<T>(Func<long, T> func, T value, long left, long right) where T : IComparable<T>
        {
            return BoundToTheRight(x => func(x).CompareTo(value) > 0, left, right);
        }

        public static int LowerBound<T>(this T[] source, T value) where T : IComparable<T>
        {
            return (int)LowerBound(x => source[x], value, 0, source.Length);
        }

        public static int UpperBound<T>(this T[] source, T value) where T : IComparable<T>
        {
            return (int)UpperBound(x => source[x], value, 0, source.Length);
        }

        public static int Range<T>(this T[] source, T vLeft, T vRight) where T : IComparable<T>
        {
            return source.UpperBound(vRight) - source.LowerBound(vLeft);
        }
    }

    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