結果
問題 | No.3 ビットすごろく |
ユーザー | yuya178 |
提出日時 | 2017-11-26 23:15:50 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,779 ms / 5,000 ms |
コード長 | 4,522 bytes |
コンパイル時間 | 2,450 ms |
コンパイル使用メモリ | 80,920 KB |
実行使用メモリ | 86,720 KB |
最終ジャッジ日時 | 2023-09-14 00:52:23 |
合計ジャッジ時間 | 17,903 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,076 KB |
testcase_01 | AC | 41 ms
49,080 KB |
testcase_02 | AC | 40 ms
49,080 KB |
testcase_03 | AC | 83 ms
51,984 KB |
testcase_04 | AC | 49 ms
49,164 KB |
testcase_05 | AC | 132 ms
56,376 KB |
testcase_06 | AC | 81 ms
52,212 KB |
testcase_07 | AC | 62 ms
51,656 KB |
testcase_08 | AC | 96 ms
55,808 KB |
testcase_09 | AC | 251 ms
60,684 KB |
testcase_10 | AC | 567 ms
65,516 KB |
testcase_11 | AC | 196 ms
58,368 KB |
testcase_12 | AC | 132 ms
55,952 KB |
testcase_13 | AC | 79 ms
52,248 KB |
testcase_14 | AC | 489 ms
65,840 KB |
testcase_15 | AC | 1,391 ms
80,048 KB |
testcase_16 | AC | 691 ms
64,196 KB |
testcase_17 | AC | 1,249 ms
76,632 KB |
testcase_18 | AC | 69 ms
51,708 KB |
testcase_19 | AC | 1,733 ms
86,720 KB |
testcase_20 | AC | 48 ms
49,356 KB |
testcase_21 | AC | 42 ms
49,148 KB |
testcase_22 | AC | 535 ms
66,132 KB |
testcase_23 | AC | 1,706 ms
86,580 KB |
testcase_24 | AC | 1,779 ms
86,148 KB |
testcase_25 | AC | 1,433 ms
80,676 KB |
testcase_26 | AC | 42 ms
49,216 KB |
testcase_27 | AC | 68 ms
51,788 KB |
testcase_28 | AC | 708 ms
65,800 KB |
testcase_29 | AC | 216 ms
58,752 KB |
testcase_30 | AC | 41 ms
49,736 KB |
testcase_31 | AC | 43 ms
49,340 KB |
testcase_32 | AC | 174 ms
56,548 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; void solve() { int n = ni(); int[] dp = new int[n+1]; boolean[] seen = new boolean[n+1]; Deque<Integer> q = new ArrayDeque<>(); Deque<Integer> c = new ArrayDeque<>(); int cur = 1; int count = 1; q.add(cur); c.add(count); while(!q.isEmpty()){ cur = q.pop(); count = c.pop(); if(cur==n){ out.println(count); return; } seen[cur] = true; count++; int k = cur; int s = 0; while(k>0){ if(k%2==1) s++; k /= 2; } if(cur+s <= n && !seen[cur+s]){ q.add(cur+s); c.add(count); } if(cur-s >= 0 && !seen[cur-s]){ q.add(cur-s); c.add(count); } } out.println(-1); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b) && b != ' ')){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } static class ArrayUtils { public static void fill(double[][] array, double value) { for (double[] a : array) Arrays.fill(a, value); } public static void fill(double[][][] array, double value) { for (double[][] l : array) fill(l, value); } } }