結果

問題 No.2227 King Kraken's Attack
ユーザー uwiuwi
提出日時 2023-02-24 22:22:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 278 ms / 2,000 ms
コード長 13,419 bytes
コンパイル時間 5,484 ms
コンパイル使用メモリ 92,928 KB
実行使用メモリ 54,300 KB
最終ジャッジ日時 2024-04-10 09:29:06
合計ジャッジ時間 10,136 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
51,144 KB
testcase_01 AC 77 ms
50,844 KB
testcase_02 AC 69 ms
51,144 KB
testcase_03 AC 75 ms
51,044 KB
testcase_04 AC 67 ms
50,944 KB
testcase_05 AC 70 ms
51,008 KB
testcase_06 AC 72 ms
51,108 KB
testcase_07 AC 72 ms
51,100 KB
testcase_08 AC 71 ms
51,028 KB
testcase_09 AC 72 ms
51,028 KB
testcase_10 AC 71 ms
51,044 KB
testcase_11 AC 68 ms
51,060 KB
testcase_12 AC 71 ms
50,964 KB
testcase_13 AC 68 ms
51,020 KB
testcase_14 AC 278 ms
54,300 KB
testcase_15 AC 176 ms
51,940 KB
testcase_16 AC 178 ms
51,988 KB
testcase_17 AC 177 ms
52,244 KB
testcase_18 AC 68 ms
51,044 KB
testcase_19 AC 88 ms
51,284 KB
testcase_20 AC 89 ms
51,444 KB
testcase_21 AC 156 ms
52,380 KB
testcase_22 AC 128 ms
52,240 KB
testcase_23 AC 83 ms
51,220 KB
testcase_24 AC 147 ms
52,264 KB
testcase_25 AC 67 ms
50,988 KB
testcase_26 AC 274 ms
52,404 KB
testcase_27 AC 68 ms
50,840 KB
testcase_28 AC 106 ms
51,468 KB
testcase_29 AC 92 ms
51,376 KB
testcase_30 AC 146 ms
51,932 KB
testcase_31 AC 114 ms
51,588 KB
testcase_32 AC 85 ms
51,080 KB
testcase_33 AC 84 ms
51,424 KB
testcase_34 AC 87 ms
51,140 KB
testcase_35 AC 94 ms
51,104 KB
testcase_36 AC 84 ms
51,076 KB
testcase_37 AC 62 ms
50,708 KB
testcase_38 AC 67 ms
50,960 KB
testcase_39 AC 68 ms
51,012 KB
testcase_40 AC 69 ms
51,064 KB
testcase_41 AC 67 ms
50,800 KB
testcase_42 AC 69 ms
50,928 KB
testcase_43 AC 65 ms
50,952 KB
testcase_44 AC 65 ms
50,932 KB
testcase_45 AC 68 ms
51,036 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest230224;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class D2 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		// x, y
		// x <= H/LA, y <= W/LB
		// H*W - LA*x*LB*y <= x*KA+y*KB
		// minimize x+y
		//
		// x+y=t

		// H*W - LA*x*LB*y <= x*KA+y*KB
		// H*W - LA*x*LB*(t-x) <= KA*x+KB*(t-x)
		// LA*LB*x^2-(LA*LB*t+KA-KB)x +H*W-KB*t <= 0

		long H = nl(), W = nl();
		long LA = nl(), LB = nl();
		long KA = nl(), KB = nl();
		for(long t = 1;;t++){
			long A = LA*LB;
			long B = -(LA*LB*t+KA-KB);
			long C = H*W-KB*t;

			{
				// H*W - H*LB*(t-x) <= x*KA+(t-x)*KB
				// (H*LB-KA+KB)x <= t*KB-H*W+H*LB*t
				long xinf = Math.min(t, (H+LA-1)/LA);
				if(H*W-H*LB*(t-xinf) <= xinf*KA+(t-xinf)*KB){
					out.println(t);
					return;
				}
				if(H*W-H*LB*(t-t) <= t*KA+(t-t)*KB){
					out.println(t);
					return;
				}
			}
			{
				// H*W - H*LB*(t-x) <= x*KA+(t-x)*KB
				// (H*LB-KA+KB)x <= t*KB-H*W+H*LB*t
				long yinf = Math.min(t, (W+LB-1)/LB);
				if(H*W-(t-yinf)*LA*W <= (t-yinf)*KA+yinf*KB){
					out.println(t);
					return;
				}
				if(H*W-(t-t)*LA*W <= (t-t)*KA+t*KB){
					out.println(t);
					return;
				}
			}

			long xsup = Math.min(t, H/LA);
			long xinf = Math.max(0, t-W/LB);
			if(xinf > xsup)continue;
			if(check(A, B, C, xinf)){
				out.println(t);
				return;
			}
			if(check(A, B, C, xsup)){
				out.println(t);
				return;
			}

//			double dd = (double)B*B-4.*A*C;
//			if(dd < -1e18)continue;
//			if(dd < 1e18){
//				long di = B*B-4L*A*C;
//				if(di < 0)continue;
//			}
			long axis = -B/2/A;
			if(xinf <= axis && axis <= xsup && check(A, B, C, axis)){
				out.println(t);
				return;
			}
			axis++;
			if(xinf <= axis && axis <= xsup && check(A, B, C, axis)){
				out.println(t);
				return;
			}
		}
	}
	
	boolean check(long A, long B, long C, long x)
	{
		double ysd = ((double) A * x + B) * x + C;
		if (ysd < -1e18) {
			return true;
		}else if(ysd < 1e18) {
			long ys = (A * x + B) * x + C;
			if (ys <= 0) {
				return true;
			}
		}
		return false;
	}

	public static void main(String[] args) {
		new D2().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-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();
	}

	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
			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 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[] 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 int ni()
	{
		int num = 0, 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 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();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){ return write(c).writeln(); }
		public FastWriter writeln(int x){ return write(x).writeln(); }
		public FastWriter writeln(long x){ return write(x).writeln(); }
		public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(x));
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs) { return write(xs).writeln(); }
		public FastWriter writeln(long... xs) { return write(xs).writeln(); }
		public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(char[] line) { return write(line).writeln(); }
		public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }
		public FastWriter writeln(String s) { return write(s).writeln(); }

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0