結果

問題 No.1808 Fullgold Alchemist
ユーザー nishi5451nishi5451
提出日時 2022-01-27 21:13:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 128 ms / 2,000 ms
コード長 2,840 bytes
コンパイル時間 2,187 ms
コンパイル使用メモリ 75,028 KB
実行使用メモリ 52,952 KB
最終ジャッジ日時 2023-08-26 23:11:39
合計ジャッジ時間 9,834 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
49,428 KB
testcase_01 AC 40 ms
49,496 KB
testcase_02 AC 40 ms
49,420 KB
testcase_03 AC 41 ms
49,408 KB
testcase_04 AC 40 ms
49,292 KB
testcase_05 AC 79 ms
52,564 KB
testcase_06 AC 101 ms
52,880 KB
testcase_07 AC 92 ms
52,496 KB
testcase_08 AC 116 ms
52,952 KB
testcase_09 AC 122 ms
50,896 KB
testcase_10 AC 114 ms
52,836 KB
testcase_11 AC 111 ms
52,832 KB
testcase_12 AC 90 ms
52,652 KB
testcase_13 AC 112 ms
52,648 KB
testcase_14 AC 116 ms
52,724 KB
testcase_15 AC 107 ms
52,864 KB
testcase_16 AC 48 ms
49,428 KB
testcase_17 AC 39 ms
49,632 KB
testcase_18 AC 76 ms
52,596 KB
testcase_19 AC 45 ms
49,424 KB
testcase_20 AC 82 ms
52,388 KB
testcase_21 AC 73 ms
51,856 KB
testcase_22 AC 40 ms
49,536 KB
testcase_23 AC 69 ms
51,660 KB
testcase_24 AC 46 ms
49,544 KB
testcase_25 AC 49 ms
49,496 KB
testcase_26 AC 84 ms
52,116 KB
testcase_27 AC 87 ms
51,884 KB
testcase_28 AC 114 ms
50,128 KB
testcase_29 AC 97 ms
52,688 KB
testcase_30 AC 92 ms
52,576 KB
testcase_31 AC 128 ms
52,712 KB
testcase_32 AC 100 ms
50,880 KB
testcase_33 AC 122 ms
52,876 KB
testcase_34 AC 126 ms
52,624 KB
testcase_35 AC 120 ms
52,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.util.stream.*;
import java.io.*;

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		int n = fs.nextInt();
		int m = fs.nextInt();
		long[] a = fs.nextLongs(n);

		long left = 0, right = 1000000001;
		while(right - left > 1){
			long mid = (left + right) / 2;
			long need = m * mid;
			long res = 0;
			boolean ok = true;
			for(int i = 0; i < n; i++){
				long tot = a[i] + res;
				if(tot >= need){
					res = tot - need;
				} else {
					ok = false;
					break;
				}
			}
			if(ok) left = mid;
			else right = mid;
		}
		pw.println(left);
	
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0