結果

問題 No.3 ビットすごろく
ユーザー pawn0818
提出日時 2018-09-30 01:09:29
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
WA  
実行時間 -
コード長 1,514 bytes
コンパイル時間 250 ms
コンパイル使用メモリ 12,544 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2024-10-12 08:56:54
合計ジャッジ時間 2,787 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 11 WA * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 9/28 23:04:27 2018
# Usage
#
"""
from collections import deque
def get():
"""
"""
return int(input())
def get_each_cell_num(length):
"""
>>> get_each_cell_num(5)
[1, 1, 2, 1, 2]
"""
def maker(num):
return sum([int(i) for i in list(bin(num)[2:])])
return [maker(i) for i in range(1, length+1)]
def bfs(res, goal, route):
QUE = deque([])
goal = goal - 1 # Index1
res[0] = 1
QUE.append(0)
while QUE: # ListFalse
# print(res)
pos = QUE.popleft()
# print(pos)
if pos == goal: #
return res
for i in [route[pos], -route[pos]]:
next_pos = pos + i
if next_pos >= len(res):
continue
if next_pos >= 0 and res[next_pos] == -1:
QUE.append(next_pos)
# print("next_pos: ", next_pos)
# print("res: ", res)
# print("QUE: ", QUE)
res[next_pos] = res[pos]
return res
def solve(length):
"""
>>> solve(5)
"""
res = [-1] * length
route = get_each_cell_num(length)
shortest_path = bfs(res, length, route)
print(shortest_path[-1])
if __name__ == '__main__':
solve(get())
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0