結果
問題 | No.3 ビットすごろく |
ユーザー | amyu |
提出日時 | 2015-12-09 01:22:29 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,106 bytes |
コンパイル時間 | 2,329 ms |
コンパイル使用メモリ | 79,008 KB |
実行使用メモリ | 37,052 KB |
最終ジャッジ日時 | 2024-09-14 20:51:09 |
合計ジャッジ時間 | 5,390 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
36,752 KB |
testcase_01 | AC | 53 ms
36,436 KB |
testcase_02 | AC | 52 ms
36,460 KB |
testcase_03 | AC | 56 ms
36,476 KB |
testcase_04 | AC | 53 ms
36,708 KB |
testcase_05 | AC | 58 ms
36,920 KB |
testcase_06 | AC | 55 ms
36,520 KB |
testcase_07 | AC | 53 ms
36,620 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 58 ms
36,976 KB |
testcase_13 | AC | 54 ms
36,636 KB |
testcase_14 | AC | 60 ms
36,456 KB |
testcase_15 | AC | 63 ms
36,716 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 53 ms
36,540 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 52 ms
36,756 KB |
testcase_22 | AC | 60 ms
37,000 KB |
testcase_23 | AC | 63 ms
37,052 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 51 ms
36,584 KB |
testcase_32 | WA | - |
ソースコード
import java.util.*; import java.io.*; public class Main{ static final Reader sc = new Reader(); static final PrintWriter out = new PrintWriter(System.out,false); public static void main(String[] args) throws Exception { int n = sc.nextInt(); ArrayList<Integer> list = new ArrayList<Integer>(); boolean[] judge = new boolean[10010]; judge[1] = true; list.add(1); while(list.size()>0){ int x = list.get(list.size()-1); int count = Integer.bitCount(x); if(x+count<n+1 && !judge[x+count]){ judge[x+count] = true; list.add(x+count); if(x+count==n){ break; } } else if(x-count>0 && !judge[x-count]){ judge[x-count] = true; list.add(x-count); } else{ list.remove(list.size()-1); } } if(list.size()!=0){ out.println(list.size()); } else{ out.println(-1); } out.flush(); sc.close(); out.close(); } static void trace(Object... o) { System.out.println(Arrays.deepToString(o));} } class Reader { private final InputStream in; private final byte[] buf = new byte[1024]; private int ptr = 0; private int buflen = 0; public Reader() { this(System.in);} public Reader(InputStream source) { this.in = source;} private boolean hasNextByte() { if (ptr < buflen) return true; ptr = 0; try{ buflen = in.read(buf); }catch (IOException e) {e.printStackTrace();} if (buflen <= 0) return false; return true; } private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;} private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;} public boolean hasNext() {skip(); 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(); boolean minus = false; long num = readByte(); if(num == '-'){ num = 0; minus = true; }else if (num < '0' || '9' < num){ throw new NumberFormatException(); }else{ num -= '0'; } while(true){ int b = readByte(); if('0' <= b && b <= '9') num = num * 10 + (b - '0'); else if(b == -1 || !isPrintableChar(b)) return minus ? -num : num; else throw new NoSuchElementException(); } } public int nextInt() { long num = nextLong(); if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num) throw new NumberFormatException(); return (int)num; } public double nextDouble() { return Double.parseDouble(next()); } public char nextChar() { if (!hasNext()) throw new NoSuchElementException(); return (char)readByte(); } public String nextLine() { while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++; if (!hasNextByte()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (b != '\n' && b != '\r') { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i=0; i<n; i++) res[i] = nextInt(); return res; } public char[] nextCharArray(int n) { char[] res = new char[n]; for (int i=0; i<n; i++) res[i] = nextChar(); return res; } public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}}; }