結果
問題 | No.3 ビットすごろく |
ユーザー | kenji_shioya |
提出日時 | 2016-05-25 21:04:17 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,701 bytes |
コンパイル時間 | 4,403 ms |
コンパイル使用メモリ | 77,900 KB |
実行使用メモリ | 45,120 KB |
最終ジャッジ日時 | 2024-04-16 16:45:49 |
合計ジャッジ時間 | 11,908 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 132 ms
41,208 KB |
testcase_01 | AC | 132 ms
41,572 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 146 ms
41,352 KB |
testcase_05 | WA | - |
testcase_06 | AC | 188 ms
42,344 KB |
testcase_07 | AC | 149 ms
41,644 KB |
testcase_08 | AC | 174 ms
42,144 KB |
testcase_09 | AC | 205 ms
42,764 KB |
testcase_10 | WA | - |
testcase_11 | AC | 198 ms
42,536 KB |
testcase_12 | AC | 248 ms
43,192 KB |
testcase_13 | WA | - |
testcase_14 | AC | 433 ms
43,968 KB |
testcase_15 | AC | 582 ms
44,376 KB |
testcase_16 | AC | 237 ms
42,600 KB |
testcase_17 | AC | 235 ms
43,104 KB |
testcase_18 | AC | 155 ms
41,392 KB |
testcase_19 | AC | 246 ms
43,120 KB |
testcase_20 | AC | 151 ms
41,388 KB |
testcase_21 | AC | 133 ms
41,400 KB |
testcase_22 | WA | - |
testcase_23 | AC | 607 ms
45,120 KB |
testcase_24 | AC | 239 ms
42,924 KB |
testcase_25 | AC | 224 ms
42,428 KB |
testcase_26 | AC | 131 ms
41,252 KB |
testcase_27 | AC | 156 ms
41,836 KB |
testcase_28 | WA | - |
testcase_29 | AC | 198 ms
42,284 KB |
testcase_30 | AC | 131 ms
41,352 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
ソースコード
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); } }