結果
| 問題 | No.594 壊れた宝物発見機 | 
| コンテスト | |
| ユーザー |  Kutimoti_T | 
| 提出日時 | 2018-06-04 20:03:14 | 
| 言語 | C++11(廃止可能性あり) (gcc 13.3.0) | 
| 結果 | 
                                WA
                                 
                             | 
| 実行時間 | - | 
| コード長 | 1,979 bytes | 
| コンパイル時間 | 1,584 ms | 
| コンパイル使用メモリ | 162,368 KB | 
| 実行使用メモリ | 25,616 KB | 
| 平均クエリ数 | 74.80 | 
| 最終ジャッジ日時 | 2024-07-16 15:51:02 | 
| 合計ジャッジ時間 | 4,901 ms | 
| ジャッジサーバーID (参考情報) | judge5 / judge3 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| other | WA * 20 | 
ソースコード
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
int main(){
  int X,Y,Z;
  {
    int x0 = -100;
    int x3 = 100;
    i64 f1 = 1LL << 60;
    i64 f2 = 0;
    while(x3 - x0 > 10){
      int x1 = (x0 * 2 + x3 * 1) / (1 + 2);
      int x2 = (x0 * 1 + x3 * 2) / (1 + 2);
      cout << "? " << x1 << " " << 0 << " " << 0 << endl;
      cin >> f1;
      cout << "? " << x2 << " " << 0 << " " << 0 << endl;
      cin >> f2;
      if(f1 >= f2){
        x0 = x1;
      }
      else{
        x3 = x2;
      }
    }
    i64 MIN = 1LL << 60;
    for(int i = x0;i <= x3;i++){
      cout << "? " << i << " " << 0 << " " << 0 << endl;
      cin >> f1;
      if(f1 < MIN) X = i,MIN = f1;
    }
  }
  {
    int x0 = -100;
    int x3 = 100;
    i64 f1 = 1LL << 60;
    i64 f2 = 0;
    while(x3 - x0 > 10){
      int x1 = (x0 * 2 + x3 * 1) / (1 + 2);
      int x2 = (x0 * 1 + x3 * 2) / (1 + 2);
      cout << "? " << 0 << " " << x1 << " " << 0 << endl;
      cin >> f1;
      cout << "? " << 0 << " " << x2 << " " << 0 << endl;
      cin >> f2;
      if(f1 >= f2){
        x0 = x1;
      }
      else{
        x3 = x2;
      }
    }
    i64 MIN = 1LL << 60;
    for(int i = x0;i <= x3;i++){
      cout << "? " << 0 << " " << i << " " << 0 << endl;
      cin >> f1;
      if(f1 < MIN) Y = i,MIN = f1;
    }
  }
  {
    int x0 = -100;
    int x3 = 100;
    i64 f1 = 1LL << 60;
    i64 f2 = 0;
    while(x3 - x0 > 10){
      int x1 = (x0 * 2 + x3 * 1) / (1 + 2);
      int x2 = (x0 * 1 + x3 * 2) / (1 + 2);
      cout << "? " << 0 << " " << 0 << " " << x1 << endl;
      cin >> f1;
      cout << "? " << 0 << " " << 0 << " " << x2 << endl;
      cin >> f2;
      if(f1 >= f2){
        x0 = x1;
      }
      else{
        x3 = x2;
      }
    }
    i64 MIN = 1LL << 60;
    for(int i = x0;i <= x3;i++){
      cout << "? " << 0 << " " << 0 << " " << i << endl;
      cin >> f1;
      if(f1 < MIN) Z = i,MIN = f1;
    }
  }
}
            
            
            
        