結果

問題 No.594 壊れた宝物発見機
ユーザー yuya178yuya178
提出日時 2017-11-11 00:02:25
言語 Java19
(openjdk 21)
結果
AC  
実行時間 226 ms / 2,000 ms
コード長 5,359 bytes
コンパイル時間 2,503 ms
コンパイル使用メモリ 83,216 KB
実行使用メモリ 69,740 KB
平均クエリ数 104.90
最終ジャッジ日時 2023-09-23 15:00:16
合計ジャッジ時間 8,387 ms
ジャッジサーバーID
(参考情報)
judge15 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 224 ms
69,156 KB
testcase_01 AC 219 ms
69,492 KB
testcase_02 AC 217 ms
69,016 KB
testcase_03 AC 222 ms
69,196 KB
testcase_04 AC 225 ms
69,188 KB
testcase_05 AC 222 ms
68,856 KB
testcase_06 AC 221 ms
69,232 KB
testcase_07 AC 224 ms
69,516 KB
testcase_08 AC 217 ms
67,080 KB
testcase_09 AC 216 ms
69,740 KB
testcase_10 AC 225 ms
69,176 KB
testcase_11 AC 226 ms
69,064 KB
testcase_12 AC 224 ms
67,424 KB
testcase_13 AC 222 ms
69,284 KB
testcase_14 AC 222 ms
68,804 KB
testcase_15 AC 222 ms
69,664 KB
testcase_16 AC 221 ms
69,044 KB
testcase_17 AC 224 ms
69,676 KB
testcase_18 AC 224 ms
69,132 KB
testcase_19 AC 221 ms
67,256 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;
    void solve()
    {
        int left = -200;
        int right = 200;
        int x = 0;
        int y = 0;
        int z = 0;
        int lm = 0;
        int rm = 0;
        long ans1 = 0;
        long ans2 = 0;
        long ans = 0;
        for(int j = 0; j < 3; j++){
            left = -200;
            right = 200;
            while(left+10<right){
                lm = (left+left+right)/3;
                rm = (left+right+right)/3;
                if(j==0){
                    ans1 = go(lm,y,z);
                    ans2 = go(rm,y,z);
                }
                if(j==1){
                    ans1 = go(x,lm,z);
                    ans2 = go(x,rm,z);
                }
                if(j==2){
                    ans1 = go(x,y,lm);
                    ans2 = go(x,y,rm);
                }
                if(ans1>ans2){
                    left = lm;
                }
                else right = rm;
            }
            ans = Long.MAX_VALUE;
            for(int i = left; i<=right; i++){
                if(j==0){
                    if(go(i,y,z) < ans){
                        ans = go(i,y,z);
                        x = i;
                    }
                }
                if(j==1){
                    if(go(x,i,z) < ans){
                        ans = go(x,i,z);
                        y = i;
                    }
                }
                if(j==2){
                    if(go(x,y,i) < ans){
                        ans = go(x,y,i);
                        z = i;
                    }
                }
  
            }
        }
        out.println("! "+x+" "+y+" "+z);        
    }

    long go(int x, int y, int z)
    {
        out.println("? "+x+" "+y+" "+z);
        out.flush();
        
        return nl();
    }

    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");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private 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) && 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[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        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();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0