結果

問題 No.737 PopCount
ユーザー hiromi_ayase
提出日時 2018-09-29 04:19:44
言語 Java
(openjdk 23)
結果
AC  
実行時間 82 ms / 1,000 ms
コード長 4,026 bytes
コンパイル時間 2,543 ms
コンパイル使用メモリ 81,892 KB
実行使用メモリ 51,284 KB
最終ジャッジ日時 2024-10-12 08:00:17
合計ジャッジ時間 4,724 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

public class Main {
  private static void solve() {
    long n = nl();
    
    //dp[i桁目][j個1があった][0:ぎりぎり] = xの総和
    long[][][] dp = new long[64][64][2];
    //dp[i桁目][j個1があった][0:ぎりぎり] = 組み合わせ
    long[][][] dp2 = new long[64][64][2];
    dp2[63][0][0] = 1;
    int mod = 1000000000 + 7;
    for (int i = 62; i >= 0; i --) {
      long b = (n >> i) & 1;
      for (int j = 0; j < 63; j ++) {
        if (b == 0) {
          dp2[i][j][0] += dp2[i + 1][j][0]; //0
          dp2[i][j][1] += dp2[i + 1][j][1]; //0
          dp[i][j][0] += dp[i + 1][j][0] << 1; //0
          dp[i][j][1] += dp[i + 1][j][1] << 1; //0
          if (j > 0) {
            dp2[i][j][1] += dp2[i + 1][j - 1][1]; //1
            dp[i][j][1] += (dp[i + 1][j - 1][1] << 1) + dp2[i + 1][j - 1][1]; //1
          }
        } else {
          if (j > 0) {
            dp2[i][j][0] += dp2[i + 1][j - 1][0]; //1
            dp2[i][j][1] += dp2[i + 1][j - 1][1]; //1
            dp[i][j][0] += (dp[i + 1][j - 1][0] << 1) + dp2[i + 1][j - 1][0]; //1
            dp[i][j][1] += (dp[i + 1][j - 1][1] << 1) + dp2[i + 1][j - 1][1]; //1
          }
          dp[i][j][1] += dp[i + 1][j][0] << 1; //0
          dp[i][j][1] += dp[i + 1][j][1] << 1; //0
          dp2[i][j][1] += dp2[i + 1][j][0]; //0
          dp2[i][j][1] += dp2[i + 1][j][1]; //0
        }
        dp[i][j][0] %= mod;
        dp[i][j][1] %= mod;
        dp2[i][j][0] %= mod;
        dp2[i][j][1] %= mod;
      }
    }
    
    long ret = 0;
    for (int j = 0; j < 63; j ++) {
      ret += dp[0][j][0] * j;
      ret += dp[0][j][1] * j;
      ret %= mod;
    }
    System.out.println(ret);
  }
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }
  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;
  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }
  private static double nd() {
    return Double.parseDouble(next());
  }
  private static long nl() {
    return Long.parseLong(next());
  }
  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }
  private static char[] ns() {
    return next().toCharArray();
  }
  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }
  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }
  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }
  private static int ni() {
    return Integer.parseInt(next());
  }
  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0