結果

問題 No.453 製薬会社
ユーザー hiromi_ayasehiromi_ayase
提出日時 2016-12-26 15:12:39
言語 Java19
(openjdk 21)
結果
AC  
実行時間 117 ms / 2,000 ms
コード長 3,271 bytes
コンパイル時間 2,068 ms
コンパイル使用メモリ 74,232 KB
実行使用メモリ 56,188 KB
最終ジャッジ日時 2023-08-21 12:34:35
合計ジャッジ時間 4,560 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 113 ms
55,840 KB
testcase_01 AC 113 ms
55,612 KB
testcase_02 AC 117 ms
55,952 KB
testcase_03 AC 115 ms
55,672 KB
testcase_04 AC 114 ms
55,616 KB
testcase_05 AC 110 ms
56,012 KB
testcase_06 AC 110 ms
55,940 KB
testcase_07 AC 111 ms
55,952 KB
testcase_08 AC 112 ms
55,848 KB
testcase_09 AC 112 ms
56,188 KB
testcase_10 AC 111 ms
56,040 KB
testcase_11 AC 111 ms
56,124 KB
testcase_12 AC 111 ms
56,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;


public class Main {

	private static double C;
	private static double D;
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		C = sc.nextInt();
		D = sc.nextInt();

		double left = 0;
		double right = Math.min(C / 3 * 4, D * 4);
		
		for (int i = 0; i < 200; i ++) {
			double k1 = (left * 2 + right) / 3;
			double k2 = (left + right * 2) / 3;
			
			if (f(k1) < f(k2)) {
				left = k1;
			} else {
				right = k2;
			}
		}
		
		System.out.printf("%.9f%n", f(left));
	}
	
	private static double f(double k) {
		double lastC = C - k * 3 / 4;
		double lastD = D - k / 4;
		
		double ret = 0;
		ret += k * 1000;
		ret += Math.min(lastC / 2 * 7, lastD / 5 * 7) * 2000;
		return ret;
	}
}



class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0