#215700 (Java) No.594 壊れた宝物発見機

• 問題: No.594 壊れた宝物発見機
• ユーザー: uwi
• 提出日時: 2017-11-10 22:48:14
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 303 ms / 2,000 ms
• コード長: 2,257 bytes
• コンパイル時間: 3,345 ms
• コンパイル使用メモリ: 81,440 KB
• 実行使用メモリ: 72,324 KB
• 平均クエリ数: 100.00
• 最終ジャッジ日時: 2024-07-16 14:27:55
• 合計ジャッジ時間: 10,670 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
other	AC * 20

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
package contest171110;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class D2 {
    static Scanner in;
    static PrintWriter out;
    static String INPUT = "";
    
    static long get(int x, int y, int z)
    {
        out.println("? " + x + " " + y + " " + z);
        out.flush();
        return ni();
    }
    
    static void solve()
    {
        int x = -150, y = -150, z = -150;
        
        {
            int low = -150, high = 151;
            while(high - low > 2){
                int nl = low + (high - low)/3;
                int nh = high + (low - high)/3;
                long vl = get(nl, y, z);
                long vh = get(nh, y, z);
                if(vl < vh){
                    high = nh;
                }else{
                    low = nl;
                }
            }
            long min = Long.MAX_VALUE;
            for(int i = Math.max(low-2, -150);i <= Math.min(high+2, 150);i++){
                long v = get(i, y, z);
                if(v < min){
                    min = v;
                    x = i;
                }
            }
        }
        {
            int low = -150, high = 151;
            while(high - low > 2){
                int nl = low + (high - low)/3;
                int nh = high + (low - high)/3;
                long vl = get(x, nl, z);
                long vh = get(x, nh, z);
                if(vl < vh){
                    high = nh;
                }else{
                    low = nl;
                }
            }
            long min = Long.MAX_VALUE;
            for(int i = Math.max(low-2, -150);i <= Math.min(high+2, 150);i++){
                long v = get(x, i, z);
                if(v < min){
                    min = v;
                    y = i;
                }
            }
        }
        {
            int low = -150, high = 151;
            while(high - low > 2){
                int nl = low + (high - low)/3;
                int nh = high + (low - high)/3;
                long vl = get(x, y, nl);
                long vh = get(x, y, nh);
                if(vl < vh){
                    high = nh;
                }else{
                    low = nl;
                }
            }
            long min = Long.MAX_VALUE;
            for(int i = Math.max(low-2, -150);i <= Math.min(high+2, 150);i++){
                long v = get(x, y, i);
                if(v < min){
                    min = v;
                    z = i;
                }
            }
        }
        out.println("! " + x + " " + y + " " + z);
        out.flush();
    }
    
    public static void main(String[] args) throws Exception
    {
        in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);
        out = new PrintWriter(System.out);
        
        solve();
        out.flush();
    }
    
    static int ni() { return Integer.parseInt(in.next()); }
    static long nl() { return Long.parseLong(in.next()); }
    static double nd() { return Double.parseDouble(in.next()); }
    static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX