結果
問題 |
No.3 ビットすごろく
|
ユーザー |
![]() |
提出日時 | 2016-05-25 21:04:17 |
言語 | Java (openjdk 23) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,701 bytes |
コンパイル時間 | 3,610 ms |
コンパイル使用メモリ | 77,924 KB |
実行使用メモリ | 56,692 KB |
最終ジャッジ日時 | 2024-10-07 14:26:39 |
合計ジャッジ時間 | 11,135 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 24 WA * 9 |
ソースコード
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>(); closed.add(0); queue.offer(new Block(1, 1)); while(true){ Block currentBlock; currentBlock = queue.poll(); if (currentBlock.value == goal){ System.out.println(currentBlock.count); break; } Block forward = currentBlock.getForwardNum(); Block back = currentBlock.getBackNum(); if (beforeQueue.indexOf(forward.value) == -1){ queue.offer(forward); beforeQueue.add(forward.value); } if (closed.indexOf(back.value) == -1){ queue.offer(back); closed.add(back.value); } int lastNumInClosed = closed.get((closed.size() - 1)); if (lastNumInClosed > goal * 2){ System.out.println(-1); break; } } } } 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); } }