#353171 (C++14) No.594 壊れた宝物発見機

• 問題: No.594 壊れた宝物発見機
• ユーザー: peroon
• 提出日時: 2019-06-21 03:33:04
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 106 ms / 2,000 ms
• コード長: 1,766 bytes
• コンパイル時間: 1,399 ms
• コンパイル使用メモリ: 168,628 KB
• 実行使用メモリ: 25,476 KB
• 平均クエリ数: 79.60
• 最終ジャッジ日時: 2024-07-16 17:13:36
• 合計ジャッジ時間: 4,717 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
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
const ll mod = 1e9 + 7;
const ll inf = 1e18;
// 質問クエリ
int ask(int x, int y, int z) {
    int d;
    cout << "?" << " " << x << " " << y << " " << z << endl;
    cin >> d;
    return d;
}
ll query(ll i, ll x){
    vector<ll> A(3);
    A[i] = x;
    return ask(A[0], A[1], A[2]);
}
// 回答クエリ
void answer(int x, int y, int z) {
    cout << "!" << " " << x << " " << y << " " << z << endl;
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    // input
    vector<ll> Ans(3);
    FOR(i, 0, 3){
        ll left = -100;
        ll right = 100;
        while(right-left>2){
            ll p0 = (2 * left + 1 * right) / 3;
            ll p1 = (1 * left + 2 * right) / 3;
            
            ll d0 = query(i, p0);
            ll d1 = query(i, p1);
            if(d0<d1){
                right = p1;
            }else{
                left = p0;
            }
        }
        // 絞り込んだので線形探索
        ll ans = right;
        ll d_min = query(i, right);
        FOR(x, left, right){
            ll d = query(i, x);
            if(d<d_min){
                d_min = d;
                ans = x;
            }
        }
        Ans[i] = ans;
    }
    answer(Ans[0], Ans[1], Ans[2]);
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX