結果

問題 No.624 Santa Claus and The Last Dungeon
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2017-12-15 00:17:34
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 102 ms / 2,000 ms
コード長 7,156 bytes
コンパイル時間 1,290 ms
コンパイル使用メモリ 120,748 KB
実行使用メモリ 45,212 KB
平均クエリ数 419.25
最終ジャッジ日時 2024-07-16 15:02:08
合計ジャッジ時間 6,557 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 88 ms
43,260 KB
testcase_01 AC 86 ms
42,980 KB
testcase_02 AC 85 ms
43,436 KB
testcase_03 AC 88 ms
43,200 KB
testcase_04 AC 89 ms
43,632 KB
testcase_05 AC 86 ms
43,200 KB
testcase_06 AC 88 ms
45,064 KB
testcase_07 AC 88 ms
42,748 KB
testcase_08 AC 88 ms
44,816 KB
testcase_09 AC 87 ms
42,820 KB
testcase_10 AC 88 ms
43,280 KB
testcase_11 AC 86 ms
42,816 KB
testcase_12 AC 88 ms
42,628 KB
testcase_13 AC 89 ms
45,116 KB
testcase_14 AC 86 ms
43,136 KB
testcase_15 AC 90 ms
42,752 KB
testcase_16 AC 85 ms
45,112 KB
testcase_17 AC 90 ms
40,836 KB
testcase_18 AC 90 ms
44,700 KB
testcase_19 AC 87 ms
43,200 KB
testcase_20 AC 102 ms
43,136 KB
testcase_21 AC 96 ms
44,952 KB
testcase_22 AC 89 ms
45,084 KB
testcase_23 AC 93 ms
44,952 KB
testcase_24 AC 92 ms
42,768 KB
testcase_25 AC 91 ms
42,692 KB
testcase_26 AC 87 ms
43,320 KB
testcase_27 AC 87 ms
43,032 KB
testcase_28 AC 88 ms
41,604 KB
testcase_29 AC 84 ms
44,952 KB
testcase_30 AC 88 ms
45,080 KB
testcase_31 AC 89 ms
42,812 KB
testcase_32 AC 95 ms
43,156 KB
testcase_33 AC 91 ms
45,212 KB
testcase_34 AC 89 ms
43,208 KB
testcase_35 AC 89 ms
40,712 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.Generic;
using System.Linq;
using Debug = System.Diagnostics.Debug;
//using System.Numerics;
//using static System.Math;
using Number = System.Int64;
namespace Program {
    public class Solver {

        const bool DEBUG = false;
        int[] p;
        char[][] P;
        Random rnd = new Random();
        int cnt;

        int n = DEBUG ? 100 : 100;

        /// <summary>
        /// 下のアルゴリズムの大雑把な期待値計算
        /// 確率 0.5 で 2 つがどちら側にあるか 1 回でわかる
        /// 確率 0.5 で 2 つがどちら側にあるか 2 回でわかる
        /// 大体 408 ぐらいになるのでうまくいく
        /// </summary>
        void f() {
            var dp = Enumerate(55, x => new double[55]);
            for (int i = 0; i <= 50; i++)
                for (int j = 0; j <= 50; j++) {
                    dp[i + 1][j + 1] += 0.5 * (1 + dp[i][j]);
                    dp[i + 2][j] += 0.25 * (2 + dp[i][j]);
                    dp[i][j + 2] += 0.25 * (2 + dp[i][j]);
                }
            var k = 1;
            var m = 50;
            var sum = 0.0;
            while (m > 1) {
                sum += k * dp[m][m];
                k *= 2;
                m = (m + 1) / 2;
            }
            Debug.WriteLine(sum);

        }
        public void Solve() {
            f();
            if (DEBUG) {
                p = Enumerate(n, x => x).OrderBy(x => rnd.Next()).ToArray();
                P = Enumerate(n, x => new char[2]);
                for (int i = 0; i < n; i++) {
                    P[i][0] = (char)(p[i] / 10 + '0');
                    P[i][1] = (char)(p[i] % 10 + '0');
                }

            }
            var q = DEBUG ? 550 : int.Parse(Console.ReadLine());
            solve(0, n, new Stack<int>(Enumerate(n, x => x)));
            query(ans);
            Debug.WriteLine(cnt);
            Debug.WriteLine(ans.AsJoinedString());
        }
        int[] ans = new int[100];
        void solve(int l, int r, Stack<int> a) {
            if (r - l == 1) { ans[l] = a.Pop(); return; }
            a = new Stack<int>(a.OrderBy(x => rnd.Next()));
            var L = new Stack<int>();
            var R = new Stack<int>();
            var m = (l + r) / 2;
            while (l + L.Count != m && m + R.Count != r) {
                var p = a.Pop();
                var q = a.Pop();
                var b = Enumerate(n, x => -1);
                for (int i = l; i < r; i++)
                    b[i] = i < m ? p : q;
                var res = query(b);
                if (res[2] == 0 || res[2] == 2) {
                    if (res[2] == 0) Swap(ref p, ref q);
                    L.Push(p);
                    R.Push(q);
                }
                else {
                    b = Enumerate(n, x => -1);
                    for (int i = l; i < m; i++)
                        b[i] = p;
                    res = query(b);
                    if (res[2] == 1) { L.Push(p); L.Push(q); }
                    else { R.Push(p); R.Push(q); }
                }
            }
            while (l + L.Count != m) L.Push(a.Pop());
            while (m + R.Count != r) R.Push(a.Pop());
            solve(l, m, L);
            solve(m, r, R);

        }

        int[] query(int[] a) {
            cnt++;
            if (!DEBUG)
                for (int i = 0; i < a.Length; i++) {
                    if (a[i] != -1)
                        Console.Write($"{a[i] / 10}{a[i] % 10}");
                    else Console.Write($"??");
                    if (i + 1 != a.Length) Console.Write(" ");
                    else Console.WriteLine();
                }
            Console.Out.Flush();
            int[] res;
            if (DEBUG) return check(a.Select(x => x == -1 ? "??" : $"{x / 10}{x % 10}").ToArray());

            res = Console.ReadLine().Split().Select(int.Parse).ToArray();
            return res;
        }
        int[] check(string[] a) {
            var ret = new int[3];
            for (int i = 0; i < a.Length; i++) {
                ret[Enumerable.Range(0, 2).Count(x => P[i][x] == a[i][x])]++;
            }
            return ret;
        }
        const long INF = 1L << 60;
        int[] dx = { 1, 0, -1, 0 };
        int[] dy = { 0, 1, 0, -1 };
        //*
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        //*/

        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(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie.Select(x => x.ToString()).ToArray());
        //return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.Globalization;
    using System.IO;
    using System.Text;
    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }
    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 != 0; b = (char)read())
                if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}
#endregion
0