#588761 (C#(csc)) No.1306 Exactly 2 Digits

提出ソース

結果

問題	No.1306 Exactly 2 Digits
ユーザー	EmKjp
提出日時	2020-12-03 22:26:54
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	257 ms / 2,000 ms
コード長	10,272 bytes
コンパイル時間	2,752 ms
コンパイル使用メモリ	112,384 KB
実行使用メモリ	43,520 KB
平均クエリ数	1236.78
最終ジャッジ日時	2023-09-24 08:46:36
合計ジャッジ時間	27,647 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	90 ms 40,052 KB
testcase_01	AC	88 ms 41,572 KB
testcase_02	AC	86 ms 39,552 KB
testcase_03	AC	87 ms 39,464 KB
testcase_04	AC	85 ms 39,660 KB
testcase_05	AC	85 ms 41,608 KB
testcase_06	AC	85 ms 41,768 KB
testcase_07	AC	85 ms 41,404 KB
testcase_08	AC	88 ms 40,064 KB
testcase_09	AC	86 ms 39,980 KB
testcase_10	AC	87 ms 39,696 KB
testcase_11	AC	87 ms 41,632 KB
testcase_12	AC	85 ms 39,632 KB
testcase_13	AC	85 ms 39,864 KB
testcase_14	AC	87 ms 42,052 KB
testcase_15	AC	86 ms 41,680 KB
testcase_16	AC	84 ms 37,552 KB
testcase_17	AC	88 ms 40,020 KB
testcase_18	AC	90 ms 39,896 KB
testcase_19	AC	87 ms 41,656 KB
testcase_20	AC	84 ms 41,868 KB
testcase_21	AC	85 ms 41,948 KB
testcase_22	AC	84 ms 40,176 KB
testcase_23	AC	85 ms 40,052 KB
testcase_24	AC	87 ms 39,308 KB
testcase_25	AC	88 ms 42,084 KB
testcase_26	AC	87 ms 39,376 KB
testcase_27	AC	87 ms 38,060 KB
testcase_28	AC	84 ms 41,560 KB
testcase_29	AC	85 ms 38,000 KB
testcase_30	AC	88 ms 40,044 KB
testcase_31	AC	88 ms 41,948 KB
testcase_32	AC	87 ms 39,456 KB
testcase_33	AC	89 ms 39,852 KB
testcase_34	AC	88 ms 39,944 KB
testcase_35	AC	88 ms 41,644 KB
testcase_36	AC	87 ms 41,572 KB
testcase_37	AC	87 ms 41,332 KB
testcase_38	AC	88 ms 39,460 KB
testcase_39	AC	89 ms 39,952 KB
testcase_40	AC	89 ms 39,908 KB
testcase_41	AC	89 ms 39,384 KB
testcase_42	AC	89 ms 39,716 KB
testcase_43	AC	88 ms 39,916 KB
testcase_44	AC	87 ms 41,592 KB
testcase_45	AC	89 ms 39,832 KB
testcase_46	AC	90 ms 42,036 KB
testcase_47	AC	88 ms 40,076 KB
testcase_48	AC	91 ms 41,796 KB
testcase_49	AC	89 ms 39,268 KB
testcase_50	AC	92 ms 41,992 KB
testcase_51	AC	94 ms 41,852 KB
testcase_52	AC	97 ms 41,424 KB
testcase_53	AC	101 ms 39,536 KB
testcase_54	AC	99 ms 39,464 KB
testcase_55	AC	102 ms 39,816 KB
testcase_56	AC	106 ms 41,412 KB
testcase_57	AC	105 ms 40,064 KB
testcase_58	AC	109 ms 41,468 KB
testcase_59	AC	107 ms 39,524 KB
testcase_60	AC	115 ms 39,724 KB
testcase_61	AC	121 ms 39,732 KB
testcase_62	AC	121 ms 39,976 KB
testcase_63	AC	124 ms 39,444 KB
testcase_64	AC	120 ms 39,364 KB
testcase_65	AC	121 ms 40,112 KB
testcase_66	AC	129 ms 40,064 KB
testcase_67	AC	137 ms 37,932 KB
testcase_68	AC	131 ms 41,724 KB
testcase_69	AC	136 ms 39,632 KB
testcase_70	AC	140 ms 39,840 KB
testcase_71	AC	147 ms 38,036 KB
testcase_72	AC	147 ms 37,684 KB
testcase_73	AC	145 ms 41,576 KB
testcase_74	AC	160 ms 41,452 KB
testcase_75	AC	156 ms 40,048 KB
testcase_76	AC	182 ms 41,424 KB
testcase_77	AC	182 ms 41,420 KB
testcase_78	AC	194 ms 41,712 KB
testcase_79	AC	207 ms 39,700 KB
testcase_80	AC	213 ms 39,648 KB
testcase_81	AC	190 ms 41,328 KB
testcase_82	AC	222 ms 39,328 KB
testcase_83	AC	227 ms 39,684 KB
testcase_84	AC	233 ms 41,420 KB
testcase_85	AC	248 ms 40,020 KB
testcase_86	AC	218 ms 40,208 KB
testcase_87	AC	226 ms 40,048 KB
testcase_88	AC	257 ms 41,848 KB
testcase_89	AC	227 ms 39,224 KB
testcase_90	AC	217 ms 41,656 KB
testcase_91	AC	223 ms 40,052 KB
testcase_92	AC	216 ms 40,072 KB
testcase_93	AC	232 ms 40,044 KB
testcase_94	AC	206 ms 39,420 KB
testcase_95	AC	219 ms 39,524 KB
testcase_96	AC	206 ms 39,932 KB
testcase_97	AC	216 ms 39,936 KB
testcase_98	AC	204 ms 39,764 KB
testcase_99	AC	220 ms 41,668 KB
testcase_100	AC	216 ms 40,092 KB
testcase_101	AC	234 ms 39,744 KB
testcase_102	AC	203 ms 39,860 KB
testcase_103	AC	215 ms 39,696 KB
testcase_104	AC	215 ms 41,724 KB
testcase_105	AC	229 ms 39,264 KB
testcase_106	AC	211 ms 39,448 KB
testcase_107	AC	232 ms 42,160 KB
testcase_108	AC	220 ms 39,976 KB
testcase_109	AC	245 ms 40,072 KB
testcase_110	AC	210 ms 42,160 KB
testcase_111	AC	225 ms 41,892 KB
testcase_112	AC	200 ms 39,760 KB
testcase_113	AC	249 ms 38,028 KB
testcase_114	AC	253 ms 39,568 KB
testcase_115	AC	224 ms 39,620 KB
testcase_116	AC	254 ms 39,488 KB
testcase_117	AC	230 ms 38,160 KB
testcase_118	AC	241 ms 39,440 KB
testcase_119	AC	224 ms 39,436 KB
testcase_120	AC	207 ms 40,008 KB
testcase_121	AC	233 ms 43,520 KB
testcase_122	AC	226 ms 39,932 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.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;
using System.Threading;

internal partial class Solver {
    int[] a = null;
    int n;

    (int p, int q) Query(int i, int j) {
        if (i == j) return (0, 0);
        if (a != null) {
            var p = a[i] / n - a[j] / n;
            var q = a[i] % n - a[j] % n;
            if (p > q) (p, q) = (q, p);
            return (p, q);
        } else {
            Console.WriteLine("? {0} {1}", i + 1, j + 1);
            Console.Out.Flush();
            var p = ni();
            var q = ni();
            return (p, q);
        }
    }

    private static readonly Random rand = new Random();

    public static void ArrayShuffle<T>(IList<T> array) {
        for (int i = 1; i < array.Count; i++) {
            int r = rand.Next() % (i + 1);
            var t = array[i];
            array[i] = array[r];
            array[r] = t;
        }
    }


    public void Run() {
#if DEBUG
        n = 50;
        var k = n * n - n;
        var aa = E.Range(n, k).ToArray();
        a = aa.ToArray();
        ArrayShuffle(a);
#else
        var n = ni();
        var k = n * n - n;
#endif
        // n, n + 1, ... n*n-1
        var b = new (int p, int q)[k];
        var ans = new (int p, int q)[k];
        for (int i = 0; i < k; i++) {
            b[i] = Query(i, 0);
        }
        int minIndex = -1;
        int maxIndex = -1;
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < k; j++) {
                // n - 2 のとき N の桁、 n - 1 のとき 1 の桁
                if (b[i].p - b[j].p == n - 2 && b[i].q - b[j].q == n - 1) {
                    ans[0] = (-b[j].p + 1, -b[j].q);
                    ans[i] = (n - 1, n - 1);
                    ans[j] = (1, 0);
                    maxIndex = i;
                    minIndex = j;
                }
                if (b[i].p - b[j].q == n - 2 && b[i].q - b[j].p == n - 1) {
                    ans[0] = (-b[j].q + 1, -b[j].p);
                    ans[i] = (n - 1, n - 1);
                    ans[j] = (1, 0);
                    maxIndex = i;
                    minIndex = j;
                }
                if (b[i].q - b[j].p == n - 2 && b[i].p - b[j].q == n - 1) {
                    ans[0] = (-b[j].p + 1, -b[j].q);
                    ans[i] = (n - 1, n - 1);
                    ans[j] = (1, 0);
                    maxIndex = i;
                    minIndex = j;
                }
                if (b[i].q - b[j].q == n - 2 && b[i].p - b[j].p == n - 1) {
                    ans[0] = (-b[j].q + 1, -b[j].p);
                    ans[i] = (n - 1, n - 1);
                    ans[j] = (1, 0);
                    maxIndex = i;
                    minIndex = j;
                }
            }
        }

        bool satisfy((int p, int q) v) => 1 <= v.p && v.p < n && 0 <= v.q && v.q < n;
        (int p, int q) subQuery((int p, int q) v1, (int p, int q) v2) {
            var p = v1.p - v2.p;
            var q = v1.q - v2.q;
            if (p > q) (p, q) = (q, p);
            return (p, q);
        }

        for (int i = 1; i < k; i++) {
            if (ans[i] != (0, 0)) continue;
            var cand1 = (ans[0].p + b[i].p, ans[0].q + b[i].q);
            var cand2 = (ans[0].p + b[i].q, ans[0].q + b[i].p);
            if (cand1 == cand2) {
                ans[i] = cand2;
            } else if (!satisfy(cand1)) {
                ans[i] = cand2;
            } else if (!satisfy(cand2)) {
                ans[i] = cand1;
            } else {
                var target = -1;
                if (subQuery(cand1, ans[minIndex]) != subQuery(cand2, ans[minIndex])) {
                    target = minIndex;
                }
                if (subQuery(cand1, ans[maxIndex]) != subQuery(cand2, ans[maxIndex])) {
                    target = maxIndex;
                }
                for (int j = i + 1; j < k; j++) {
                    if (b[i] == b[j]) {
                        var r = Query(i, target);
                        if (r == subQuery(cand1, ans[target])) {
                            ans[i] = cand1;
                            ans[j] = cand2;
                        } else {
                            ans[i] = cand2;
                            ans[j] = cand1;
                        }
                        break;
                    }
                }
            }
        }

        var ans2 = ans.Select(a => a.p * n + a.q).ToArray();
        cout.WriteLine("! " + ans2.JoinToString(" "));
        cout.Flush();

        //a.TextDump();
        //ans2.TextDump();
        //if (!a.SequenceEqual(ans2)) throw new Exception();
    }
}


// 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 {
    static readonly int? StackSizeInMebiByte = null; //50;
    public static void StartAndJoin(Action action, int maxStackSize) {
        var thread = new Thread(new ThreadStart(action), maxStackSize);
        thread.Start();
        thread.Join();
    }

    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 });
        if (StackSizeInMebiByte.HasValue) {
            StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
        } else {
            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;
        }
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード