結果

問題 No.1651 Removing Cards
ユーザー cyclerecycle9cyclerecycle9
提出日時 2021-09-01 12:49:54
言語 Java21
(openjdk 21)
結果
AC  
実行時間 378 ms / 2,000 ms
コード長 4,178 bytes
コンパイル時間 2,711 ms
コンパイル使用メモリ 84,232 KB
実行使用メモリ 62,704 KB
最終ジャッジ日時 2024-11-27 13:55:17
合計ジャッジ時間 14,811 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,144 KB
testcase_01 AC 57 ms
37,364 KB
testcase_02 AC 106 ms
45,388 KB
testcase_03 AC 53 ms
37,364 KB
testcase_04 AC 54 ms
37,084 KB
testcase_05 AC 54 ms
37,168 KB
testcase_06 AC 53 ms
37,084 KB
testcase_07 AC 52 ms
36,812 KB
testcase_08 AC 53 ms
36,800 KB
testcase_09 AC 207 ms
45,828 KB
testcase_10 AC 213 ms
45,160 KB
testcase_11 AC 209 ms
45,132 KB
testcase_12 AC 211 ms
45,172 KB
testcase_13 AC 219 ms
44,968 KB
testcase_14 AC 217 ms
46,832 KB
testcase_15 AC 362 ms
62,308 KB
testcase_16 AC 368 ms
62,168 KB
testcase_17 AC 373 ms
62,404 KB
testcase_18 AC 351 ms
62,368 KB
testcase_19 AC 368 ms
62,364 KB
testcase_20 AC 371 ms
61,776 KB
testcase_21 AC 359 ms
62,436 KB
testcase_22 AC 323 ms
62,552 KB
testcase_23 AC 219 ms
45,296 KB
testcase_24 AC 183 ms
44,400 KB
testcase_25 AC 325 ms
62,096 KB
testcase_26 AC 317 ms
61,300 KB
testcase_27 AC 364 ms
62,572 KB
testcase_28 AC 354 ms
62,548 KB
testcase_29 AC 374 ms
62,576 KB
testcase_30 AC 376 ms
62,276 KB
testcase_31 AC 378 ms
62,704 KB
testcase_32 AC 195 ms
44,844 KB
testcase_33 AC 205 ms
45,200 KB
testcase_34 AC 201 ms
44,992 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;

public class Main {
	static final long MOD=1000000007;
	static final long MOD1=998244353;
	static int ans=0;
	public static void main(String[] args){
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		long K = sc.nextLong();
		int Q = sc.nextInt();
		long max = 1000000000000000000l;
		ArrayList<Long> list = new ArrayList<>();
		list.add(1l);
		o:while (list.get(list.size()-1)<max) {
			long X_i = list.get(list.size()-1);
			long C = X_i/(K-1) + X_i;
			for (long i = -2; i <= 2; i++) {
				long X_ii = C + i;
				if(X_ii<=0)continue;
				if (X_i <= X_ii - ceil(X_ii, K)){
					list.add(X_ii);
					continue o;
				}
			}
		}
		long[] X = new long[list.size()];
		Arrays.setAll(X, n->list.get(n));
		for (int i = 0; i < Q; i++) {
			long N = sc.nextLong();
			int k = upper_bound(X, 0, X.length-1, N);
			out.println(X[k-1]);
		}
		out.flush();
   	}
	public static int upper_bound(long[] a, int fromIndex, int toIndex, long val) {
		if (val >= a[toIndex])
			return toIndex + 1;
		if (val < a[fromIndex])
			return fromIndex;
		int lb = fromIndex - 1, ub = toIndex;
		while (ub - lb > 1) {
			int mid = (ub - lb)/2+lb;
			if (a[mid] > val) {
				ub = mid;
			} else {
				lb = mid;
			}
		}
		return ub;
	}
	static long ceil(long a,long b){
        return a%b==0?a/b:a/b+1;
    }
	static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public double nextDouble() {
			return Double.parseDouble(next());
		}
 
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
		public double[] nextDoubleArray(int n) {
			double[] a = new double[n];
			for (int i = 0; i < n; i++)
				a[i] = nextDouble();
			return a;
		}
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}
 
		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}
0