結果
問題 | No.737 PopCount |
ユーザー | 37zigen |
提出日時 | 2020-03-27 19:19:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 125 ms / 1,000 ms |
コード長 | 3,532 bytes |
コンパイル時間 | 2,366 ms |
コンパイル使用メモリ | 75,832 KB |
実行使用メモリ | 56,348 KB |
最終ジャッジ日時 | 2023-08-30 16:43:51 |
合計ジャッジ時間 | 5,990 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 122 ms
55,740 KB |
testcase_01 | AC | 121 ms
55,848 KB |
testcase_02 | AC | 122 ms
56,028 KB |
testcase_03 | AC | 122 ms
56,348 KB |
testcase_04 | AC | 123 ms
55,868 KB |
testcase_05 | AC | 125 ms
55,964 KB |
testcase_06 | AC | 123 ms
55,900 KB |
testcase_07 | AC | 122 ms
56,348 KB |
testcase_08 | AC | 123 ms
55,752 KB |
testcase_09 | AC | 123 ms
55,740 KB |
testcase_10 | AC | 121 ms
55,948 KB |
testcase_11 | AC | 121 ms
56,312 KB |
testcase_12 | AC | 123 ms
55,912 KB |
testcase_13 | AC | 124 ms
55,748 KB |
testcase_14 | AC | 125 ms
55,812 KB |
testcase_15 | AC | 123 ms
55,644 KB |
testcase_16 | AC | 123 ms
55,468 KB |
testcase_17 | AC | 123 ms
55,680 KB |
ソースコード
import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.math.BigInteger; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Scanner; public class Main { public static void main(String[] args) throws FileNotFoundException { long t = System.currentTimeMillis(); new Main().run(); System.err.println(System.currentTimeMillis() - t); } final long MOD=(long)1e9+7; void run() { Scanner sc = new Scanner(System.in); long N=sc.nextLong(); int len=Long.toBinaryString(N).length(); long[][][] dp =new long[len+1][2][len+1]; long[][][] dp2=new long[len+1][2][len+1]; dp[0][0][0]=1; for(int i=0;i<len;++i) { for(int less=0;less<=1;++less) { for(int cur_cnt=0;cur_cnt<=len;++cur_cnt) { if(dp[i][less][cur_cnt]==0)continue; for(int next_val=0;next_val<=(less==1?1:((N>>(len-1-i))%2));++next_val) { int next_cnt=cur_cnt+next_val; int next_less=less; if((N>>(len-1-i))%2>next_val)next_less=1; dp[i+1][next_less][next_cnt]+=dp[i][less][cur_cnt]; dp[i+1][next_less][next_cnt]%=MOD; dp2[i+1][next_less][next_cnt]+=dp2[i][less][cur_cnt]+next_val*(1L<<(len-1-i))*dp[i][less][cur_cnt]%MOD; dp2[i+1][next_less][next_cnt]%=MOD; } } } } long ans=0; for(int less=0;less<=1;++less) { for(int cnt=1;cnt<=len;++cnt) { ans+=cnt*dp2[len][less][cnt]%MOD; ans%=MOD; } } System.out.println(ans); } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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() { return (int)nextLong(); } }