結果

問題 No.453 製薬会社
ユーザー uwiuwi
提出日時 2016-12-04 01:13:36
言語 Java19
(openjdk 21)
結果
AC  
実行時間 108 ms / 2,000 ms
コード長 3,900 bytes
コンパイル時間 3,414 ms
コンパイル使用メモリ 78,036 KB
実行使用メモリ 56,188 KB
最終ジャッジ日時 2023-08-18 12:22:53
合計ジャッジ時間 5,545 ms
ジャッジサーバーID
(参考情報)
judge15 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 108 ms
55,724 KB
testcase_01 AC 99 ms
55,768 KB
testcase_02 AC 106 ms
55,628 KB
testcase_03 AC 102 ms
55,940 KB
testcase_04 AC 105 ms
55,904 KB
testcase_05 AC 101 ms
56,188 KB
testcase_06 AC 103 ms
55,952 KB
testcase_07 AC 107 ms
55,796 KB
testcase_08 AC 104 ms
55,716 KB
testcase_09 AC 101 ms
55,860 KB
testcase_10 AC 104 ms
55,868 KB
testcase_11 AC 102 ms
55,848 KB
testcase_12 AC 101 ms
55,760 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package adv2016;
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 N453 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		double c = ni(), d = ni();
		// maximize 1000x+2000y
		// 3/4*x+2/7*y <= C
		// 1/4*x+5/7*y <= D
		double max = 0;
		{
			double x = 0;
			double y = Math.min(c*7/2, d*7/5);
			max = Math.max(max, 1000*x+2000*y);
		}
		{
			double x = Math.min(c*4/3, d*4);
			double y = 0;
			max = Math.max(max, 1000*x+2000*y);
		}
		{
			double[] res = solve2x2(
					new double[][]{
						{3./4, 2./7},
						{1./4, 5./7}
					}, new double[]{c, d}
					);
			if(res != null){
				if(res[0] >= -1e-10 && res[1] >= -1e-10){
					max = Math.max(max, 1000*res[0]+2000*res[1]);
				}
			}
		}
		out.printf("%.14f\n", max);
	}
	
	
	public static double[] solve2x2(double[][] M, double[] V)
	{
		double EPS = 1E-10;
		double det = M[0][0]*M[1][1]-M[0][1]*M[1][0];
		if(Math.abs(det) < EPS)return null;
		return new double[]{
				(M[1][1]*V[0]-M[0][1]*V[1])/det,
				(-M[1][0]*V[0]+M[0][0]*V[1])/det
		};
	}
	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 N453().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