結果

問題 No.1151 チャレンジゲーム
ユーザー EmKjpEmKjp
提出日時 2020-08-08 01:08:02
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 114 ms / 2,000 ms
コード長 7,011 bytes
コンパイル時間 3,007 ms
コンパイル使用メモリ 114,696 KB
実行使用メモリ 33,540 KB
最終ジャッジ日時 2023-10-25 08:01:45
合計ジャッジ時間 6,321 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
25,180 KB
testcase_01 AC 27 ms
24,416 KB
testcase_02 AC 28 ms
25,180 KB
testcase_03 AC 27 ms
25,104 KB
testcase_04 AC 28 ms
25,180 KB
testcase_05 AC 28 ms
25,180 KB
testcase_06 AC 28 ms
25,180 KB
testcase_07 AC 28 ms
25,180 KB
testcase_08 AC 28 ms
25,180 KB
testcase_09 AC 28 ms
25,180 KB
testcase_10 AC 27 ms
25,180 KB
testcase_11 AC 27 ms
25,180 KB
testcase_12 AC 27 ms
25,180 KB
testcase_13 AC 55 ms
27,808 KB
testcase_14 AC 55 ms
27,372 KB
testcase_15 AC 54 ms
27,812 KB
testcase_16 AC 54 ms
27,464 KB
testcase_17 AC 55 ms
27,608 KB
testcase_18 AC 55 ms
27,656 KB
testcase_19 AC 56 ms
27,464 KB
testcase_20 AC 52 ms
27,492 KB
testcase_21 AC 51 ms
27,740 KB
testcase_22 AC 52 ms
27,288 KB
testcase_23 AC 53 ms
27,644 KB
testcase_24 AC 53 ms
27,860 KB
testcase_25 AC 52 ms
27,412 KB
testcase_26 AC 53 ms
27,564 KB
testcase_27 AC 55 ms
27,660 KB
testcase_28 AC 105 ms
30,880 KB
testcase_29 AC 98 ms
31,484 KB
testcase_30 AC 103 ms
31,588 KB
testcase_31 AC 90 ms
31,232 KB
testcase_32 AC 104 ms
31,132 KB
testcase_33 AC 105 ms
31,712 KB
testcase_34 AC 100 ms
31,536 KB
testcase_35 AC 107 ms
32,012 KB
testcase_36 AC 109 ms
31,944 KB
testcase_37 AC 111 ms
31,840 KB
testcase_38 AC 101 ms
30,684 KB
testcase_39 AC 99 ms
31,644 KB
testcase_40 AC 111 ms
31,032 KB
testcase_41 AC 94 ms
32,516 KB
testcase_42 AC 109 ms
32,028 KB
testcase_43 AC 99 ms
31,592 KB
testcase_44 AC 90 ms
30,312 KB
testcase_45 AC 109 ms
31,836 KB
testcase_46 AC 114 ms
31,712 KB
testcase_47 AC 104 ms
31,052 KB
testcase_48 AC 46 ms
27,764 KB
testcase_49 AC 54 ms
33,540 KB
testcase_50 AC 96 ms
29,896 KB
testcase_51 AC 111 ms
31,156 KB
testcase_52 AC 114 ms
31,304 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.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;

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

        var memo = (double?[,,])Array.CreateInstance(typeof(double?), new[] { 1 << n, 500, 2 }, new int[] { 0, -250, 0 });
        double dfs(int used = 0, int diff = 0, int t = 0) {
            if (used == (1 << n) - 1) {
                if (t == 0) {
                    return diff > 0 ? 1.0 : 0.0;
                } else {
                    return diff >= 0 ? 1.0 : 0.0;
                }
            }
            ref var ret = ref memo[used, diff, t];
            if (!ret.HasValue) {
                double val = 0;
                for (int i = 0; i < n; i++) {
                    if (((1 << i) & used) != 0) continue;
                    double sub = 1.0;
                    for (int j = 0; j < n; j++) {
                        if (((1 << j) & used) != 0) continue;

                        var success1 = InfiniteGeometricProgressionSum(1.0 / a[i], (1.0 - 1.0 / a[j]) * (1.0 - 1.0 / a[i]));
                        var success2 = 1 - success1;
                        var sub2 = 0.0;
                        sub2 += success1 * (1.0 - dfs(used | (1 << i), -(diff + a[i]), 1 - t));
                        sub2 += success2 * dfs(used | (1 << j), +(diff - a[j]), t);
                        sub = Math.Min(sub, sub2);
                    }
                    val = Math.Max(val, sub);
                }
                ret = val;
            }
            return ret.Value;
        }
        cout.WriteLine("{0}", dfs(0, 0));
    }
    /// <summary>
    /// 無限等比級数の和 (0 <= r < 1)
    /// </summary>
    public static double InfiniteGeometricProgressionSum(double x0, double r) {
        return x0 / (1.0 - r);
    }
}

// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    public static void Main() {
#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;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    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
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return 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 Exception();
            }
        }
        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;
        }
    }
}
0