結果

問題 No.2962 Sum Bomb Bomber
ユーザー soto800soto800
提出日時 2024-11-16 16:00:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 106 ms / 2,000 ms
コード長 4,274 bytes
コンパイル時間 2,127 ms
コンパイル使用メモリ 200,864 KB
実行使用メモリ 25,328 KB
平均クエリ数 293.46
最終ジャッジ日時 2024-11-16 16:02:41
合計ジャッジ時間 12,023 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
25,208 KB
testcase_01 AC 106 ms
25,208 KB
testcase_02 AC 99 ms
25,208 KB
testcase_03 AC 97 ms
25,208 KB
testcase_04 AC 96 ms
24,440 KB
testcase_05 AC 98 ms
24,952 KB
testcase_06 AC 84 ms
24,440 KB
testcase_07 AC 104 ms
25,208 KB
testcase_08 AC 98 ms
24,952 KB
testcase_09 AC 101 ms
25,208 KB
testcase_10 AC 97 ms
24,824 KB
testcase_11 AC 99 ms
24,824 KB
testcase_12 AC 98 ms
24,568 KB
testcase_13 AC 96 ms
24,428 KB
testcase_14 AC 104 ms
24,824 KB
testcase_15 AC 86 ms
24,824 KB
testcase_16 AC 105 ms
24,824 KB
testcase_17 AC 97 ms
24,440 KB
testcase_18 AC 98 ms
24,824 KB
testcase_19 AC 100 ms
25,064 KB
testcase_20 AC 99 ms
24,824 KB
testcase_21 AC 88 ms
24,440 KB
testcase_22 AC 96 ms
24,824 KB
testcase_23 AC 99 ms
24,824 KB
testcase_24 AC 99 ms
24,824 KB
testcase_25 AC 92 ms
25,328 KB
testcase_26 AC 98 ms
24,728 KB
testcase_27 AC 97 ms
24,824 KB
testcase_28 AC 98 ms
24,824 KB
testcase_29 AC 96 ms
24,440 KB
testcase_30 AC 98 ms
24,568 KB
testcase_31 AC 96 ms
24,440 KB
testcase_32 AC 97 ms
24,440 KB
testcase_33 AC 97 ms
24,824 KB
testcase_34 AC 101 ms
24,824 KB
testcase_35 AC 101 ms
24,824 KB
testcase_36 AC 96 ms
24,824 KB
testcase_37 AC 100 ms
25,208 KB
testcase_38 AC 96 ms
25,208 KB
testcase_39 AC 97 ms
25,208 KB
testcase_40 AC 98 ms
24,440 KB
testcase_41 AC 96 ms
25,208 KB
testcase_42 AC 101 ms
25,208 KB
testcase_43 AC 87 ms
24,952 KB
testcase_44 AC 97 ms
24,952 KB
testcase_45 AC 95 ms
24,824 KB
testcase_46 AC 96 ms
25,208 KB
testcase_47 AC 97 ms
25,208 KB
testcase_48 AC 104 ms
24,824 KB
testcase_49 AC 97 ms
24,952 KB
testcase_50 AC 97 ms
24,824 KB
testcase_51 AC 101 ms
24,428 KB
testcase_52 AC 90 ms
24,812 KB
testcase_53 AC 78 ms
24,812 KB
testcase_54 AC 84 ms
24,428 KB
testcase_55 AC 83 ms
24,428 KB
testcase_56 AC 83 ms
25,196 KB
testcase_57 AC 100 ms
24,812 KB
testcase_58 AC 96 ms
25,184 KB
testcase_59 AC 96 ms
24,940 KB
testcase_60 AC 99 ms
24,812 KB
testcase_61 AC 99 ms
24,812 KB
testcase_62 AC 99 ms
24,812 KB
testcase_63 AC 97 ms
24,812 KB
testcase_64 AC 99 ms
24,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

//#include <atcoder/all>
using namespace std;

#define lli long long int
#define REP(i, s, n) for (lli i = s; i < n; i++)
#define INF (1LL << 62)
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG1(x)                                                                \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y)                                                             \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z)                                                          \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
         << TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z)                                                       \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z        \
         << endl;
#define LOG5(w, x, y, z, a)                                                    \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
         << TO_STRING(a) << "=" << a << endl;
#define LOG6(w, x, y, z, a, b)                                                 \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
         << TO_STRING(a) << "=" << a << " " << TO_STRING(b) << "=" << b        \
         << endl;

#define overload6(a, b, c, d, e, f, g, ...) g
#define LOG(...)                                                               \
  overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__)

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;
}

mt19937 engine;
std::chrono::system_clock::time_point start, endTime;

#define DEBUG 0

lli query(lli x, lli y) {
  cout << "1 " << x << " " << y << endl;
  lli ans;
  cin >> ans;
  return ans;
}

void solve() {
  //  write your code here

  lli N;
  cin >> N;

  const int BIG = 1e9;

  // x方向に対して3分探索する
  lli smallX = -1e9;
  lli largeX = 1e9;
  lli cnt = 0;
  while (smallX + 1 < largeX) {
    cnt++;
    if (cnt >= 75) {
      break;
    }
    lli smallMid = (smallX * 2 + largeX) / 3;
    lli largeMid = (smallX + largeX * 2) / 3;
    lli smallMidQuery = query(smallMid, BIG);
    lli largeMidQuery = query(largeMid, BIG);

    if (smallMidQuery < largeMidQuery) {
      largeX = largeMid;
    } else {
      smallX = smallMid;
    }
  }

  lli x = (smallX + largeX) / 2;

  cnt = 0;

  // y方向に対して3分探索する
  lli smallY = -1e9;
  lli largeY = 1e9;
  while (smallY + 1 < largeY) {
    cnt++;
    if (cnt >= 75) {
      break;
    }
    lli smallMid = (smallY * 2 + largeY) / 3;
    lli largeMid = (smallY + largeY * 2) / 3;
    lli smallMidQuery = query(BIG, smallMid);
    lli largeMidQuery = query(BIG, largeMid);

    if (smallMidQuery < largeMidQuery) {
      largeY = largeMid;
    } else {
      smallY = smallMid;
    }
  }

  lli y = (smallY + largeY) / 2;
  cout << "2 " << x << " " << y << endl;
}

// Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools  (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
  // Failed to predict input format

  lli N = 1;
  // cin >> N;
  while (N--)
    solve();

  return 0;
}
0