#238991 (C#(csc)) No.648 　お　や　す　み

提出ソース

結果

問題	No.648 　お　や　す　み
ユーザー	くれちー
提出日時	2018-02-25 01:59:43
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	70 ms / 2,000 ms
コード長	12,587 bytes
コンパイル時間	4,826 ms
コンパイル使用メモリ	121,200 KB
実行使用メモリ	25,012 KB
最終ジャッジ日時	2023-10-11 22:24:19
合計ジャッジ時間	13,275 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	68 ms 20,920 KB
testcase_01	AC	64 ms 18,780 KB
testcase_02	AC	69 ms 23,036 KB
testcase_03	AC	65 ms 20,876 KB
testcase_04	AC	63 ms 20,688 KB
testcase_05	AC	67 ms 22,980 KB
testcase_06	AC	64 ms 20,768 KB
testcase_07	AC	64 ms 20,792 KB
testcase_08	AC	64 ms 20,760 KB
testcase_09	AC	69 ms 21,024 KB
testcase_10	AC	63 ms 20,704 KB
testcase_11	AC	65 ms 22,832 KB
testcase_12	AC	64 ms 18,680 KB
testcase_13	AC	64 ms 20,880 KB
testcase_14	AC	64 ms 20,680 KB
testcase_15	AC	67 ms 22,808 KB
testcase_16	AC	64 ms 20,708 KB
testcase_17	AC	64 ms 22,940 KB
testcase_18	AC	65 ms 20,740 KB
testcase_19	AC	64 ms 20,844 KB
testcase_20	AC	68 ms 18,952 KB
testcase_21	AC	69 ms 20,944 KB
testcase_22	AC	69 ms 23,044 KB
testcase_23	AC	68 ms 21,060 KB
testcase_24	AC	69 ms 24,936 KB
testcase_25	AC	68 ms 22,888 KB
testcase_26	AC	69 ms 20,980 KB
testcase_27	AC	69 ms 21,056 KB
testcase_28	AC	68 ms 18,936 KB
testcase_29	AC	69 ms 22,968 KB
testcase_30	AC	66 ms 20,792 KB
testcase_31	AC	67 ms 20,748 KB
testcase_32	AC	68 ms 22,796 KB
testcase_33	AC	66 ms 20,796 KB
testcase_34	AC	66 ms 20,860 KB
testcase_35	AC	65 ms 20,776 KB
testcase_36	AC	66 ms 20,764 KB
testcase_37	AC	65 ms 20,780 KB
testcase_38	AC	64 ms 20,932 KB
testcase_39	AC	65 ms 18,732 KB
testcase_40	AC	65 ms 22,888 KB
testcase_41	AC	64 ms 20,792 KB
testcase_42	AC	65 ms 20,868 KB
testcase_43	AC	65 ms 20,800 KB
testcase_44	AC	65 ms 22,756 KB
testcase_45	AC	66 ms 20,920 KB
testcase_46	AC	65 ms 22,812 KB
testcase_47	AC	65 ms 20,744 KB
testcase_48	AC	64 ms 18,812 KB
testcase_49	AC	65 ms 20,700 KB
testcase_50	AC	69 ms 22,976 KB
testcase_51	AC	69 ms 20,952 KB
testcase_52	AC	70 ms 22,972 KB
testcase_53	AC	69 ms 20,960 KB
testcase_54	AC	68 ms 20,940 KB
testcase_55	AC	69 ms 20,948 KB
testcase_56	AC	69 ms 20,972 KB
testcase_57	AC	68 ms 18,972 KB
testcase_58	AC	69 ms 21,056 KB
testcase_59	AC	69 ms 20,940 KB
testcase_60	AC	64 ms 22,736 KB
testcase_61	AC	66 ms 22,800 KB
testcase_62	AC	64 ms 20,788 KB
testcase_63	AC	65 ms 20,828 KB
testcase_64	AC	65 ms 22,764 KB
testcase_65	AC	64 ms 18,776 KB
testcase_66	AC	65 ms 20,824 KB
testcase_67	AC	65 ms 22,808 KB
testcase_68	AC	65 ms 22,836 KB
testcase_69	AC	65 ms 20,832 KB
testcase_70	AC	65 ms 20,804 KB
testcase_71	AC	68 ms 22,792 KB
testcase_72	AC	67 ms 22,848 KB
testcase_73	AC	66 ms 20,788 KB
testcase_74	AC	64 ms 22,828 KB
testcase_75	AC	65 ms 22,844 KB
testcase_76	AC	65 ms 22,796 KB
testcase_77	AC	70 ms 22,932 KB
testcase_78	AC	69 ms 22,960 KB
testcase_79	AC	70 ms 25,012 KB
testcase_80	AC	69 ms 21,068 KB
testcase_81	AC	69 ms 20,964 KB
testcase_82	AC	69 ms 21,060 KB
testcase_83	AC	69 ms 20,920 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

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

ソースコード

raw source code

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Convert;
using static System.Math;
using static Constants;
using static Extensions;
using static MathExtensions;

public static class Program
{
    public static void Solve()
    {
        var n = B;
        var i = BinarySearch.LowerBound(x => x * (x + 1) / 2, 0, new BigInteger(1e18), n);
        if (i * (i + 1) / 2 != n) Answer(NO);
        Console.WriteLine(YES);
        Console.WriteLine(i);
    }

    #region Scanners
    static TextScanner _ts;
    static char C => char.Parse(_ts.Next());
    static string S => _ts.Next();
    static int I => int.Parse(_ts.Next());
    static long L => long.Parse(_ts.Next());
    static BigInteger B => BigInteger.Parse(_ts.Next());
    static double D => double.Parse(_ts.Next());
    static decimal M => decimal.Parse(_ts.Next());
    #endregion

    public static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput());
        sw.NewLine = "\n";
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        Console.SetOut(sw);
        _ts = new TextScanner(Console.In);
        Solve();
        Console.Out.Flush();
    }
}

public static partial class Extensions
{
}

#pragma warning disable
#region Library
public static class BinarySearch
{
    public static int LowerBound<T>(this IReadOnlyList<T> source, T value)
        where T : IComparable<T>
        => source.LowerBound(value, Comparer<T>.Default);

    public static int LowerBound<T>(this IReadOnlyList<T> source, T value, IComparer<T> comparer)
        => LowerBound(i => source[i], 0, source.Count - 1, value, comparer);

    public static int LowerBound<T>(Func<int, T> func, int minValue, int maxValue, T value)
        where T : IComparable<T>
        => LowerBound(func, minValue, maxValue, value, Comparer<T>.Default);

    public static long LowerBound<T>(Func<long, T> func, long minValue, long maxValue, T value)
        where T : IComparable<T>
        => LowerBound(func, minValue, maxValue, value, Comparer<T>.Default);

    public static BigInteger LowerBound<T>(Func<BigInteger, T> func, BigInteger minValue, BigInteger maxValue, T value)
        where T : IComparable<T>
        => LowerBound(func, minValue, maxValue, value, Comparer<T>.Default);

    public static int LowerBound<T>(Func<int, T> func, int minValue, int maxValue, T value, IComparer<T> comparer)
    {
        var i = Search(x => comparer.Compare(func(x), value) >= 0, minValue, maxValue);
        return comparer.Compare(func(i), value) < 0 ? i + 1 : i;
    }

    public static long LowerBound<T>(Func<long, T> func, long minValue, long maxValue, T value, IComparer<T> comparer)
    {
        var i = Search(x => comparer.Compare(func(x), value) >= 0, minValue, maxValue);
        return comparer.Compare(func(i), value) < 0 ? i + 1 : i;
    }

    public static BigInteger LowerBound<T>(Func<BigInteger, T> func, BigInteger minValue, BigInteger maxValue, T value, IComparer<T> comparer)
    {
        var i = Search(x => comparer.Compare(func(x), value) >= 0, minValue, maxValue);
        return comparer.Compare(func(i), value) < 0 ? i + 1 : i;
    }

    public static int UpperBound<T>(this IReadOnlyList<T> source, T value)
        where T : IComparable<T>
        => source.UpperBound(value, Comparer<T>.Default);

    public static int UpperBound<T>(this IReadOnlyList<T> source, T value, IComparer<T> comparer)
        => UpperBound(i => source[i], 0, source.Count - 1, value, comparer);

    public static int UpperBound<T>(Func<int, T> func, int minValue, int maxValue, T value)
        where T : IComparable<T>
        => UpperBound(func, minValue, maxValue, value, Comparer<T>.Default);

    public static long UpperBound<T>(Func<long, T> func, long minValue, long maxValue, T value)
        where T : IComparable<T>
        => UpperBound(func, minValue, maxValue, value, Comparer<T>.Default);

    public static BigInteger UpperBound<T>(Func<BigInteger, T> func, BigInteger minValue, BigInteger maxValue, T value)
        where T : IComparable<T>
        => UpperBound(func, minValue, maxValue, value, Comparer<T>.Default);

    public static int UpperBound<T>(Func<int, T> func, int minValue, int maxValue, T value, IComparer<T> comparer)
    {
        var i = Search(x => comparer.Compare(func(x), value) > 0, minValue, maxValue);
        return comparer.Compare(func(i), value) <= 0 ? i + 1 : i;
    }

    public static long UpperBound<T>(Func<long, T> func, long minValue, long maxValue, T value, IComparer<T> comparer)
    {
        var i = Search(x => comparer.Compare(func(x), value) > 0, minValue, maxValue);
        return comparer.Compare(func(i), value) <= 0 ? i + 1 : i;
    }

    public static BigInteger UpperBound<T>(Func<BigInteger, T> func, BigInteger minValue, BigInteger maxValue, T value, IComparer<T> comparer)
    {
        var i = Search(x => comparer.Compare(func(x), value) > 0, minValue, maxValue);
        return comparer.Compare(func(i), value) <= 0 ? i + 1 : i;
    }

    public static int Search(Predicate<int> predicate, int minValue, int maxValue)
    {
        var ok = maxValue;
        var ng = minValue - 1;

        while (System.Math.Abs(ok - ng) > 1)
        {
            var mid = (ok + ng) / 2;
            if (predicate(mid)) ok = mid;
            else ng = mid;
        }

        return ok;
    }

    public static long Search(Predicate<long> predicate, long minValue, long maxValue)
    {
        var ok = maxValue;
        var ng = minValue - 1;

        while (System.Math.Abs(ok - ng) > 1)
        {
            var mid = (ok + ng) / 2;
            if (predicate(mid)) ok = mid;
            else ng = mid;
        }

        return ok;
    }

    public static BigInteger Search(Predicate<BigInteger> predicate, BigInteger minValue, BigInteger maxValue)
    {
        var ok = maxValue;
        var ng = minValue - 1;

        while (BigInteger.Abs(ok - ng) > 1)
        {
            var mid = (ok + ng) / 2;
            if (predicate(mid)) ok = mid;
            else ng = mid;
        }

        return ok;
    }
}

public class TextScanner
{
    private readonly TextReader _tr;

    public TextScanner(TextReader tr)
    {
        _tr = tr;
    }

    public string Next()
    {
        var sb = new StringBuilder();
        int i;
        do
        {
            i = _tr.Read();
            if (i == -1) throw new EndOfStreamException();
        }
        while (char.IsWhiteSpace((char)i));
        while (i != -1 && !char.IsWhiteSpace((char)i))
        {
            sb.Append((char)i);
            i = _tr.Read();
        }
        return sb.ToString();
    }
}

public static class Constants
{
    public const int AnswerToLifeTheUniverseAndEverything = 42;
    public const string Yes = "Yes";
    public const string No = "No";
    public const string YES = "YES";
    public const string NO = "NO";
    public const string Possible = "Possible";
    public const string Impossible = "Impossible";
    public const string POSSIBLE = "POSSIBLE";
    public const string IMPOSSIBLE = "IMPOSSIBLE";
}

[DebuggerStepThrough]
public static partial class Extensions
{
    public static void Answer(object value)
    {
        Console.WriteLine(value);
        Exit(0);
    }

    public static void Assert(bool condition)
    {
        if (!condition) throw new Exception("Assertion failed");
    }

    public static string AsString(this IEnumerable<char> source) => new string(source.ToArray());

    public static Dictionary<T, int> Bucket<T>(this IEnumerable<T> source) where T : IEquatable<T>
    {
        var dict = new Dictionary<T, int>();
        foreach (var item in source) if (dict.ContainsKey(item)) dict[item]++; else dict[item] = 1;
        return dict;
    }

    public static int[] Bucket<T>(this IEnumerable<T> source, int maxValue, Func<T, int> selector)
    {
        var arr = new int[maxValue + 1];
        foreach (var item in source) arr[selector(item)]++;
        return arr;
    }

    public static IComparer<T> CreateDescendingComparer<T>()
        where T : IComparable<T>
        => Comparer<T>.Create((x, y) => y.CompareTo(x));

    public static IEnumerable<int> CumSum(this IEnumerable<int> source)
    {
        var sum = 0;
        foreach (var item in source) yield return sum += item;
    }

    public static IEnumerable<long> CumSum(this IEnumerable<long> source)
    {
        var sum = 0L;
        foreach (var item in source) yield return sum += item;
    }

    public static void Exit(int exitCode)
    {
        Console.Out.Flush();
        Environment.Exit(exitCode);
    }

    public static void ForEach<T>(this IEnumerable<T> source, Action<T> action)
    {
        foreach (var item in source) action(item);
    }

    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func)
    {
        foreach (var item in source) func(item);
    }

    public static void ForEach<T>(this IEnumerable<T> source, Action<T, int> action)
    {
        var i = 0;
        foreach (var item in source) action(item, i++);
    }

    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, int, _> func)
    {
        var i = 0;
        foreach (var item in source) func(item, i++);
    }

    // [l, r)
    public static bool IsIn<T>(this T value, T l, T r)
        where T : IComparable<T>
    {
        if (l.CompareTo(r) > 0) throw new ArgumentException();
        return l.CompareTo(value) <= 0 && value.CompareTo(r) < 0;
    }

    public static IEnumerable<int> Range(int start, int end, int step = 1)
    {
        for (var i = start; i < end; i += step) yield return i;
    }

    public static IEnumerable<int> Range(int end) => Range(0, end);

    public static void Repeat(int count, Action action)
    {
        for (var i = 0; i < count; i++) action();
    }

    public static void Repeat(int count, Action<int> action)
    {
        for (var i = 0; i < count; i++) action(i);
    }

    public static IEnumerable<T> Repeat<T>(int count, Func<T> func)
    {
        for (var i = 0; i < count; i++) yield return func();
    }

    public static IEnumerable<T> Repeat<T>(int count, Func<int, T> func)
    {
        for (var i = 0; i < count; i++) yield return func(i);
    }

    public static void Swap<T>(ref T x, ref T y)
    {
        var tmp = x; x = y; y = tmp;
    }
}

[DebuggerStepThrough]
public static class MathExtensions
{
    public static int DivCeil(int left, int right)
        => left / right + (left % right == 0 ? 0 : 1);

    public static long DivCeil(long left, long right)
        => left / right + (left % right == 0L ? 0L : 1L);

    public static int Gcd(int left, int right)
    {
        int r;
        while ((r = left % right) != 0) { left = right; right = r; }
        return right;
    }

    public static long Gcd(long left, long right)
    {
        long r;
        while ((r = left % right) != 0L) { left = right; right = r; }
        return right;
    }

    public static BigInteger Gcd(BigInteger left, BigInteger right)
        => BigInteger.GreatestCommonDivisor(left, right);

    public static int HighestOneBit(int x)
    {
        x |= x >> 01;
        x |= x >> 02;
        x |= x >> 04;
        x |= x >> 08;
        x |= x >> 16;
        return x - (x >> 1);
    }

    public static long HighestOneBit(long x)
    {
        x |= x >> 01;
        x |= x >> 02;
        x |= x >> 04;
        x |= x >> 08;
        x |= x >> 16;
        x |= x >> 32;
        return x - (x >> 1);
    }

    public static int Lcm(int left, int right) => left / Gcd(left, right) * right;

    public static long Lcm(long left, long right) => left / Gcd(left, right) * right;

    public static BigInteger Lcm(BigInteger left, BigInteger right)
        => left / Gcd(left, right) * right;

    public static int Pow(int value, int exponent)
    {
        var r = 1;
        while (exponent > 0)
        {
            if ((exponent & 1) == 1) r *= value;
            value *= value;
            exponent >>= 1;
        }
        return r;
    }

    public static long Pow(long value, int exponent)
    {
        var r = 1L;
        while (exponent > 0)
        {
            if ((exponent & 1) == 1) r *= value;
            value *= value;
            exponent >>= 1;
        }
        return r;
    }

    public static long Fact(int value)
    {
        var r = 1L;
        for (var i = 2; i <= value; i++) r *= i;
        return r;
    }
}
#endregion

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード