結果
問題 | No.2577 Simple Permutation Guess |
ユーザー | lanegue |
提出日時 | 2023-12-08 19:57:05 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 209 ms / 2,000 ms |
コード長 | 1,376 bytes |
コンパイル時間 | 4,024 ms |
コンパイル使用メモリ | 144,512 KB |
実行使用メモリ | 24,012 KB |
平均クエリ数 | 251.94 |
最終ジャッジ日時 | 2023-12-08 19:57:24 |
合計ジャッジ時間 | 18,687 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
24,000 KB |
testcase_01 | AC | 149 ms
24,000 KB |
testcase_02 | AC | 52 ms
24,000 KB |
testcase_03 | AC | 25 ms
24,000 KB |
testcase_04 | AC | 68 ms
24,000 KB |
testcase_05 | AC | 81 ms
24,000 KB |
testcase_06 | AC | 184 ms
24,000 KB |
testcase_07 | AC | 182 ms
24,000 KB |
testcase_08 | AC | 182 ms
24,000 KB |
testcase_09 | AC | 209 ms
24,000 KB |
testcase_10 | AC | 182 ms
24,000 KB |
testcase_11 | AC | 23 ms
24,000 KB |
testcase_12 | AC | 23 ms
24,000 KB |
testcase_13 | AC | 25 ms
24,000 KB |
testcase_14 | AC | 26 ms
24,000 KB |
testcase_15 | AC | 23 ms
24,000 KB |
testcase_16 | AC | 23 ms
24,000 KB |
testcase_17 | AC | 22 ms
24,000 KB |
testcase_18 | AC | 23 ms
24,000 KB |
testcase_19 | AC | 23 ms
24,000 KB |
testcase_20 | AC | 23 ms
24,000 KB |
testcase_21 | AC | 22 ms
24,000 KB |
testcase_22 | AC | 23 ms
24,012 KB |
testcase_23 | AC | 23 ms
24,012 KB |
testcase_24 | AC | 26 ms
24,012 KB |
testcase_25 | AC | 23 ms
24,012 KB |
testcase_26 | AC | 23 ms
24,012 KB |
testcase_27 | AC | 23 ms
24,012 KB |
testcase_28 | AC | 22 ms
24,012 KB |
testcase_29 | AC | 23 ms
24,012 KB |
testcase_30 | AC | 23 ms
24,012 KB |
testcase_31 | AC | 23 ms
24,000 KB |
testcase_32 | AC | 23 ms
24,000 KB |
testcase_33 | AC | 23 ms
24,000 KB |
testcase_34 | AC | 22 ms
24,000 KB |
testcase_35 | AC | 23 ms
24,000 KB |
testcase_36 | AC | 23 ms
24,000 KB |
testcase_37 | AC | 22 ms
24,000 KB |
testcase_38 | AC | 22 ms
24,000 KB |
testcase_39 | AC | 22 ms
24,000 KB |
testcase_40 | AC | 22 ms
24,000 KB |
testcase_41 | AC | 23 ms
24,000 KB |
testcase_42 | AC | 22 ms
24,000 KB |
testcase_43 | AC | 25 ms
24,000 KB |
testcase_44 | AC | 22 ms
24,000 KB |
testcase_45 | AC | 22 ms
24,000 KB |
testcase_46 | AC | 23 ms
24,000 KB |
testcase_47 | AC | 24 ms
24,000 KB |
testcase_48 | AC | 22 ms
24,000 KB |
testcase_49 | AC | 23 ms
24,000 KB |
testcase_50 | AC | 23 ms
24,000 KB |
testcase_51 | AC | 25 ms
24,000 KB |
testcase_52 | AC | 22 ms
24,000 KB |
testcase_53 | AC | 22 ms
24,000 KB |
testcase_54 | AC | 22 ms
24,000 KB |
testcase_55 | AC | 23 ms
24,000 KB |
testcase_56 | AC | 22 ms
24,000 KB |
testcase_57 | AC | 23 ms
24,000 KB |
testcase_58 | AC | 22 ms
24,000 KB |
testcase_59 | AC | 22 ms
24,000 KB |
testcase_60 | AC | 23 ms
24,000 KB |
testcase_61 | AC | 22 ms
24,000 KB |
testcase_62 | AC | 22 ms
24,000 KB |
testcase_63 | AC | 22 ms
24,000 KB |
testcase_64 | AC | 22 ms
24,012 KB |
testcase_65 | AC | 23 ms
24,012 KB |
testcase_66 | AC | 22 ms
24,012 KB |
testcase_67 | AC | 23 ms
24,012 KB |
testcase_68 | AC | 22 ms
24,012 KB |
testcase_69 | AC | 23 ms
24,012 KB |
testcase_70 | AC | 22 ms
24,012 KB |
testcase_71 | AC | 23 ms
24,012 KB |
testcase_72 | AC | 24 ms
24,012 KB |
testcase_73 | AC | 23 ms
24,000 KB |
testcase_74 | AC | 25 ms
24,000 KB |
testcase_75 | AC | 25 ms
24,000 KB |
testcase_76 | AC | 25 ms
24,000 KB |
testcase_77 | AC | 26 ms
24,000 KB |
testcase_78 | AC | 25 ms
24,000 KB |
testcase_79 | AC | 25 ms
24,000 KB |
testcase_80 | AC | 26 ms
24,000 KB |
testcase_81 | AC | 26 ms
24,000 KB |
testcase_82 | AC | 25 ms
24,000 KB |
testcase_83 | AC | 25 ms
24,000 KB |
testcase_84 | AC | 26 ms
24,000 KB |
testcase_85 | AC | 25 ms
24,000 KB |
testcase_86 | AC | 27 ms
24,000 KB |
testcase_87 | AC | 26 ms
24,012 KB |
testcase_88 | AC | 25 ms
24,012 KB |
testcase_89 | AC | 26 ms
24,012 KB |
testcase_90 | AC | 26 ms
24,012 KB |
testcase_91 | AC | 26 ms
24,012 KB |
testcase_92 | AC | 153 ms
24,012 KB |
testcase_93 | AC | 139 ms
24,012 KB |
testcase_94 | AC | 130 ms
24,012 KB |
testcase_95 | AC | 174 ms
24,012 KB |
testcase_96 | AC | 177 ms
24,012 KB |
testcase_97 | AC | 165 ms
24,012 KB |
testcase_98 | AC | 164 ms
24,012 KB |
testcase_99 | AC | 177 ms
24,012 KB |
testcase_100 | AC | 136 ms
24,012 KB |
testcase_101 | AC | 165 ms
24,012 KB |
evil_1_rnd_1.txt | AC | 331 ms
24,012 KB |
evil_1_rnd_2.txt | AC | 341 ms
24,012 KB |
evil_2_big_1.txt | AC | 413 ms
24,012 KB |
evil_2_big_2.txt | AC | 428 ms
24,012 KB |
evil_2_big_3.txt | AC | 421 ms
24,012 KB |
evil_3_sorted_1.txt | AC | 232 ms
24,012 KB |
evil_4_sorted_rev_1.txt | AC | 200 ms
24,012 KB |
evil_4_sorted_rev_2.txt | AC | 278 ms
24,012 KB |
evil_400_sorted.txt | AC | 390 ms
24,012 KB |
evil_400_sorted_rev.txt | AC | 432 ms
24,012 KB |
ソースコード
import std.stdio; import std.string; import std.conv; import std.algorithm; import std.math; import std.range; void answer(int[] ans){ writefln("! %s", ans.to!(string[]).join(" ")); stdout.flush; } int query(int[] ans){ writefln("? %s", ans.to!(string[]).join(" ")); stdout.flush; return readln.chomp.to!int; } void n6(){ int[][] perm; int[] a = iota(1, 7).array; do{ perm ~= a.dup; }while(a.nextPermutation); int min = 0; int max = cast(int)perm.length - 1; while(min != max){ int c = (min + max + 1) / 2; switch(query(perm[c])){ case 1: min = c; break; case 0: max = c - 1; break; default: return; } } answer(perm[min]); } void main(){ int n = readln.chomp.to!int; if(n == 6){ n6; return; } int[] fixed; int min = 0; int max = n - 1; int[] cand; for(auto i = 1; i <= n; i++){ cand ~= i; } while(fixed.length < n - 1){ int c = (min + max + 1) / 2; auto r = query(fixed ~ cand[c] ~ cand[0 .. c] ~ cand[c + 1 .. $]); switch(r){ case 1: min = c; break; case 0: max = c - 1; break; default: return; } if(min == max){ fixed ~= cand[min]; cand = cand.remove(min); min = 0; max = cast(int)cand.length - 1; } } answer(fixed ~ cand); }