結果

問題 No.2962 Sum Bomb Bomber
ユーザー AngrySadEight
提出日時 2024-11-16 16:05:07
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 4,852 bytes
コンパイル時間 19,370 ms
コンパイル使用メモリ 266,288 KB
最終ジャッジ日時 2025-02-25 04:30:44
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample TLE * 1
other -- * 64
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N;
    cin >> N;

    ll INF = 100000002;

    ll xl = -INF;
    ll xr = INF;

    map<ll, ll> xval;

    ll intime = 0;
    while (xr - xl > 1) {
        ll mid1 = (xl * 2 + xr) / 3;
        ll mid2 = (xl + xr * 2) / 3;

        if (xval.find(mid1) == xval.end()) {
            cout << "1 " << mid1 << " 0" << endl;
            ll d;
            cin >> d;
            intime++;
            xval[mid1] = d;
        }
        if (xval.find(mid2) == xval.end()) {
            cout << "1 " << mid2 << " 0" << endl;
            ll d;
            cin >> d;
            intime++;
            xval[mid2] = d;
        }
        if (xval[mid1] <= xval[mid2]) {
            xr = mid2;
        } else {
            xl = mid1;
        }
    }
    ll x;
    if (xval.find(xl) == xval.end()) {
        cout << "1 " << xl << " 0" << endl;
        ll d;
        cin >> d;
        intime++;
        xval[xl] = d;
    }
    if (xval.find(xr) == xval.end()) {
        cout << "1 " << xr << " 0" << endl;
        ll d;
        cin >> d;
        intime++;
        xval[xr] = d;
    }
    if (xval[xl] <= xval[xr]) {
        x = xl;
    } else {
        x = xr;
    }

    ll yl = -INF;
    ll yr = INF;

    map<ll, ll> yval;

    while (yr - yl > 1) {
        ll mid1 = (yl * 2 + yr) / 3;
        ll mid2 = (yl + yr * 2) / 3;

        if (yval.find(mid1) == yval.end()) {
            cout << "1 0 " << mid1 << endl;
            ll d;
            cin >> d;
            intime++;
            yval[mid1] = d;
        }
        if (yval.find(mid2) == yval.end()) {
            cout << "1 0 " << mid2 << endl;
            ll d;
            cin >> d;
            intime++;
            yval[mid2] = d;
        }
        if (yval[mid1] <= yval[mid2]) {
            yr = mid2;
        } else {
            yl = mid1;
        }
    }
    ll y;
    if (yval.find(yl) == yval.end()) {
        cout << "1 0 " << yl << endl;
        ll d;
        cin >> d;
        intime++;
        yval[yl] = d;
    }
    if (yval.find(yr) == yval.end()) {
        cout << "1 0 " << yr << endl;
        ll d;
        cin >> d;
        intime++;
        yval[yr] = d;
    }
    if (yval[yl] <= xval[yr]) {
        y = yl;
    } else {
        y = yr;
    }
    assert(intime <= 300);
    cout << "2 " << x << " " << y << endl;
}
0