結果

問題 No.362 門松ナンバー
ユーザー uwiuwi
提出日時 2016-04-18 03:57:39
言語 Java21
(openjdk 21)
結果
AC  
実行時間 240 ms / 3,000 ms
コード長 4,625 bytes
コンパイル時間 4,057 ms
コンパイル使用メモリ 80,628 KB
実行使用メモリ 57,596 KB
最終ジャッジ日時 2024-04-15 03:22:21
合計ジャッジ時間 8,846 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 127 ms
55,020 KB
testcase_01 AC 113 ms
54,908 KB
testcase_02 AC 115 ms
54,888 KB
testcase_03 AC 96 ms
52,096 KB
testcase_04 AC 85 ms
51,696 KB
testcase_05 AC 140 ms
55,332 KB
testcase_06 AC 193 ms
56,940 KB
testcase_07 AC 140 ms
55,228 KB
testcase_08 AC 161 ms
56,016 KB
testcase_09 AC 204 ms
57,156 KB
testcase_10 AC 237 ms
57,116 KB
testcase_11 AC 237 ms
57,364 KB
testcase_12 AC 238 ms
57,596 KB
testcase_13 AC 239 ms
57,416 KB
testcase_14 AC 235 ms
57,072 KB
testcase_15 AC 240 ms
57,556 KB
testcase_16 AC 220 ms
57,176 KB
testcase_17 AC 223 ms
56,940 KB
testcase_18 AC 227 ms
57,252 KB
testcase_19 AC 173 ms
56,760 KB
testcase_20 AC 233 ms
57,576 KB
testcase_21 AC 93 ms
52,340 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 Q1010 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		for(int T = ni();T > 0;T--){
			long K = nl();
			long low = 100, high = 1000000000000000L;
			while(high - low > 1){
				long h = high+low>>>1;
				if(count(h) >= K){
					high = h;
				}else{
					low = h;
				}
			}
			out.println(high);
		}
	}
	
	long count(long n)
	{
		if(n < 100)return 0;
		char[] s = Long.toString(n).toCharArray();
		int m = s.length;
		long[][][] dp = new long[m+1][11][11];
		dp[0][10][10] = 1;
		int bb = 10, b = 10;
		boolean valid = true;
		for(int i = 0;i < m;i++){
			for(int j = 0;j < 10;j++){
				for(int k = 0;k < 10;k++){
					for(int l = 0;l <= 9;l++){
						if(j != l && j < k && k > l || j != l && j > k && k < l){
							dp[i+1][k][l] += dp[i][j][k];
						}
					}
				}
			}
			{
				int j = 10;
				for(int k = 0;k < 10;k++){
					for(int l = 0;l <= 9;l++){
						if(k != l){
							dp[i+1][k][l] += dp[i][j][k];
						}
					}
				}
			}
			
			if(i == 0){
				for(int j = 1;j < s[0]-'0';j++){
					dp[i+1][10][j] = 1;
				}
			}else{
				if(i < m-2){
					for(int j = 1;j <= 9;j++){
						dp[i+1][10][j]++;
					}
				}
				if(valid){
					for(int j = 0;j < s[i]-'0';j++){
						if(valid(bb, b, j)){
							dp[i+1][b][j]++;
						}
					}
				}
			}
			
			int anew = s[i]-'0';
			valid &= valid(bb, b, anew);
			bb = b; b = anew;
		}
		if(valid){
			dp[m][bb][b]++;
		}
		long ret = 0;
		for(int i = 0;i <= 10;i++){
			for(int j = 0;j <= 10;j++){
				ret += dp[m][i][j];
			}
		}
		return ret;
	}
	
	boolean valid(int a, int b, int c)
	{
		if(a == 10 && b == 10)return true;
		if(a == 10){
			return b != c;
		}
		return a < b && b > c && a != c || a > b && b < c && a != c;
	}
	
	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 Q1010().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 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