結果
問題 | No.2577 Simple Permutation Guess |
ユーザー | maksim |
提出日時 | 2023-12-09 01:04:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,906 ms / 2,000 ms |
コード長 | 958 bytes |
コンパイル時間 | 172 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 96,356 KB |
平均クエリ数 | 234.22 |
最終ジャッジ日時 | 2023-12-09 01:05:40 |
合計ジャッジ時間 | 64,819 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
69,468 KB |
testcase_01 | AC | 1,194 ms
94,436 KB |
testcase_02 | AC | 192 ms
92,164 KB |
testcase_03 | AC | 61 ms
69,468 KB |
testcase_04 | AC | 308 ms
92,164 KB |
testcase_05 | AC | 389 ms
92,292 KB |
testcase_06 | AC | 1,885 ms
95,972 KB |
testcase_07 | AC | 1,803 ms
96,356 KB |
testcase_08 | AC | 1,821 ms
95,972 KB |
testcase_09 | AC | 1,753 ms
95,844 KB |
testcase_10 | AC | 1,906 ms
96,228 KB |
testcase_11 | AC | 64 ms
69,468 KB |
testcase_12 | AC | 60 ms
69,468 KB |
testcase_13 | AC | 82 ms
80,312 KB |
testcase_14 | AC | 75 ms
78,100 KB |
testcase_15 | AC | 63 ms
69,468 KB |
testcase_16 | AC | 61 ms
69,468 KB |
testcase_17 | AC | 67 ms
69,468 KB |
testcase_18 | AC | 59 ms
69,468 KB |
testcase_19 | AC | 61 ms
69,468 KB |
testcase_20 | AC | 61 ms
69,468 KB |
testcase_21 | AC | 62 ms
69,468 KB |
testcase_22 | AC | 60 ms
69,460 KB |
testcase_23 | AC | 61 ms
69,460 KB |
testcase_24 | AC | 61 ms
69,460 KB |
testcase_25 | AC | 62 ms
69,460 KB |
testcase_26 | AC | 62 ms
69,460 KB |
testcase_27 | AC | 60 ms
69,460 KB |
testcase_28 | AC | 60 ms
69,460 KB |
testcase_29 | AC | 63 ms
69,456 KB |
testcase_30 | AC | 63 ms
69,460 KB |
testcase_31 | AC | 60 ms
69,468 KB |
testcase_32 | AC | 60 ms
69,468 KB |
testcase_33 | AC | 60 ms
69,468 KB |
testcase_34 | AC | 61 ms
69,468 KB |
testcase_35 | AC | 61 ms
69,468 KB |
testcase_36 | AC | 60 ms
69,468 KB |
testcase_37 | AC | 60 ms
69,460 KB |
testcase_38 | AC | 60 ms
69,460 KB |
testcase_39 | AC | 60 ms
69,460 KB |
testcase_40 | AC | 59 ms
69,460 KB |
testcase_41 | AC | 62 ms
69,460 KB |
testcase_42 | AC | 62 ms
69,460 KB |
testcase_43 | AC | 59 ms
69,460 KB |
testcase_44 | AC | 60 ms
69,460 KB |
testcase_45 | AC | 60 ms
69,460 KB |
testcase_46 | AC | 59 ms
69,460 KB |
testcase_47 | AC | 59 ms
69,460 KB |
testcase_48 | AC | 60 ms
69,460 KB |
testcase_49 | AC | 61 ms
69,460 KB |
testcase_50 | AC | 59 ms
69,460 KB |
testcase_51 | AC | 59 ms
69,460 KB |
testcase_52 | AC | 58 ms
69,460 KB |
testcase_53 | AC | 59 ms
69,460 KB |
testcase_54 | AC | 58 ms
69,460 KB |
testcase_55 | AC | 63 ms
69,460 KB |
testcase_56 | AC | 59 ms
69,460 KB |
testcase_57 | AC | 62 ms
69,460 KB |
testcase_58 | AC | 60 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 | 59 ms
69,460 KB |
testcase_63 | AC | 60 ms
69,460 KB |
testcase_64 | AC | 60 ms
69,460 KB |
testcase_65 | AC | 61 ms
69,460 KB |
testcase_66 | AC | 60 ms
69,460 KB |
testcase_67 | AC | 63 ms
69,460 KB |
testcase_68 | AC | 61 ms
69,460 KB |
testcase_69 | AC | 60 ms
69,460 KB |
testcase_70 | AC | 62 ms
69,460 KB |
testcase_71 | AC | 61 ms
69,460 KB |
testcase_72 | AC | 61 ms
69,460 KB |
testcase_73 | AC | 61 ms
69,468 KB |
testcase_74 | AC | 77 ms
78,228 KB |
testcase_75 | AC | 77 ms
78,228 KB |
testcase_76 | AC | 78 ms
80,344 KB |
testcase_77 | AC | 77 ms
78,228 KB |
testcase_78 | AC | 79 ms
78,228 KB |
testcase_79 | AC | 76 ms
78,228 KB |
testcase_80 | AC | 79 ms
80,312 KB |
testcase_81 | AC | 78 ms
80,328 KB |
testcase_82 | AC | 95 ms
80,436 KB |
testcase_83 | AC | 82 ms
80,312 KB |
testcase_84 | AC | 82 ms
80,328 KB |
testcase_85 | AC | 77 ms
80,312 KB |
testcase_86 | AC | 79 ms
80,316 KB |
testcase_87 | AC | 78 ms
80,316 KB |
testcase_88 | AC | 82 ms
80,316 KB |
testcase_89 | AC | 80 ms
80,316 KB |
testcase_90 | AC | 80 ms
80,316 KB |
testcase_91 | AC | 80 ms
80,316 KB |
testcase_92 | AC | 1,232 ms
94,180 KB |
testcase_93 | AC | 1,056 ms
94,584 KB |
testcase_94 | AC | 948 ms
93,540 KB |
testcase_95 | AC | 1,673 ms
95,716 KB |
testcase_96 | AC | 1,749 ms
95,844 KB |
testcase_97 | AC | 1,527 ms
95,588 KB |
testcase_98 | AC | 1,452 ms
95,588 KB |
testcase_99 | AC | 1,538 ms
95,332 KB |
testcase_100 | AC | 1,035 ms
93,796 KB |
testcase_101 | AC | 1,523 ms
95,204 KB |
evil_1_rnd_1.txt | TLE | - |
evil_1_rnd_2.txt | TLE | - |
evil_2_big_1.txt | TLE | - |
evil_2_big_2.txt | TLE | - |
evil_2_big_3.txt | TLE | - |
evil_3_sorted_1.txt | AC | 1,323 ms
95,460 KB |
evil_4_sorted_rev_1.txt | TLE | - |
evil_4_sorted_rev_2.txt | TLE | - |
evil_400_sorted.txt | TLE | - |
evil_400_sorted_rev.txt | TLE | - |
ソースコード
def solve(): n=int(input()) fact=[] def go(pos): arr=[] for i in range(1,n+1): arr.append(i) for i in range(n,0,-1): j=0 cur=0 while(1): cur1=cur+fact[i-1] if(cur1>pos): break else: j+=1 cur=cur1 pos-=cur val=arr[j] arr.pop(j) print(val,end=' ') print() def getans(pos): print("!",end=' ') go(pos) exit(0) def check(pos): print("?",end=' ') go(pos) ans=int(input()) return (ans==1) fact.append(1) ls=1 for i in range(1,500): ls*=i fact.append(ls) low=0 up=fact[n] while(up-low>1): mid=(low+up)//2 if(check(mid)): low=mid else: up=mid getans(low) solve()