結果

問題 No.594 壊れた宝物発見機
ユーザー yuya178yuya178
提出日時 2017-11-10 23:38:50
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,225 bytes
コンパイル時間 2,220 ms
コンパイル使用メモリ 85,372 KB
実行使用メモリ 72,320 KB
平均クエリ数 76.50
最終ジャッジ日時 2024-07-16 14:36:55
合計ジャッジ時間 7,674 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 200 ms
69,740 KB
testcase_04 AC 202 ms
69,744 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 208 ms
69,628 KB
testcase_08 WA -
testcase_09 AC 211 ms
69,892 KB
testcase_10 AC 207 ms
70,256 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 202 ms
69,328 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 209 ms
69,684 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 = -100;
        int right = 100;
        int x = 0;
        int y = 0;
        int z = 0;
        int lm = 0;
        int rm = 0;
        long ans1 = 0;
        long ans2 = 0;
        while(left+2<right){
            lm = (left+left+right)/3;
            rm = (left+right+right)/3;
            ans1 = go(lm,y,z);
            ans2 = go(rm,y,z);
            if(ans1>ans2){
                left = lm;
            }
            else right = rm;
        }
        ans1 = go(lm,y,z);
        ans2 = go(rm,y,z);
        if(ans1<=ans2) x = lm;
        else x = rm;

        left = -100;
        right = 100;
        while(left+2<right){
            lm = (left+left+right)/3;
            rm = (left+right+right)/3;
            ans1 = go(x,lm,z);
            ans2 = go(x,rm,z);
            if(ans1>ans2){
                left = lm;
            }
            else right = rm;
        }
        ans1 = go(x,lm,z);
        ans2 = go(y,rm,z);
        if(ans1<=ans2) y = lm;
        else y = rm;

        left = -100;
        right = 100;
        while(left+2<right){
            lm = (left+left+right)/3;
            rm = (left+right+right)/3;
            ans1 = go(x,y,lm);
            ans2 = go(x,y,rm);
            if(ans1>ans2){
                left = lm;
            }
            else right = rm;
        }
        ans1 = go(x,y,lm);
        ans2 = go(x,y,rm);
        if(ans1<=ans2) z = lm;
        else z = rm;
        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