結果

問題 No.555 世界史のレポート
ユーザー uwiuwi
提出日時 2017-08-19 21:41:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 48 ms / 2,000 ms
コード長 3,696 bytes
コンパイル時間 3,435 ms
コンパイル使用メモリ 87,200 KB
実行使用メモリ 36,960 KB
最終ジャッジ日時 2024-10-14 15:53:11
合計ジャッジ時間 5,018 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
36,672 KB
testcase_01 AC 46 ms
36,796 KB
testcase_02 AC 45 ms
36,588 KB
testcase_03 AC 47 ms
36,588 KB
testcase_04 AC 47 ms
36,960 KB
testcase_05 AC 48 ms
36,560 KB
testcase_06 AC 46 ms
36,748 KB
testcase_07 AC 46 ms
36,536 KB
testcase_08 AC 46 ms
36,912 KB
testcase_09 AC 45 ms
36,852 KB
testcase_10 AC 47 ms
36,668 KB
testcase_11 AC 44 ms
36,668 KB
testcase_12 AC 47 ms
36,716 KB
testcase_13 AC 47 ms
36,716 KB
testcase_14 AC 46 ms
36,932 KB
testcase_15 AC 48 ms
36,708 KB
testcase_16 AC 44 ms
36,792 KB
testcase_17 AC 47 ms
36,628 KB
testcase_18 AC 46 ms
36,748 KB
testcase_19 AC 45 ms
36,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package yukicoder;
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 N555 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), c = ni(), v = ni();
		// minimize c*x+v(a[0]+a[1]+...+a[x-1])
		// subject to (a[0]+1)*(a[1]+1)*...*(a[x-1]+1) >= n (... => maximize)
		long min = Long.MAX_VALUE;
		for(int x = 1;x <= 20;x++){
			long under = (long)(Math.pow(n, 1./x)+1e-10);
			// log(under)*A + log(under+1)*(x-A) >= log n
			// A <= (log n - xlog(under+1))/(log(under)-log(under+1))
			long amin = (long)((Math.log(n)-x*Math.log(under+1))/(Math.log(under) - Math.log(under+1))+1e-10);
//			assert 0 <= amin;
//			assert amin <= x;
//			assert Math.pow(under, amin) * Math.pow(under+1, x-amin) >= n;
			min = Math.min(min, (long)c*x+v*(amin*(under-1)+(x-amin)*(under)));
		}
		out.println(min);
	}
	
	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 N555().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