結果

問題 No.2962 Sum Bomb Bomber
ユーザー 横山緑横山緑
提出日時 2024-11-16 16:58:11
言語 C++23(gcc13)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 113 ms / 2,000 ms
コード長 6,424 bytes
コンパイル時間 3,923 ms
コンパイル使用メモリ 285,072 KB
実行使用メモリ 25,592 KB
平均クエリ数 145.40
最終ジャッジ日時 2024-11-16 16:59:10
合計ジャッジ時間 12,769 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
25,136 KB
testcase_01 AC 90 ms
24,568 KB
testcase_02 AC 84 ms
24,824 KB
testcase_03 AC 89 ms
25,592 KB
testcase_04 AC 87 ms
25,208 KB
testcase_05 AC 85 ms
25,148 KB
testcase_06 AC 73 ms
24,824 KB
testcase_07 AC 113 ms
24,568 KB
testcase_08 AC 85 ms
24,824 KB
testcase_09 AC 83 ms
25,208 KB
testcase_10 AC 83 ms
24,568 KB
testcase_11 AC 82 ms
24,824 KB
testcase_12 AC 83 ms
25,208 KB
testcase_13 AC 77 ms
24,824 KB
testcase_14 AC 85 ms
25,208 KB
testcase_15 AC 72 ms
24,824 KB
testcase_16 AC 83 ms
24,440 KB
testcase_17 AC 96 ms
25,208 KB
testcase_18 AC 88 ms
24,824 KB
testcase_19 AC 82 ms
24,824 KB
testcase_20 AC 81 ms
25,208 KB
testcase_21 AC 72 ms
24,568 KB
testcase_22 AC 78 ms
25,208 KB
testcase_23 AC 88 ms
24,568 KB
testcase_24 AC 87 ms
24,824 KB
testcase_25 AC 74 ms
24,568 KB
testcase_26 AC 85 ms
25,208 KB
testcase_27 AC 98 ms
24,824 KB
testcase_28 AC 86 ms
24,824 KB
testcase_29 AC 83 ms
25,208 KB
testcase_30 AC 80 ms
24,824 KB
testcase_31 AC 73 ms
25,208 KB
testcase_32 AC 82 ms
24,824 KB
testcase_33 AC 86 ms
24,824 KB
testcase_34 AC 93 ms
25,208 KB
testcase_35 AC 85 ms
24,824 KB
testcase_36 AC 82 ms
24,824 KB
testcase_37 AC 107 ms
24,824 KB
testcase_38 AC 86 ms
24,568 KB
testcase_39 AC 93 ms
24,568 KB
testcase_40 AC 100 ms
25,208 KB
testcase_41 AC 93 ms
24,824 KB
testcase_42 AC 103 ms
25,208 KB
testcase_43 AC 81 ms
24,820 KB
testcase_44 AC 87 ms
25,196 KB
testcase_45 AC 84 ms
24,568 KB
testcase_46 AC 85 ms
24,824 KB
testcase_47 AC 87 ms
24,824 KB
testcase_48 AC 87 ms
25,208 KB
testcase_49 AC 87 ms
24,824 KB
testcase_50 AC 87 ms
24,824 KB
testcase_51 AC 73 ms
24,812 KB
testcase_52 AC 86 ms
25,196 KB
testcase_53 AC 73 ms
24,812 KB
testcase_54 AC 72 ms
24,812 KB
testcase_55 AC 72 ms
24,812 KB
testcase_56 AC 72 ms
25,196 KB
testcase_57 AC 93 ms
24,812 KB
testcase_58 AC 89 ms
25,452 KB
testcase_59 AC 89 ms
25,052 KB
testcase_60 AC 87 ms
25,196 KB
testcase_61 AC 89 ms
24,812 KB
testcase_62 AC 85 ms
24,556 KB
testcase_63 AC 85 ms
25,196 KB
testcase_64 AC 86 ms
24,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
// https://xn--kst.jp/blog/2019/08/29/cpp-comp/
// debug methods
// usage: debug(x,y);
// vector 出力できるように修正
template <typename T>
ostream& debug_print(ostream& os, const vector<T>& v) {
    os << "[";
    for (size_t i = 0; i < v.size(); ++i) {
        os << v[i];
        if (i < v.size() - 1) os << ", ";
    }
    os << "]";
    return os;
}
template <typename T>
ostream& debug_print(ostream& os, const T& var) {
    os << var;
    return os;
}
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; }
#define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; }
#define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << endl; }
#define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; }
#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; }

#ifdef LOCAL
#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)
#else
#define debug(...)
#endif

using ll = long long;
using vl = vector<ll>;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
    return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
    return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
    for(T &x : a)
        cin >> x;
}
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
template <class Container, typename = void>
struct is_container : std::false_type {};
template <class Container>
struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};
template <class Container>
typename enable_if<is_container<Container>::value>::type print(const Container& x) {
    if (!x.empty()) {
        auto it = x.begin();
        for (; it != prev(x.end()); ++it) {
            cout << *it << " ";
        }
        cout << *it << "\n";  // 最後の要素を出力して改行
    }
}
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    long long __VA_ARGS__;                                                     \
    input(__VA_ARGS__)
#define STR(...)                                                               \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define REP1(a) for(ll i = 0; i < a; i++)
#define REP2(i, a) for(ll i = 0; i < a; i++)
#define REP3(i, a, b) for(ll i = a; i < b; i++)
#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)

ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
#line 2 "/home/y_midori/cp/yukicoder/453/test.cpp"
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
void solve() {
    LL(N);
    const ll lim = 9e8;
    // const ll lim = 10;
    ll l = -lim, r = lim;
    map<P, ll> mp;
    ll cnt = 0;
    auto f = [&mp, &cnt](ll x, ll y) -> ll {
        if(mp.contains(P(x, y))) {
            return mp[P(x, y)];
        }
        cout << "1 " << x << " " << y << endl;
        cnt++;
        // if(cnt > 299) {
        //     assert(false);
        // }
        LL(res);
        return mp[P(x, y)] = res;
    };
    auto g = [&](ll x, bool flag) -> ll {
        if(!flag) {
            return f(x + 1, 0) - f(x, 0);
        } else {
            return f(0, x + 1) - f(0, x);
        }
    };
    ll x = 0, y = 0;
    while(r > l + 1) {
        ll mid = (r + l) / 2;
        if(g(mid, false) >= 0) {
            r = mid;
        } else {
            l = mid;
        }
    }
    for(ll i = l - 10; i <= r + 10; i++) {
        if(f(x, 0) > f(i, 0)) {
            x = i;
        }
    }
    l = -lim, r = lim;
    while(r > l + 1) {
        ll mid = (r + l) / 2;
        if(g(mid, true) >= 0) {
            r = mid;
        } else {
            l = mid;
        }
    }
    for(ll i = l - 10; i <= r + 10; i++) {
        if(f(0, y) > f(0, i)) {
            y = i;
        }
    }
    // while(r > l + 2) {
    //     ll m1 = (r + 2 * l) / 3;
    //     ll m2 = (2 * r + l) / 3;
    //     if(f(m1, 0) > f(m2, 0)) {
    //         l = m1;
    //     } else {
    //         r = m2;
    //     }
    // }
    // ll x = l, y = 0;
    // l = -lim, r = lim;
    // while(r > l + 2) {
    //     ll m1 = (r + 2 * l) / 3;
    //     ll m2 = (2 * r + l) / 3;
    //     if(f(0, m1) > f(0, m2)) {
    //         l = m1;
    //     } else {
    //         r = m2;
    //     }
    // }
    // y = l;
    // for(ll i = l; i <= r; i++) {
    //     if(f(0, y) > f(0, i)) {
    //         y = i;
    //     }
    // }
    cout << "2 " << x << " " << y << endl;
}
int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << std::setprecision(16);
    int t = 1;
    rep(_, t) {
        solve();
    }
}
0