#215823 (C#(csc)) No.594 壊れた宝物発見機

• 問題: No.594 壊れた宝物発見機
• ユーザー: claw88
• 提出日時: 2017-11-10 23:10:48
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 151 ms / 2,000 ms
• コード長: 3,472 bytes
• コンパイル時間: 2,789 ms
• コンパイル使用メモリ: 111,764 KB
• 実行使用メモリ: 35,040 KB
• 平均クエリ数: 104.35
• 最終ジャッジ日時: 2024-07-16 14:30:53
• 合計ジャッジ時間: 5,304 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

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

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
using System.Numerics;
//using static System.Math;
class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    void solve()
    {
        int X = 0, Y = 0, Z = 0;
        long d = ask(-110, Y, Z);
        for (int i = -100; i <= 110; i+= 10)
        {
            long k = ask(i, Y, Z);
            if (k >= d)
            {
                long min = long.MaxValue;
                for (int j = i - 20; j <= i; j++)
                {
                    long p = ask(j, Y, Z);
                    if (p < min)
                    {
                        min = p;
                        X = j;
                    }
                }
                break;
            }
            else
            {
                d = k;
            }
        }
        d = ask(X, -110, Z);
        for (int i = -100; i <= 110; i += 10)
        {
            long k = ask(X, i, Z);
            if (k >= d)
            {
                long min = long.MaxValue;
                for (int j = i - 20; j <= i; j++)
                {
                    long p = ask(X, j, Z);
                    if (p < min)
                    {
                        min = p;
                        Y = j;
                    }
                }
                break;
            }
            else
            {
                d = k;
            }
        }
        d = ask(X, Y, -110);
        for (int i = -100; i <= 110; i += 10)
        {
            long k = ask(X, Y, i);
            if (k >= d)
            {
                long min = long.MaxValue;
                for (int j = i - 20; j <= i; j++)
                {
                    long p = ask(X, Y, j);
                    if (p < min)
                    {
                        min = p;
                        Z = j;
                    }
                }
                break;
            }
            else
            {
                d = k;
            }
        }
        WriteLine($"! {X} {Y} {Z}");
    }
    long ask(int x, int y, int z)
    {
        WriteLine($"? {x} {y} {z}");
        return cin.nextlong;
    }
    
}
class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}   
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX