結果

問題 No.624 Santa Claus and The Last Dungeon
コンテスト
ユーザー 紙ぺーぱー
提出日時 2017-12-14 00:19:28
言語 C#(csc)
(csc 3.9.0)
結果
RE  
実行時間 -
コード長 7,743 bytes
コンパイル時間 1,333 ms
コンパイル使用メモリ 120,344 KB
実行使用メモリ 46,384 KB
平均クエリ数 9.22
最終ジャッジ日時 2024-07-16 15:01:02
合計ジャッジ時間 12,790 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other RE * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
        Random rnd = new Random(); public void Solve() {
            int n = DEBUG ? 100 : 100;
            if (DEBUG) {
                p = Enumerate(n, x => x).OrderBy(x => rnd.Next()).ToArray();
            }
            var q = DEBUG ? 2000 : int.Parse(Console.ReadLine());
            var a = Enumerate(n, x => new char[2]);
            for (int i = 0; i < n; i++) { a[i][0] = '0'; a[i][1] = '0'; }
            count = Enumerate(2, x => new int[10]);
            for (int k = 0; k < 2; k++)
                for (int i = 0; i < 10; i++)
                    count[k][i] = 10;
            var s = new HashSet<int>(Enumerable.Range(0, 100));
            var otaku = new List<int>();
            for (int i = 0; i < n - 1; i++) {
                var prev = cnt;
                if (solve2(i, 0, a, n)) goto END;
                otaku.Add(cnt - prev);
                count[0][a[i][0] - '0']--;
                count[1][a[i][1] - '0']--;
                s.Remove((a[i][0] - '0') * 10 + a[i][1] - '0');
            }
            END:
            Debug.WriteLine(cnt);
            a[n - 1][0] = (char)(s.First() / 10 + '0');
            a[n - 1][1] = (char)(s.First() % 10 + '0');
            //Console.WriteLine(otaku.AsJoinedString());
            if (DEBUG && check(a)[2] != n) throw new Exception();

        }
        int[][] count;
        bool solve2(int i, int j, char[][] a, int n) {
            var c = Enumerate(10, x => (char)(x + '0')).OrderByDescending(x => count[0][x - '0'] == 0 ? 0 : count[0][x - '0'] * 100 + rnd.Next(0, 150)).ToArray();
            var d = Enumerate(10, x => (char)(x + '0')).OrderByDescending(x => count[1][x - '0'] == 0 ? 0 : count[1][x - '0'] * 100 + rnd.Next(0, 150)).ToArray();
            var map = new SortedMap<int[], int>(default(cmp));
            var t = 0;
            for (; t < 9; t++) {
                a[i][0] = c[t]; a[i][1] = d[t];
                if (count[0][c[t] - '0'] == 0 && count[1][d[t] - '0'] == 0) continue;
                var res = query(a);
                if (res[2] == i + 1) return false;
                if (res[2] == n) return true;
                else map[res.Reverse().ToArray()] |= 1 << t;
                if (map.Count == 2 && map.Last().Value != (map.Last().Value & -map.Last().Value)) break;

            }
            if (map.Count == 0 || map.Last().Key[1] == 0) { a[i][0] = c[9]; a[i][1] = d[9]; return false; }
            {
                var max = map.Last();
                var ord = new List<int>();
                for (int k = 0; k < 10; k++)
                    if ((max.Value >> k & 1) == 1) ord.Add(k);
                if (ord.Count == 1) ord.Add(9);
                a[i][0] = c[ord.First()]; a[i][1] = d[ord.Last()];
                var res = query(a);
                if (res[2] > max.Key[0]) { } else { a[i][0] = c[ord.Last()]; a[i][1] = d[ord.First()]; }
                if ((a[i][0] - '0') * 10 + a[i][1] - '0' != p[i]) {

                }
            }
            return false;
        }
        int cnt;
        int[] query(char[][] a) {
            cnt++;
            if (!DEBUG)
                for (int i = 0; i < a.Length; i++) {
                    Console.Write($"{a[i][0]}{a[i][1]}");
                    if (i + 1 != a.Length) Console.Write(" ");
                    else Console.WriteLine();
                }
            Console.Out.Flush();
            int[] res;
            if (DEBUG) return check(a);

            res = Console.ReadLine().Split().Select(int.Parse).ToArray();
            return res;
        }
        int[] check(char[][] a) {
            var ret = new int[3];
            for (int i = 0; i < a.Length; i++) {
                var v = 0;
                if (a[i][0] == '-') continue;
                if (p[i] % 10 == a[i][1] - '0') v++;
                if (p[i] / 10 == a[i][0] - '0') v++;
                ret[v]++;
                if (v != 2) {

                }
            }
            return ret;
        }
        int[] p;
        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


#region SortedMap<K,V>
public class SortedMap<K, V>: SortedDictionary<K, V> {
    public SortedMap(IComparer<K> cmp) : base(cmp) { }
    new public V this[K i] {
        get {
            V v;
            return TryGetValue(i, out v) ? v : base[i] = default(V);
        }
        set { base[i] = value; }
    }
}
#endregion

struct cmp: IComparer<int[]> {
    public int Compare(int[] x, int[] y) {
        for (int i = 0; i < x.Length; i++)
            if (x[i] < y[i]) return -1;
            else if (x[i] > y[i]) return 1;
        return 0;
    }
}
0