結果
問題 | No.3 ビットすごろく |
ユーザー | Tsukasa_Type |
提出日時 | 2018-03-10 17:55:59 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,419 bytes |
コンパイル時間 | 2,166 ms |
コンパイル使用メモリ | 78,076 KB |
実行使用メモリ | 36,632 KB |
最終ジャッジ日時 | 2024-10-14 17:08:32 |
合計ジャッジ時間 | 4,769 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
36,236 KB |
testcase_01 | AC | 53 ms
36,136 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 47 ms
36,416 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 47 ms
36,320 KB |
testcase_08 | AC | 48 ms
36,308 KB |
testcase_09 | AC | 50 ms
36,524 KB |
testcase_10 | AC | 53 ms
35,992 KB |
testcase_11 | AC | 53 ms
36,368 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 50 ms
36,092 KB |
testcase_17 | AC | 50 ms
36,380 KB |
testcase_18 | AC | 47 ms
36,312 KB |
testcase_19 | AC | 52 ms
36,632 KB |
testcase_20 | AC | 49 ms
36,036 KB |
testcase_21 | AC | 50 ms
36,092 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 53 ms
36,336 KB |
testcase_25 | AC | 54 ms
36,296 KB |
testcase_26 | AC | 47 ms
36,108 KB |
testcase_27 | AC | 48 ms
36,264 KB |
testcase_28 | AC | 51 ms
36,448 KB |
testcase_29 | AC | 50 ms
36,452 KB |
testcase_30 | AC | 48 ms
36,288 KB |
testcase_31 | AC | 48 ms
36,108 KB |
testcase_32 | AC | 50 ms
36,380 KB |
ソースコード
import java.io.*; import java.util.*; import static java.lang.System.*; public class Main { static FastScanner sc = new FastScanner(System.in); public static void main(String[] args) { int n = sc.nextInt(); int[] ar = new int[n+1]; ar[1] = 1; ArrayDeque<Integer> deque = new ArrayDeque<>(); deque.addLast(1); int pos,dist; int L,R; while (!deque.isEmpty()) { pos = deque.removeFirst(); dist = Integer.bitCount(pos); L = pos-dist; R = pos+dist; if (L>0 && ar[L]==0) { ar[L] = ar[pos]+1; deque.addLast(L); } if (R<=n && ar[R]==0) { ar[R] = ar[pos]+1; deque.addLast(R); } } out.println(ar[n]); } } class FastScanner implements Closeable { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) {this.in = in;} private boolean hasNextByte() { if (ptr < buflen) {return true;} else{ ptr = 0; try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();} if (buflen <= 0) {return false;} } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) {throw new NumberFormatException();} while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;} else{throw new NumberFormatException();} b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} public void close() { try {in.close();} catch (IOException e) {} } }