結果
問題 | No.2577 Simple Permutation Guess |
ユーザー | 👑 chro_96 |
提出日時 | 2023-12-21 00:02:08 |
言語 | C (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 159 ms / 2,000 ms |
コード長 | 2,480 bytes |
コンパイル時間 | 391 ms |
コンパイル使用メモリ | 32,712 KB |
実行使用メモリ | 24,012 KB |
平均クエリ数 | 251.74 |
最終ジャッジ日時 | 2023-12-21 00:02:24 |
合計ジャッジ時間 | 16,181 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
24,000 KB |
testcase_01 | AC | 131 ms
24,000 KB |
testcase_02 | AC | 48 ms
24,000 KB |
testcase_03 | AC | 28 ms
24,000 KB |
testcase_04 | AC | 64 ms
24,000 KB |
testcase_05 | AC | 88 ms
24,000 KB |
testcase_06 | AC | 156 ms
24,000 KB |
testcase_07 | AC | 159 ms
24,000 KB |
testcase_08 | AC | 155 ms
24,000 KB |
testcase_09 | AC | 159 ms
24,000 KB |
testcase_10 | AC | 156 ms
24,000 KB |
testcase_11 | AC | 26 ms
24,000 KB |
testcase_12 | AC | 39 ms
24,000 KB |
testcase_13 | AC | 27 ms
24,000 KB |
testcase_14 | AC | 26 ms
24,000 KB |
testcase_15 | AC | 27 ms
24,000 KB |
testcase_16 | AC | 25 ms
24,000 KB |
testcase_17 | AC | 26 ms
24,000 KB |
testcase_18 | AC | 25 ms
24,000 KB |
testcase_19 | AC | 24 ms
24,000 KB |
testcase_20 | AC | 24 ms
24,000 KB |
testcase_21 | AC | 25 ms
24,000 KB |
testcase_22 | AC | 25 ms
24,012 KB |
testcase_23 | AC | 26 ms
24,012 KB |
testcase_24 | AC | 27 ms
24,012 KB |
testcase_25 | AC | 25 ms
24,012 KB |
testcase_26 | AC | 24 ms
24,012 KB |
testcase_27 | AC | 25 ms
24,012 KB |
testcase_28 | AC | 25 ms
24,012 KB |
testcase_29 | AC | 24 ms
24,012 KB |
testcase_30 | AC | 26 ms
24,012 KB |
testcase_31 | AC | 25 ms
24,000 KB |
testcase_32 | AC | 24 ms
24,000 KB |
testcase_33 | AC | 26 ms
24,000 KB |
testcase_34 | AC | 27 ms
24,000 KB |
testcase_35 | AC | 25 ms
24,000 KB |
testcase_36 | AC | 26 ms
24,000 KB |
testcase_37 | AC | 25 ms
24,000 KB |
testcase_38 | AC | 25 ms
24,000 KB |
testcase_39 | AC | 25 ms
24,000 KB |
testcase_40 | AC | 25 ms
24,000 KB |
testcase_41 | AC | 24 ms
24,000 KB |
testcase_42 | AC | 27 ms
24,000 KB |
testcase_43 | AC | 26 ms
24,000 KB |
testcase_44 | AC | 28 ms
24,000 KB |
testcase_45 | AC | 25 ms
24,000 KB |
testcase_46 | AC | 25 ms
24,000 KB |
testcase_47 | AC | 25 ms
24,000 KB |
testcase_48 | AC | 25 ms
24,000 KB |
testcase_49 | AC | 25 ms
24,000 KB |
testcase_50 | AC | 24 ms
24,000 KB |
testcase_51 | AC | 26 ms
24,000 KB |
testcase_52 | AC | 24 ms
24,000 KB |
testcase_53 | AC | 25 ms
24,000 KB |
testcase_54 | AC | 24 ms
24,000 KB |
testcase_55 | AC | 35 ms
24,000 KB |
testcase_56 | AC | 25 ms
24,000 KB |
testcase_57 | AC | 26 ms
24,000 KB |
testcase_58 | AC | 25 ms
24,000 KB |
testcase_59 | AC | 25 ms
24,000 KB |
testcase_60 | AC | 25 ms
24,000 KB |
testcase_61 | AC | 24 ms
24,000 KB |
testcase_62 | AC | 25 ms
24,000 KB |
testcase_63 | AC | 25 ms
24,000 KB |
testcase_64 | AC | 25 ms
24,012 KB |
testcase_65 | AC | 26 ms
24,012 KB |
testcase_66 | AC | 28 ms
24,012 KB |
testcase_67 | AC | 26 ms
24,012 KB |
testcase_68 | AC | 27 ms
24,012 KB |
testcase_69 | AC | 26 ms
24,012 KB |
testcase_70 | AC | 25 ms
24,012 KB |
testcase_71 | AC | 24 ms
24,012 KB |
testcase_72 | AC | 25 ms
24,012 KB |
testcase_73 | AC | 25 ms
24,000 KB |
testcase_74 | AC | 26 ms
24,000 KB |
testcase_75 | AC | 28 ms
24,000 KB |
testcase_76 | AC | 52 ms
24,000 KB |
testcase_77 | AC | 28 ms
24,000 KB |
testcase_78 | AC | 27 ms
24,000 KB |
testcase_79 | AC | 29 ms
24,000 KB |
testcase_80 | AC | 28 ms
24,000 KB |
testcase_81 | AC | 27 ms
24,000 KB |
testcase_82 | AC | 27 ms
24,000 KB |
testcase_83 | AC | 28 ms
24,000 KB |
testcase_84 | AC | 26 ms
24,000 KB |
testcase_85 | AC | 26 ms
24,000 KB |
testcase_86 | AC | 27 ms
24,000 KB |
testcase_87 | AC | 27 ms
24,012 KB |
testcase_88 | AC | 28 ms
24,012 KB |
testcase_89 | AC | 28 ms
24,012 KB |
testcase_90 | AC | 28 ms
24,012 KB |
testcase_91 | AC | 29 ms
24,012 KB |
testcase_92 | AC | 131 ms
24,012 KB |
testcase_93 | AC | 121 ms
24,012 KB |
testcase_94 | AC | 114 ms
24,012 KB |
testcase_95 | AC | 148 ms
24,012 KB |
testcase_96 | AC | 153 ms
24,012 KB |
testcase_97 | AC | 140 ms
24,012 KB |
testcase_98 | AC | 140 ms
24,012 KB |
testcase_99 | AC | 148 ms
24,012 KB |
testcase_100 | AC | 119 ms
24,012 KB |
testcase_101 | AC | 143 ms
24,012 KB |
evil_1_rnd_1.txt | AC | 278 ms
24,012 KB |
evil_1_rnd_2.txt | AC | 279 ms
24,012 KB |
evil_2_big_1.txt | AC | 346 ms
24,012 KB |
evil_2_big_2.txt | AC | 344 ms
24,012 KB |
evil_2_big_3.txt | AC | 338 ms
24,012 KB |
evil_3_sorted_1.txt | AC | 199 ms
24,012 KB |
evil_4_sorted_rev_1.txt | AC | 174 ms
24,012 KB |
evil_4_sorted_rev_2.txt | AC | 231 ms
24,012 KB |
evil_400_sorted.txt | AC | 316 ms
24,012 KB |
evil_400_sorted_rev.txt | AC | 360 ms
24,012 KB |
ソースコード
#include <stdio.h> int main () { int n = 0; int ret = 0; int res = 0; int q[400] = {}; int rem[400] = {}; int remcnt = 0; long long ans[2] = { 0LL, 1LL }; long long fact[16] = {}; res = scanf("%d", &n); for (int i = 0; i < n; i++) { rem[i] = i+1; } remcnt = n; if (n > 15) { for (int i = 0; i < n-5; i++) { int idx[2] = { 0, n-i }; while (idx[1]-idx[0] > 1) { int nxt = (idx[0]+idx[1])/2; printf("?"); for (int j = 0; j < i; j++) { printf(" %d", q[j]); } printf(" %d", rem[nxt]); for (int j = 0; j < nxt; j++) { printf(" %d", rem[j]); } for (int j = nxt+1; j < n-i; j++) { printf(" %d", rem[j]); } printf("\n"); fflush(stdout); res = scanf("%d", &ret); if (ret > 0) { idx[0] = nxt; } else { idx[1] = nxt; } } q[i] = rem[idx[0]]; for (int j = idx[0]; j < n-i-1; j++) { rem[j] = rem[j+1]; } remcnt--; } } fact[0] = 1LL; for (int i = 0; i < remcnt; i++) { fact[i+1] = fact[i]*((long long)(i+1)); } ans[1] = fact[remcnt]; while (ans[1]-ans[0] > 1LL) { int tmprem[15] = {}; long long nxt = (ans[0]+ans[1])/2LL; long long tmp = nxt; printf("?"); for (int i = 0; i < n-remcnt; i++) { printf(" %d", q[i]); } for (int i = 0; i < remcnt; i++) { tmprem[i] = rem[i]; } for (int i = 0; i < remcnt; i++) { int idx = (int)(tmp/fact[remcnt-i-1]); printf(" %d", tmprem[idx]); for (int j = idx; j < remcnt-i-1; j++) { tmprem[j] = tmprem[j+1]; } tmp %= fact[remcnt-i-1]; } printf("\n"); fflush(stdout); res = scanf("%d", &ret); if (ret > 0) { ans[0] = nxt; tmp = nxt; for (int i = 0; i < remcnt; i++) { tmprem[i] = rem[i]; } for (int i = 0; i < remcnt; i++) { int idx = (int)(tmp/fact[remcnt-i-1]); q[n-remcnt+i] = tmprem[idx]; for (int j = idx; j < remcnt-i-1; j++) { tmprem[j] = tmprem[j+1]; } tmp %= fact[remcnt-i-1]; } } else { ans[1] = nxt; } } if (ans[0] == 0LL) { for (int i = 0; i < remcnt; i++) { q[n-remcnt+i] = rem[i]; } } printf("!"); for (int j = 0; j < n; j++) { printf(" %d", q[j]); } printf("\n"); fflush(stdout); return 0; }