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

提出ソース

結果

問題	No.1306 Exactly 2 Digits
ユーザー	りあん
提出日時	2020-12-03 01:23:51
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	233 ms / 2,000 ms
コード長	10,301 bytes
コンパイル時間	3,786 ms
コンパイル使用メモリ	118,192 KB
実行使用メモリ	43,508 KB
平均クエリ数	1236.78
最終ジャッジ日時	2023-09-24 07:41:26
合計ジャッジ時間	28,783 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	100 ms 39,108 KB
testcase_01	AC	99 ms 39,336 KB
testcase_02	AC	99 ms 38,972 KB
testcase_03	AC	97 ms 39,324 KB
testcase_04	AC	96 ms 39,368 KB
testcase_05	AC	100 ms 41,240 KB
testcase_06	AC	98 ms 38,756 KB
testcase_07	AC	96 ms 38,992 KB
testcase_08	AC	98 ms 39,596 KB
testcase_09	AC	98 ms 41,480 KB
testcase_10	AC	97 ms 38,868 KB
testcase_11	AC	98 ms 38,936 KB
testcase_12	AC	99 ms 40,968 KB
testcase_13	AC	100 ms 39,344 KB
testcase_14	AC	99 ms 39,548 KB
testcase_15	AC	98 ms 39,316 KB
testcase_16	AC	99 ms 39,632 KB
testcase_17	AC	99 ms 40,964 KB
testcase_18	AC	99 ms 39,516 KB
testcase_19	AC	99 ms 39,508 KB
testcase_20	AC	99 ms 41,004 KB
testcase_21	AC	100 ms 41,064 KB
testcase_22	AC	99 ms 40,976 KB
testcase_23	AC	100 ms 39,492 KB
testcase_24	AC	99 ms 39,288 KB
testcase_25	AC	100 ms 39,428 KB
testcase_26	AC	101 ms 39,740 KB
testcase_27	AC	102 ms 40,964 KB
testcase_28	AC	101 ms 39,396 KB
testcase_29	AC	101 ms 41,112 KB
testcase_30	AC	100 ms 41,224 KB
testcase_31	AC	101 ms 38,796 KB
testcase_32	AC	102 ms 41,180 KB
testcase_33	AC	102 ms 38,932 KB
testcase_34	AC	101 ms 39,500 KB
testcase_35	AC	102 ms 41,208 KB
testcase_36	AC	101 ms 41,488 KB
testcase_37	AC	100 ms 39,300 KB
testcase_38	AC	103 ms 39,364 KB
testcase_39	AC	102 ms 37,632 KB
testcase_40	AC	101 ms 39,072 KB
testcase_41	AC	97 ms 41,104 KB
testcase_42	AC	99 ms 39,516 KB
testcase_43	AC	100 ms 39,676 KB
testcase_44	AC	100 ms 41,076 KB
testcase_45	AC	100 ms 39,196 KB
testcase_46	AC	101 ms 39,196 KB
testcase_47	AC	104 ms 39,696 KB
testcase_48	AC	105 ms 41,292 KB
testcase_49	AC	106 ms 40,828 KB
testcase_50	AC	105 ms 38,732 KB
testcase_51	AC	107 ms 39,624 KB
testcase_52	AC	108 ms 38,796 KB
testcase_53	AC	112 ms 39,384 KB
testcase_54	AC	111 ms 39,624 KB
testcase_55	AC	114 ms 39,396 KB
testcase_56	AC	116 ms 41,112 KB
testcase_57	AC	118 ms 41,100 KB
testcase_58	AC	119 ms 39,660 KB
testcase_59	AC	117 ms 38,864 KB
testcase_60	AC	126 ms 41,524 KB
testcase_61	AC	130 ms 39,008 KB
testcase_62	AC	128 ms 36,728 KB
testcase_63	AC	134 ms 39,644 KB
testcase_64	AC	132 ms 40,972 KB
testcase_65	AC	133 ms 40,932 KB
testcase_66	AC	141 ms 41,372 KB
testcase_67	AC	140 ms 41,028 KB
testcase_68	AC	141 ms 41,244 KB
testcase_69	AC	145 ms 38,932 KB
testcase_70	AC	149 ms 41,344 KB
testcase_71	AC	151 ms 40,980 KB
testcase_72	AC	151 ms 41,444 KB
testcase_73	AC	152 ms 39,044 KB
testcase_74	AC	161 ms 39,056 KB
testcase_75	AC	157 ms 38,844 KB
testcase_76	AC	171 ms 41,740 KB
testcase_77	AC	176 ms 38,760 KB
testcase_78	AC	183 ms 39,672 KB
testcase_79	AC	194 ms 43,372 KB
testcase_80	AC	197 ms 41,340 KB
testcase_81	AC	176 ms 40,952 KB
testcase_82	AC	200 ms 41,224 KB
testcase_83	AC	207 ms 41,196 KB
testcase_84	AC	211 ms 41,216 KB
testcase_85	AC	219 ms 41,520 KB
testcase_86	AC	198 ms 39,208 KB
testcase_87	AC	204 ms 40,988 KB
testcase_88	AC	233 ms 42,816 KB
testcase_89	AC	206 ms 41,180 KB
testcase_90	AC	188 ms 41,564 KB
testcase_91	AC	203 ms 39,268 KB
testcase_92	AC	190 ms 42,948 KB
testcase_93	AC	208 ms 41,020 KB
testcase_94	AC	189 ms 39,520 KB
testcase_95	AC	198 ms 41,224 KB
testcase_96	AC	188 ms 41,072 KB
testcase_97	AC	189 ms 43,180 KB
testcase_98	AC	183 ms 39,168 KB
testcase_99	AC	201 ms 41,556 KB
testcase_100	AC	202 ms 41,444 KB
testcase_101	AC	214 ms 41,192 KB
testcase_102	AC	193 ms 40,700 KB
testcase_103	AC	195 ms 40,924 KB
testcase_104	AC	199 ms 43,432 KB
testcase_105	AC	199 ms 41,124 KB
testcase_106	AC	188 ms 43,432 KB
testcase_107	AC	202 ms 41,044 KB
testcase_108	AC	194 ms 39,108 KB
testcase_109	AC	220 ms 43,508 KB
testcase_110	AC	188 ms 41,412 KB
testcase_111	AC	198 ms 43,240 KB
testcase_112	AC	183 ms 38,940 KB
testcase_113	AC	223 ms 43,020 KB
testcase_114	AC	221 ms 41,652 KB
testcase_115	AC	198 ms 41,512 KB
testcase_116	AC	227 ms 39,556 KB
testcase_117	AC	203 ms 41,000 KB
testcase_118	AC	211 ms 41,400 KB
testcase_119	AC	193 ms 41,644 KB
testcase_120	AC	183 ms 40,852 KB
testcase_121	AC	202 ms 41,240 KB
testcase_122	AC	203 ms 41,512 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.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 28); // 256 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }


    int[] ask(int i, int j) {
        Prt('?', i + 1, j + 1);
        sw.Flush();
        return sc.IntArr;
    }
    public void solve() {
        int n = sc.Int;
        int m = n * n - n;
        var diff = new int[m][];
        diff[0] = new int[]{ 0, 0 };
        int smin = 0, smii = 0;
        int smax = 0, smai = 0;
        for (int i = 1; i < m; i++)
        {
            diff[i] = ask(0, i);
            if (smin > diff[i][0] + diff[i][1]) {
                smin = diff[i][0] + diff[i][1];
                smii = i;
            }
            if (smax < diff[i][0] + diff[i][1]) {
                smax = diff[i][0] + diff[i][1];
                smai = i;
            }
        }
        int xy = smax + 1;
        var ans = new int[m];
        int p0, q0;
        {
            int p = diff[smai][0];
            int q = diff[smai][1];
            int r = -diff[smii][0];
            int s = -diff[smii][1];
            if (p + r == n - 2 || p + s == n - 2) {
                ans[0] = (p + 1) * n + q;
                p0 = p + 1;
                q0 = q;
            }
            else {
                Assert(q + r == n - 2 || q + s == n - 2);
                ans[0] = (q + 1) * n + p;
                p0 = q + 1;
                q0 = p;
            }
        }
        var dic = new SortedDictionary<P, List<int>>();
        for (int i = 1; i < m; i++)
        {
            var k = new P(diff[i][0], diff[i][1]);
            if (!dic.ContainsKey(k)) {
                dic.Add(k, new List<int>());
            }
            dic[k].Add(i);
        }
        foreach (var item in dic)
        {
            int p = -item.Key.v1;
            int q = -item.Key.v2;
            if (item.Value.Count == 1) {
                int i = item.Value[0];
                if (1 <= p0 + p && p0 + p <= n - 1 && 0 <= q0 + q && q0 + q <= n - 1) {
                    ans[i] = (p0 + p) * n + q0 + q;
                }
                else {
                    Assert(1 <= p0 + q && p0 + q <= n - 1 && 0 <= q0 + p && q0 + p <= n - 1);
                    ans[i] = (p0 + q) * n + q0 + p;
                }
            }
            else {
                Assert(item.Value.Count == 2);
                int i = item.Value[0];
                int j = item.Value[1];
                var a = new int[2];
                a[0] = (p0 + p) * n + q0 + q;
                a[1] = (p0 + q) * n + q0 + p;
                if (smai != 0) {
                    var r = ask(i, smai);
                    var b = new int[2];
                    if (1 <= 1 + r[0] && 1 + r[0] <= n - 1 && 0 <= r[1] && r[1] <= n - 1) {
                        b[0] = (1 + r[0]) * n + r[1];
                    }
                    else {
                        b[0] = -1;
                    }
                    if (1 <= 1 + r[1] && 1 + r[1] <= n - 1 && 0 <= r[0] && r[0] <= n - 1) {
                        b[1] = (1 + r[1]) * n + r[0];
                    }
                    else {
                        b[1] = -1;
                    }
                    if (a[0] == b[0] || a[0] == b[1]) {
                        ans[i] = a[0];
                        ans[j] = a[1];
                    }
                    else {
                        ans[i] = a[1];
                        ans[j] = a[0];
                    }
                }
                else {
                    var r = ask(i, smii);
                    var b = new int[2];
                    if (1 <= n - 1 + r[0] && n - 1 + r[0] <= n - 1 && 0 <= n - 1 + r[1] && n - 1 + r[1] <= n - 1) {
                        b[0] = (n - 1 + r[0]) * n + n - 1 + r[1];
                    }
                    else {
                        b[0] = -1;
                    }
                    if (1 <= n - 1 + r[1] && n - 1 + r[1] <= n - 1 && 0 <= n - 1 + r[0] && n - 1 + r[0] <= n - 1) {
                        b[1] = (n - 1 + r[1]) * n + n - 1 + r[0];
                    }
                    else {
                        b[1] = -1;
                    }
                    if (a[0] == b[0] || a[0] == b[1]) {
                        ans[i] = a[0];
                        ans[j] = a[1];
                    }
                    else {
                        ans[i] = a[1];
                        ans[j] = a[0];
                    }
                }
            }
        }
        Prt('!', string.Join(" ", ans));

    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード