結果

問題 No.594 壊れた宝物発見機
ユーザー GrenacheGrenache
提出日時 2017-11-10 23:43:18
言語 Java21
(openjdk 21)
結果
AC  
実行時間 247 ms / 2,000 ms
コード長 4,840 bytes
コンパイル時間 3,386 ms
コンパイル使用メモリ 76,212 KB
実行使用メモリ 71,928 KB
平均クエリ数 51.50
最終ジャッジ日時 2023-09-23 14:57:53
合計ジャッジ時間 9,615 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 242 ms
69,208 KB
testcase_01 AC 236 ms
70,532 KB
testcase_02 AC 227 ms
70,544 KB
testcase_03 AC 241 ms
71,152 KB
testcase_04 AC 238 ms
70,272 KB
testcase_05 AC 229 ms
68,908 KB
testcase_06 AC 233 ms
69,560 KB
testcase_07 AC 225 ms
70,788 KB
testcase_08 AC 232 ms
69,876 KB
testcase_09 AC 225 ms
70,496 KB
testcase_10 AC 224 ms
70,988 KB
testcase_11 AC 240 ms
70,768 KB
testcase_12 AC 225 ms
69,436 KB
testcase_13 AC 247 ms
70,996 KB
testcase_14 AC 239 ms
71,916 KB
testcase_15 AC 228 ms
70,208 KB
testcase_16 AC 240 ms
68,356 KB
testcase_17 AC 239 ms
70,356 KB
testcase_18 AC 242 ms
71,928 KB
testcase_19 AC 234 ms
70,764 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder594 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {

        // 整数の三分探索
        int l = -150;
        int r = 150;
		while (r - l > 1) {
			int mid = l + (r - l) / 2;
			int f1 = d(mid + 1, 150, 150);
			int f2 = d(mid, 150, 150);
			if (f1 - f2 >= 0) {
				r = mid;
			} else {
				l = mid;
			}
		}
		int x = r;

        // 整数の三分探索
        l = -150;
        r = 150;
		while (r - l > 1) {
			int mid = l + (r - l) / 2;
			int f1 = d(150, mid + 1, 150);
			int f2 = d(150, mid, 150);
			if (f1 - f2 >= 0) {
				r = mid;
			} else {
				l = mid;
			}
		}
		int y = r;

        // 整数の三分探索
        l = -150;
        r = 150;
		while (r - l > 1) {
			int mid = l + (r - l) / 2;
			int f1 = d(150, 150, mid + 1);
			int f2 = d(150, 150, mid);
			if (f1 - f2 >= 0) {
				r = mid;
			} else {
				l = mid;
			}
		}
		int z = r;

		pr.printf("! %d %d %d\n", x, y, z);
	}

	private static int d(int x, int y, int z) {
		pr.printf("? %d %d %d\n", x, y, z);
		pr.flush();

		return sc.nextInt();
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0