結果
問題 | No.2577 Simple Permutation Guess |
ユーザー | 👑 kakel-san |
提出日時 | 2023-12-10 00:01:20 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 350 ms / 2,000 ms |
コード長 | 2,636 bytes |
コンパイル時間 | 7,092 ms |
コンパイル使用メモリ | 158,856 KB |
実行使用メモリ | 68,396 KB |
平均クエリ数 | 251.88 |
最終ジャッジ日時 | 2023-12-10 00:01:55 |
合計ジャッジ時間 | 34,326 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 107 ms
49,068 KB |
testcase_01 | AC | 277 ms
63,404 KB |
testcase_02 | AC | 139 ms
51,244 KB |
testcase_03 | AC | 102 ms
48,940 KB |
testcase_04 | AC | 157 ms
53,164 KB |
testcase_05 | AC | 169 ms
54,572 KB |
testcase_06 | AC | 350 ms
68,396 KB |
testcase_07 | AC | 344 ms
68,268 KB |
testcase_08 | AC | 343 ms
68,268 KB |
testcase_09 | AC | 348 ms
68,268 KB |
testcase_10 | AC | 342 ms
68,268 KB |
testcase_11 | AC | 101 ms
48,940 KB |
testcase_12 | AC | 101 ms
49,836 KB |
testcase_13 | AC | 103 ms
49,068 KB |
testcase_14 | AC | 102 ms
49,068 KB |
testcase_15 | AC | 101 ms
48,940 KB |
testcase_16 | AC | 102 ms
49,068 KB |
testcase_17 | AC | 99 ms
49,068 KB |
testcase_18 | AC | 101 ms
49,068 KB |
testcase_19 | AC | 99 ms
49,068 KB |
testcase_20 | AC | 99 ms
49,068 KB |
testcase_21 | AC | 100 ms
49,068 KB |
testcase_22 | AC | 99 ms
49,060 KB |
testcase_23 | AC | 99 ms
49,060 KB |
testcase_24 | AC | 99 ms
49,060 KB |
testcase_25 | AC | 123 ms
49,060 KB |
testcase_26 | AC | 98 ms
49,060 KB |
testcase_27 | AC | 99 ms
49,060 KB |
testcase_28 | AC | 122 ms
49,060 KB |
testcase_29 | AC | 99 ms
49,060 KB |
testcase_30 | AC | 100 ms
49,060 KB |
testcase_31 | AC | 98 ms
49,068 KB |
testcase_32 | AC | 98 ms
49,068 KB |
testcase_33 | AC | 100 ms
49,068 KB |
testcase_34 | AC | 103 ms
49,068 KB |
testcase_35 | AC | 99 ms
49,068 KB |
testcase_36 | AC | 101 ms
49,068 KB |
testcase_37 | AC | 99 ms
49,060 KB |
testcase_38 | AC | 98 ms
49,060 KB |
testcase_39 | AC | 98 ms
49,060 KB |
testcase_40 | AC | 99 ms
49,060 KB |
testcase_41 | AC | 99 ms
49,060 KB |
testcase_42 | AC | 102 ms
49,060 KB |
testcase_43 | AC | 99 ms
49,060 KB |
testcase_44 | AC | 99 ms
49,060 KB |
testcase_45 | AC | 100 ms
49,060 KB |
testcase_46 | AC | 101 ms
49,060 KB |
testcase_47 | AC | 97 ms
49,060 KB |
testcase_48 | AC | 97 ms
49,060 KB |
testcase_49 | AC | 97 ms
49,060 KB |
testcase_50 | AC | 100 ms
49,060 KB |
testcase_51 | AC | 102 ms
49,060 KB |
testcase_52 | AC | 103 ms
49,060 KB |
testcase_53 | AC | 98 ms
49,060 KB |
testcase_54 | AC | 97 ms
49,060 KB |
testcase_55 | AC | 97 ms
49,060 KB |
testcase_56 | AC | 100 ms
49,060 KB |
testcase_57 | AC | 103 ms
49,060 KB |
testcase_58 | AC | 101 ms
49,060 KB |
testcase_59 | AC | 105 ms
49,060 KB |
testcase_60 | AC | 99 ms
49,060 KB |
testcase_61 | AC | 97 ms
49,060 KB |
testcase_62 | AC | 98 ms
49,060 KB |
testcase_63 | AC | 99 ms
49,060 KB |
testcase_64 | AC | 99 ms
49,060 KB |
testcase_65 | AC | 101 ms
49,060 KB |
testcase_66 | AC | 98 ms
49,060 KB |
testcase_67 | AC | 99 ms
49,060 KB |
testcase_68 | AC | 102 ms
49,060 KB |
testcase_69 | AC | 98 ms
49,060 KB |
testcase_70 | AC | 99 ms
49,060 KB |
testcase_71 | AC | 101 ms
49,060 KB |
testcase_72 | AC | 103 ms
49,060 KB |
testcase_73 | AC | 101 ms
49,068 KB |
testcase_74 | AC | 102 ms
49,068 KB |
testcase_75 | AC | 102 ms
49,068 KB |
testcase_76 | AC | 102 ms
49,068 KB |
testcase_77 | AC | 107 ms
49,068 KB |
testcase_78 | AC | 102 ms
49,068 KB |
testcase_79 | AC | 102 ms
49,068 KB |
testcase_80 | AC | 102 ms
49,068 KB |
testcase_81 | AC | 100 ms
49,068 KB |
testcase_82 | AC | 101 ms
49,068 KB |
testcase_83 | AC | 101 ms
49,068 KB |
testcase_84 | AC | 103 ms
49,068 KB |
testcase_85 | AC | 126 ms
49,068 KB |
testcase_86 | AC | 103 ms
49,068 KB |
testcase_87 | AC | 102 ms
49,068 KB |
testcase_88 | AC | 101 ms
49,068 KB |
testcase_89 | AC | 104 ms
49,068 KB |
testcase_90 | AC | 103 ms
49,068 KB |
testcase_91 | AC | 103 ms
49,068 KB |
testcase_92 | AC | 305 ms
63,788 KB |
testcase_93 | AC | 256 ms
61,868 KB |
testcase_94 | AC | 257 ms
60,972 KB |
testcase_95 | AC | 334 ms
67,116 KB |
testcase_96 | AC | 343 ms
67,372 KB |
testcase_97 | AC | 327 ms
65,708 KB |
testcase_98 | AC | 315 ms
65,580 KB |
testcase_99 | AC | 334 ms
66,604 KB |
testcase_100 | AC | 261 ms
61,740 KB |
testcase_101 | AC | 336 ms
65,708 KB |
evil_1_rnd_1.txt | AC | 608 ms
72,748 KB |
evil_1_rnd_2.txt | AC | 603 ms
72,748 KB |
evil_2_big_1.txt | AC | 686 ms
72,748 KB |
evil_2_big_2.txt | AC | 675 ms
72,748 KB |
evil_2_big_3.txt | AC | 691 ms
72,876 KB |
evil_3_sorted_1.txt | AC | 429 ms
72,748 KB |
evil_4_sorted_rev_1.txt | AC | 373 ms
70,828 KB |
evil_4_sorted_rev_2.txt | AC | 502 ms
72,748 KB |
evil_400_sorted.txt | AC | 656 ms
72,748 KB |
evil_400_sorted_rev.txt | AC | 747 ms
72,748 KB |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (99 ms)。 MSBuild のバージョン 17.7.3+8ec440e68 (.NET) main -> /home/judge/data/code/bin/Release/net7.0/main.dll main -> /home/judge/data/code/bin/Release/net7.0/publish/
ソースコード
using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var n = NN; var ans = n < 10 ? ShortGuess(n) : LongGuess(n); WriteLine("! " + string.Join(" ", ans)); } static List<int> ShortGuess(int n) { var all = new List<List<int>>(); Permutate(n, list => all.Add(list.Select(ai => ai + 1).ToList())); var ok = 0; var ng = all.Count; while (ng - ok > 1) { var mid = (ok + ng) / 2; var ans = Query(all[mid]); if (ans < 0) return new List<int>(); if (ans > 0) ok = mid; else ng = mid; } return all[ok]; } static void Permutate(int n, Action<int[]> action) { var seed = new int[n]; for (var i = 0; i < n; ++i) seed[i] = i; var used = new bool[n]; var perm = new int[n]; Permutate(0, seed, perm, used, action); } static void Permutate(int pos, int[] seed, int[] perm, bool[] used, Action<int[]> action) { if (pos == used.Length) action(perm); for (var i = 0; i < used.Length; ++i) { if (used[i]) continue; perm[pos] = seed[i]; used[i] = true; Permutate(pos + 1, seed, perm, used, action); used[i] = false; } } static List<int> LongGuess(int n) { var list = new List<int>(n); for (var i = 0; i < n; ++i) list.Add(i + 1); var ans = new List<int>(n); for (var i = 0; i + 1 < n; ++i) { var ok = 0; var ng = list.Count; while (ng - ok > 1) { var mid = (ok + ng) / 2; var a = Query(ans.Concat(list.Skip(mid).Take(1)).Concat(list.Take(mid)).Concat(list.Skip(mid + 1))); if (a < 0) return new List<int>(); if (a > 0) ok = mid; else ng = mid; } ans.Add(list[ok]); list.RemoveAt(ok); } ans.Add(list[0]); return ans; } static int Query(IEnumerable<int> list) { WriteLine($"? {string.Join(" ", list)}"); return NN; } }