結果

問題 No.589 Counting Even
コンテスト
ユーザー uwi
提出日時 2017-11-04 00:56:50
言語 Java
(openjdk 23)
結果
AC  
実行時間 69 ms / 2,000 ms
コード長 5,191 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 4,328 ms
コンパイル使用メモリ 83,372 KB
実行使用メモリ 37,968 KB
最終ジャッジ日時 2024-11-23 15:42:21
合計ジャッジ時間 7,418 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

package contest171104;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long n = nl();
		out.println(count(n) - count(n-1));
	}
	
	long count(long n)
	{
		if(n < 0)return 0;
		int[] ds = Long.toBinaryString(n).chars().map(x -> x - '0').toArray();
		ds = rev(ds);
		return countDivisbleBinomialCoefficient(ds, 2, 1);
	}
	
	public static int[] rev(int[] a)
	{
		int[] b = new int[a.length];
		for(int i = 0;i < a.length;i++)b[a.length-1-i] = a[i];
		return b;
	}

	
	public static long countDivisbleBinomialCoefficient(int[] ds, int P, int alpha)
	{
		int m = ds.length;
		long[][][] pre = new long[alpha+1][2][2]; // [score][edge or not][have carry to next]
		long[][][] cur = new long[alpha+1][2][2];
		pre[0][1][0] = 1;
		
		long pmajor = (long)(P+1)*P/2;
		long pminor = (long)(P-1)*P/2;
		for(int i = m-1;i >= 0;i--){ // digit i
			for(int j = 0;j <= alpha;j++){
				cur[j][0][0] = cur[j][0][1] = 0;
				cur[j][1][0] = cur[j][1][1] = 0;
			}
			long edge = ds[i];
			long eminor0 = (edge+1)*edge/2; // <edge
			long eminor1 = edge*(edge-1)/2; // <edge-1
			long eminorx0 = edge+1; // =edge
			long eminorx1 = edge; // =edge-1
			long emajor0 = ((long)(P-1)*P/2-(long)(P-1-edge)*(P-1-edge+1)/2); // 10<=*<10+edge
			long emajor1 = ((long)(P+1)*P/2-(long)(P-1-edge+1)*(P-1-edge+2)/2); // 9<=*<9+edge
			long emajorx0 = P-1-edge; // =10+edge
			long emajorx1 = P-edge; // =9+edge
			int lim = 0;
			for(int j = 0;j <= alpha;j++){
				if(pre[j][0][0] == 0 && pre[j][0][1] == 0 && pre[j][1][0] == 0 && pre[j][1][1] == 0)continue;
				
				int nj = Math.min(alpha, j+1);
				lim = nj;
				cur[j][0][0] += pre[j][0][0] * pmajor;
				cur[j][0][1] += pre[j][0][0] * pminor;
				cur[nj][0][0] += pre[j][0][1] * pminor;
				cur[nj][0][1] += pre[j][0][1] * pmajor;
				
				cur[j][0][0] += pre[j][1][0] * eminor0;
				cur[j][0][1] += pre[j][1][0] * eminor1;
				cur[nj][0][0] += pre[j][1][1] * emajor0;
				cur[nj][0][1] += pre[j][1][1] * emajor1;
				
				cur[j][1][0] += pre[j][1][0] * eminorx0;
				cur[j][1][1] += pre[j][1][0] * eminorx1;
				cur[nj][1][0] += pre[j][1][1] * emajorx0;
				cur[nj][1][1] += pre[j][1][1] * emajorx1;
			}
			long[][][] dum = pre; pre = cur; cur = dum;
		}
		long ret = pre[alpha][0][0] + pre[alpha][1][0];
		return ret;
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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))){ // when nextLine, (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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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)); }
}
0