結果

問題 No.262 面白くないビットすごろく
ユーザー uwiuwi
提出日時 2015-08-01 19:42:25
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,901 bytes
コンパイル時間 4,482 ms
コンパイル使用メモリ 87,948 KB
実行使用メモリ 51,316 KB
最終ジャッジ日時 2024-07-18 00:41:03
合計ジャッジ時間 4,201 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
50,888 KB
testcase_01 AC 61 ms
50,860 KB
testcase_02 WA -
testcase_03 AC 72 ms
50,924 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q4xx;

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 Q402_3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int A = 43;
		int B = 7; // 2^B > 2*A
		int[][][] next = new int[A][A+1][2*A+1]; // [level][offset][start]
		int[][][] step = new int[A][A+1][2*A+1]; // [level][offset][start]
		{
			for(int o = 0;o <= A;o++){
				for(int i = 0;i <= A;i++){
					if(o == 0 && i == 0)continue;
					int s = 0;
					int j = i;
					for(;j < 1<<B;){
						j += Integer.bitCount(j) + o;
						s++;
					}
					next[B][o][i] = j&(1<<B)-1;
					step[B][o][i] = s;
				}
			}
		}
		for(int lv = B+1;lv < A;lv++){
			for(int o = 0;o <= A;o++){
				for(int i = 0;i <= 2*A;i++){
					if(o == 0 && i == 0)continue;
					if(o+1 > A)continue;
					step[lv][o][i] = step[lv-1][o+1][next[lv-1][o][i]] + step[lv-1][o][i];
					next[lv][o][i] = next[lv-1][o+1][next[lv-1][o][i]];
				}
			}
		}
		
		long n = nl();
		int low = 1;
		long ret = 0;
		int high = 0;
		for(int i = A-1;i >= B;i--){
			if(n<<~i<0){
				ret += step[i][high][low];
				low = next[i][high][low];
				high++;
			}
		}
		long cur = n>>>B<<B|low;
		while(cur < n){
			cur += Long.bitCount(cur);
			ret++;
		}
		if(cur == n){
			out.println(ret+1);
		}else{
			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 Q402_3().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))){ // 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 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)); }
}
0