結果
問題 | No.3 ビットすごろく |
ユーザー | McGregorsh |
提出日時 | 2022-06-13 11:31:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 156 ms / 5,000 ms |
コード長 | 1,706 bytes |
コンパイル時間 | 1,082 ms |
コンパイル使用メモリ | 81,332 KB |
実行使用メモリ | 88,428 KB |
最終ジャッジ日時 | 2023-10-25 09:57:03 |
合計ジャッジ時間 | 6,365 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
82,544 KB |
testcase_01 | AC | 126 ms
82,536 KB |
testcase_02 | AC | 129 ms
82,532 KB |
testcase_03 | AC | 152 ms
88,304 KB |
testcase_04 | AC | 125 ms
82,576 KB |
testcase_05 | AC | 147 ms
88,376 KB |
testcase_06 | AC | 143 ms
88,316 KB |
testcase_07 | AC | 143 ms
88,304 KB |
testcase_08 | AC | 148 ms
88,368 KB |
testcase_09 | AC | 152 ms
88,388 KB |
testcase_10 | AC | 154 ms
88,404 KB |
testcase_11 | AC | 152 ms
88,384 KB |
testcase_12 | AC | 150 ms
88,372 KB |
testcase_13 | AC | 144 ms
88,320 KB |
testcase_14 | AC | 152 ms
88,392 KB |
testcase_15 | AC | 151 ms
88,416 KB |
testcase_16 | AC | 153 ms
88,412 KB |
testcase_17 | AC | 155 ms
88,416 KB |
testcase_18 | AC | 147 ms
88,308 KB |
testcase_19 | AC | 152 ms
88,428 KB |
testcase_20 | AC | 129 ms
82,580 KB |
testcase_21 | AC | 126 ms
82,580 KB |
testcase_22 | AC | 155 ms
88,392 KB |
testcase_23 | AC | 156 ms
88,420 KB |
testcase_24 | AC | 152 ms
88,412 KB |
testcase_25 | AC | 154 ms
88,428 KB |
testcase_26 | AC | 128 ms
82,572 KB |
testcase_27 | AC | 146 ms
88,312 KB |
testcase_28 | AC | 153 ms
88,412 KB |
testcase_29 | AC | 151 ms
88,388 KB |
testcase_30 | AC | 127 ms
82,572 KB |
testcase_31 | AC | 133 ms
82,572 KB |
testcase_32 | AC | 150 ms
88,380 KB |
ソースコード
import sys, re from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d sys.setrecursionlimit(10 ** 6) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n = int(input()) nums = defaultdict(int) count = [-1] * (n+1) count[1] = 1 que = deque() que.append(1) while que: num = que.popleft() score = str(format(num, 'b')).count('1') if num + score <= n: if count[num+score] == -1: que.append(num+score) count[num+score] = count[num] + 1 if num - score > 0: if count[num-score] == -1: que.append(num-score) count[num-score] = count[num] + 1 print(count[n]) if __name__ == '__main__': main()