結果
問題 | No.3 ビットすごろく |
ユーザー | kenji_shioya |
提出日時 | 2016-05-25 21:51:54 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 242 ms / 5,000 ms |
コード長 | 1,713 bytes |
コンパイル時間 | 3,550 ms |
コンパイル使用メモリ | 78,096 KB |
実行使用メモリ | 43,112 KB |
最終ジャッジ日時 | 2024-07-01 07:57:17 |
合計ジャッジ時間 | 10,654 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 33 |
ソースコード
import java.util.*; public class Exercises16{ public static void main (String[] args){ Scanner sc = new Scanner(System.in); int goal = sc.nextInt(); LinkedList<Block> queue = new LinkedList<Block>(); ArrayList<Integer> beforeQueue = new ArrayList<Integer>(); ArrayList<Integer> closed = new ArrayList<Integer>(); boolean flag = false; closed.add(0); queue.offer(new Block(1, 1)); while(queue.size() > 0){ Block currentBlock; currentBlock = queue.poll(); if (currentBlock.value == goal){ System.out.println(currentBlock.count); flag = true; break; } Block forward = currentBlock.getForwardNum(); Block back = currentBlock.getBackNum(); if (beforeQueue.indexOf(forward.value) == -1 && forward.value <= goal){ queue.offer(forward); beforeQueue.add(forward.value); } if (closed.indexOf(back.value) == -1){ queue.offer(back); closed.add(back.value); } } if (queue.size() == 0 && flag == false){ System.out.println(-1); } } } class Block { public int value; private int num; public int count; private int bitcount; Block (int newValue, int currentCount){ value = newValue; num = newValue; count = currentCount; bitcount = 0; } public Block getForwardNum(){ while (num != 0){ if (num % 2 == 1){ bitcount += 1; } num /= 2; } return new Block (value + bitcount, count + 1); } public Block getBackNum(){ while (num != 0){ if (num % 2 == 1){ bitcount += 1; } num /= 2; } return new Block (value - bitcount, count + 1); } }