結果
問題 | No.2768 Password Crack |
ユーザー | Butterflv |
提出日時 | 2024-05-31 22:08:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 208 ms / 2,000 ms |
コード長 | 2,100 bytes |
コンパイル時間 | 282 ms |
コンパイル使用メモリ | 82,528 KB |
実行使用メモリ | 95,700 KB |
平均クエリ数 | 977.33 |
最終ジャッジ日時 | 2024-05-31 22:08:52 |
合計ジャッジ時間 | 7,377 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 105 ms
94,208 KB |
testcase_01 | AC | 96 ms
93,492 KB |
testcase_02 | AC | 200 ms
95,340 KB |
testcase_03 | AC | 195 ms
94,800 KB |
testcase_04 | AC | 201 ms
95,444 KB |
testcase_05 | AC | 103 ms
93,744 KB |
testcase_06 | AC | 200 ms
95,376 KB |
testcase_07 | AC | 208 ms
94,988 KB |
testcase_08 | AC | 118 ms
94,052 KB |
testcase_09 | AC | 199 ms
95,108 KB |
testcase_10 | AC | 198 ms
95,416 KB |
testcase_11 | AC | 202 ms
95,240 KB |
testcase_12 | AC | 198 ms
95,700 KB |
testcase_13 | AC | 204 ms
95,688 KB |
testcase_14 | AC | 200 ms
95,616 KB |
testcase_15 | AC | 203 ms
95,456 KB |
testcase_16 | AC | 197 ms
95,152 KB |
testcase_17 | AC | 199 ms
95,468 KB |
testcase_18 | AC | 193 ms
95,360 KB |
testcase_19 | AC | 147 ms
94,568 KB |
testcase_20 | AC | 141 ms
94,464 KB |
testcase_21 | AC | 199 ms
95,448 KB |
testcase_22 | AC | 172 ms
94,504 KB |
testcase_23 | AC | 114 ms
93,960 KB |
testcase_24 | AC | 138 ms
94,088 KB |
testcase_25 | AC | 201 ms
95,008 KB |
testcase_26 | AC | 136 ms
94,328 KB |
testcase_27 | AC | 168 ms
94,884 KB |
testcase_28 | AC | 115 ms
94,128 KB |
testcase_29 | AC | 123 ms
93,816 KB |
ソースコード
def main(): ALP = "abcdefghijklmnopqrstuvwxyz" alp = [] for i in range(len(ALP)): alp.append(ALP[i]) alp = tuple(alp) import random rand_num = 1000 rand_alp = [] for i in range(rand_num): rand_alp.append(tuple(random.sample(alp, 26))) N=int(input()) base = ["a" for i in range(N)] kaku = [None for i in range(N)] # from collections import defaultdict for i in range(N): order = random.choice(rand_alp) now_nums = dict() flag = False for cha_num in range(26): if flag: break cha = order[cha_num] T = base[:] T[i] = cha print("?", "".join(T)) n=int(input()) if now_nums.get(n)==None: now_nums[n]=[cha] else: now_nums[n].append(cha) if cha_num>=2 and len(now_nums)==2: for key in now_nums: if len(now_nums[key])==1: kaku[i] = now_nums[key][0] flag = True break print("!", "".join(kaku)) if __name__ == "__main__": main() # ALP = "abcdefghijklmnopqrstuvwxyz" # alp = [] # for i in range(len(ALP)): # alp.append(ALP[i]) # alp = tuple(alp) # import random # rand_num = 1000 # rand_alp = [] # for i in range(rand_num): # rand_alp.append(tuple(random.sample(alp, 26))) # N=6 # S="bareas" # def judge(_T): # res = 0 # for i in range(N): # if S[i]==_T[i]: res+=1 # return res # base = ["a" for i in range(N)] # kaku = [None for i in range(N)] # # from collections import defaultdict # for i in range(N): # order = random.choice(rand_alp) # now_nums = dict() # flag = False # for cha_num in range(26): # if flag: break # cha = order[cha_num] # T = base[:] # T[i] = cha # # print("?", "".join(T)) # # n=int(input()) # n = judge("".join(T)) # if now_nums.get(n)==None: # now_nums[n]=[cha] # else: # now_nums[n].append(cha) # if cha_num>=2 and len(now_nums)==2: # for key in now_nums: # if len(now_nums[key])==1: # kaku[i] = now_nums[key][0] # flag = True # break # print("!", "".join())