結果

問題 No.1071 ベホマラー
ユーザー uwiuwi
提出日時 2020-06-05 21:26:53
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,030 bytes
コンパイル時間 4,133 ms
コンパイル使用メモリ 83,436 KB
実行使用メモリ 52,060 KB
最終ジャッジ日時 2024-12-17 13:20:30
合計ジャッジ時間 8,455 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
50,304 KB
testcase_01 AC 51 ms
50,300 KB
testcase_02 AC 51 ms
50,448 KB
testcase_03 AC 52 ms
50,312 KB
testcase_04 AC 52 ms
50,044 KB
testcase_05 AC 52 ms
50,356 KB
testcase_06 AC 53 ms
49,940 KB
testcase_07 AC 53 ms
50,372 KB
testcase_08 AC 52 ms
50,144 KB
testcase_09 AC 50 ms
50,260 KB
testcase_10 WA -
testcase_11 AC 108 ms
51,844 KB
testcase_12 WA -
testcase_13 AC 184 ms
51,712 KB
testcase_14 AC 125 ms
51,644 KB
testcase_15 AC 122 ms
51,728 KB
testcase_16 WA -
testcase_17 AC 213 ms
51,820 KB
testcase_18 AC 209 ms
51,908 KB
testcase_19 AC 207 ms
52,012 KB
testcase_20 AC 213 ms
51,760 KB
testcase_21 WA -
testcase_22 AC 209 ms
51,948 KB
testcase_23 AC 219 ms
52,060 KB
testcase_24 AC 136 ms
51,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200605;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni(), X = ni(), Y = ni();
		int[] a = na(n);
		for(int i = 0;i < n;i++)a[i]--;
		
		int low = 0, high = 1000000001;
		while(high - low > 2){
			int l = low + (high-low)/3;
			int r = low + (high-low)/3*2;
			if(f(l, a, K, X, Y) < f(r, a, K, X, Y)){
				high = r;
			}else{
				low = l;
			}
		}
		long ans = Long.MAX_VALUE;
		for(int l = low;l <= high;l++){
			ans = Math.min(ans, f(l, a, K, X, Y));
		}
		out.println(ans);
	}
	
	long f(int h, int[] a, int K, int X, int Y)
	{
		long ret = (long)h*Y;
		for(int v : a){
			long rem = v-(long)h*K;
			if(rem > 0){
				ret += (rem+K-1)/K*X;
			}
		}
		return ret;
	}
	
	public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
	public static int lowerBound(int[] a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	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 C().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