結果
問題 | No.2577 Simple Permutation Guess |
ユーザー | 👑 p-adic |
提出日時 | 2023-11-24 02:01:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 276 ms / 2,000 ms |
コード長 | 748 bytes |
コンパイル時間 | 613 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 92,512 KB |
平均クエリ数 | 283.80 |
最終ジャッジ日時 | 2023-12-04 00:27:39 |
合計ジャッジ時間 | 21,004 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 64 ms
69,468 KB |
testcase_01 | AC | 239 ms
92,256 KB |
testcase_02 | AC | 130 ms
92,016 KB |
testcase_03 | AC | 63 ms
69,468 KB |
testcase_04 | AC | 151 ms
91,988 KB |
testcase_05 | AC | 161 ms
92,500 KB |
testcase_06 | AC | 273 ms
92,256 KB |
testcase_07 | AC | 269 ms
92,256 KB |
testcase_08 | AC | 276 ms
92,256 KB |
testcase_09 | AC | 269 ms
92,256 KB |
testcase_10 | AC | 275 ms
92,256 KB |
testcase_11 | AC | 65 ms
69,468 KB |
testcase_12 | AC | 63 ms
69,468 KB |
testcase_13 | AC | 76 ms
77,960 KB |
testcase_14 | AC | 73 ms
77,960 KB |
testcase_15 | AC | 64 ms
69,468 KB |
testcase_16 | AC | 61 ms
69,468 KB |
testcase_17 | AC | 60 ms
69,468 KB |
testcase_18 | AC | 61 ms
69,468 KB |
testcase_19 | AC | 60 ms
69,468 KB |
testcase_20 | AC | 60 ms
69,468 KB |
testcase_21 | AC | 62 ms
69,468 KB |
testcase_22 | AC | 63 ms
69,460 KB |
testcase_23 | AC | 60 ms
69,460 KB |
testcase_24 | AC | 63 ms
69,460 KB |
testcase_25 | AC | 61 ms
69,460 KB |
testcase_26 | AC | 60 ms
69,460 KB |
testcase_27 | AC | 60 ms
69,460 KB |
testcase_28 | AC | 61 ms
69,460 KB |
testcase_29 | AC | 63 ms
69,460 KB |
testcase_30 | AC | 62 ms
69,460 KB |
testcase_31 | AC | 60 ms
69,468 KB |
testcase_32 | AC | 60 ms
69,468 KB |
testcase_33 | AC | 61 ms
69,468 KB |
testcase_34 | AC | 61 ms
69,468 KB |
testcase_35 | AC | 61 ms
69,468 KB |
testcase_36 | AC | 61 ms
69,468 KB |
testcase_37 | AC | 60 ms
69,460 KB |
testcase_38 | AC | 60 ms
69,460 KB |
testcase_39 | AC | 62 ms
69,460 KB |
testcase_40 | AC | 61 ms
69,460 KB |
testcase_41 | AC | 60 ms
69,460 KB |
testcase_42 | AC | 60 ms
69,460 KB |
testcase_43 | AC | 61 ms
69,460 KB |
testcase_44 | AC | 61 ms
69,460 KB |
testcase_45 | AC | 62 ms
69,460 KB |
testcase_46 | AC | 62 ms
69,460 KB |
testcase_47 | AC | 60 ms
69,460 KB |
testcase_48 | AC | 60 ms
69,460 KB |
testcase_49 | AC | 61 ms
69,460 KB |
testcase_50 | AC | 61 ms
69,460 KB |
testcase_51 | AC | 60 ms
69,460 KB |
testcase_52 | AC | 58 ms
69,460 KB |
testcase_53 | AC | 59 ms
69,456 KB |
testcase_54 | AC | 60 ms
69,460 KB |
testcase_55 | AC | 59 ms
69,460 KB |
testcase_56 | AC | 63 ms
69,460 KB |
testcase_57 | AC | 60 ms
69,460 KB |
testcase_58 | AC | 61 ms
69,460 KB |
testcase_59 | AC | 60 ms
69,460 KB |
testcase_60 | AC | 60 ms
69,460 KB |
testcase_61 | AC | 60 ms
69,460 KB |
testcase_62 | AC | 60 ms
69,460 KB |
testcase_63 | AC | 59 ms
69,460 KB |
testcase_64 | AC | 60 ms
69,460 KB |
testcase_65 | AC | 60 ms
69,460 KB |
testcase_66 | AC | 61 ms
69,460 KB |
testcase_67 | AC | 60 ms
69,460 KB |
testcase_68 | AC | 63 ms
69,460 KB |
testcase_69 | AC | 63 ms
69,460 KB |
testcase_70 | AC | 60 ms
69,460 KB |
testcase_71 | AC | 60 ms
69,460 KB |
testcase_72 | AC | 60 ms
69,460 KB |
testcase_73 | AC | 59 ms
69,468 KB |
testcase_74 | AC | 74 ms
77,960 KB |
testcase_75 | AC | 75 ms
77,960 KB |
testcase_76 | AC | 73 ms
77,960 KB |
testcase_77 | AC | 75 ms
77,960 KB |
testcase_78 | AC | 74 ms
77,960 KB |
testcase_79 | AC | 75 ms
77,960 KB |
testcase_80 | AC | 74 ms
77,960 KB |
testcase_81 | AC | 76 ms
77,960 KB |
testcase_82 | AC | 78 ms
77,960 KB |
testcase_83 | AC | 75 ms
77,960 KB |
testcase_84 | AC | 75 ms
77,960 KB |
testcase_85 | AC | 75 ms
77,960 KB |
testcase_86 | AC | 75 ms
77,960 KB |
testcase_87 | AC | 74 ms
77,960 KB |
testcase_88 | AC | 73 ms
77,960 KB |
testcase_89 | AC | 74 ms
77,960 KB |
testcase_90 | AC | 74 ms
77,960 KB |
testcase_91 | AC | 75 ms
77,928 KB |
testcase_92 | AC | 243 ms
92,256 KB |
testcase_93 | AC | 221 ms
92,384 KB |
testcase_94 | AC | 211 ms
92,512 KB |
testcase_95 | AC | 266 ms
92,256 KB |
testcase_96 | AC | 269 ms
92,256 KB |
testcase_97 | AC | 256 ms
92,128 KB |
testcase_98 | AC | 248 ms
92,256 KB |
testcase_99 | AC | 262 ms
92,256 KB |
testcase_100 | AC | 218 ms
92,256 KB |
testcase_101 | AC | 254 ms
92,256 KB |
evil_1_rnd_1.txt | AC | 427 ms
92,396 KB |
evil_1_rnd_2.txt | AC | 428 ms
92,256 KB |
evil_2_big_1.txt | AC | 517 ms
92,524 KB |
evil_2_big_2.txt | AC | 510 ms
92,512 KB |
evil_2_big_3.txt | AC | 518 ms
92,524 KB |
evil_3_sorted_1.txt | AC | 325 ms
92,256 KB |
evil_4_sorted_rev_1.txt | AC | 290 ms
92,128 KB |
evil_4_sorted_rev_2.txt | AC | 362 ms
92,256 KB |
evil_400_sorted.txt | AC | 505 ms
92,512 KB |
evil_400_sorted_rev.txt | AC | 518 ms
92,384 KB |
ソースコード
#クエリ回数上限確認 def floor_log(n): a,p=0,1 while p*2<=n:a,p=a+1,p*2 return a O,R=print,range I=lambda:int(input()) N=I() q=int(floor_log(N**(N-1))-(N-1)/2+1) n=R(N) Q=[0]*N u=set(i+1for i in n) v=set(u) def S(Q,k): v=set(u) for i in n: Q[i],k=sorted(v)[k//F[N-i-1]],k%F[N-i-1] v.remove(Q[i]) if N<9: F=[1] for i in n:F+=[F[-1]*(i+1)] l,r=0,F[N] while l<r-1: m,q=(l+r)//2,q-1 S(Q,m),O("?",*Q) if I():l=m else:r=m S(Q,l) else: for i in R(N-1): l,r,X=0,N-i,sorted(v) while l<r-1: m,j,q=(l+r)//2,i+1,q-1 t=Q[i]=X[m] for k in R(N-i): if X[k]!=t:Q[j],j=X[k],j+1 O("?",*Q) t=I() if t<1:r=m else:l=m t=Q[i]=X[l] v.remove(t) Q[N-1]=v.pop() while q: q-=1 O("?",*Q) assert(q==0) O("!",*Q)