제출 #1261477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1261477		Zbyszek99	Worm Worries (BOI18_worm)	C++20	36 / 100	411 ms	9808 KiB

worm

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

struct point
{
    int x,y,z;
    bool operator<(const point& other) const
    {
        return x < other.x;
    }
};

ll n,m,k,q;
map<ll,int> query_map;

int ask(int x, int y, int z)
{
    x++;
    y++;
    z++;
    if(x < 1 || x > n || y < 1 || y > m || z < 1 || z > k) return 0;
    int h = x-1 + (y-1)*n + (z-1)*n*m;
    if(query_map.find(h) != query_map.end()) return query_map[h];
    cout << "? " << x << " " << y << " " << z << endl;
    cin >> query_map[h];
    return query_map[h];
}

bool check(point p)
{
    int x = p.x;
    int y = p.y;
    int z = p.z;
    return ask(x,y,z) >= max({ask(x-1,y,z),ask(x+1,y,z),ask(x,y-1,z),ask(x,y+1,z),ask(x,y,z-1),ask(x,y,z+1)});
}

point solve(int nl, int nr, int ml, int mr, int kl, int kr)
{
    if((nr-nl+1)*(mr-ml+1)*(kr-kl+1) <= 8)
    {
        rep2(x,nl,nr)
        {
            rep2(y,ml,mr)
            {
                rep2(z,kl,kr)
                {
                    if(check({x,y,z})) return {x,y,z};
                }
            }
        }
        return {-1,-1,-1};
    }
    int n_cost = (mr-ml+1)*(kr-kl+1);
    int m_cost = (nr-nl+1)*(kr-kl+1);
    int k_cost = (mr-ml+1)*(nr-nl+1);
    pair<int,point> best = {-1,{0,0,0}};
    rep2(y,ml,mr)
    {
        rep2(z,kl,kr)
        {
            best = max(best,{ask(nl-1,y,z),{nl-1,y,z}});
            best = max(best,{ask(nr+1,y,z),{nr+1,y,z}});
        }
    }
    rep2(x,nl,nr)
    {
        rep2(z,kl,kr)
        {
            best = max(best,{ask(x,ml-1,z),{x,ml-1,z}});
            best = max(best,{ask(x,mr+1,z),{x,mr+1,z}});
        }
    }
    rep2(y,ml,mr)
    {
        rep2(x,nl,nr)
        {
            best = max(best,{ask(x,y,kl-1),{x,y,kl-1}});
            best = max(best,{ask(x,y,kr+1),{x,y,kr+1}});
        }
    }
    //cout << n_cost << " " << m_cost << " " << k_cost << " xd\n";
    if(n_cost == min({n_cost,m_cost,k_cost}))
    {
        int mid = (nl+nr)/2;
        rep2(y,ml,mr)
        {
            rep2(z,kl,kr)
            {
                best = max(best,{ask(mid,y,z),{mid,y,z}});
            }
        }
        if(best.ss.x == mid)
        {
            best = max(best,{ask(mid-1,best.ss.y,best.ss.z),{mid-1,best.ss.y,best.ss.z}});
            best = max(best,{ask(mid+1,best.ss.y,best.ss.z),{mid+1,best.ss.y,best.ss.z}});
        }
        if(check(best.ss)) return best.ss;
        if(best.ss.x < mid)
        {
            return solve(nl,mid,ml,mr,kl,kr);
        }
        else
        {
            return solve(mid,nr,ml,mr,kl,kr);
        }
    }
    else if(m_cost == min({m_cost,k_cost}))
    {
        int mid = (ml+mr)/2;
   //     cerr << mid << " mid\n";
        rep2(x,nl,nr)
        {
            rep2(z,kl,kr)
            {
                best = max(best,{ask(x,mid,z),{x,mid,z}});
            }
        }
        if(best.ss.y == mid)
        {
            best = max(best,{ask(best.ss.x,mid-1,best.ss.z),{best.ss.x,mid-1,best.ss.z}});
            best = max(best,{ask(best.ss.x,mid+1,best.ss.z),{best.ss.x,mid+1,best.ss.z}});
        }
        if(check(best.ss)) return best.ss;
        if(best.ss.y < mid)
        {
            return solve(nl,nr,ml,mid,kl,kr);
        }
        else
        {
            return solve(nl,nr,mid,mr,kl,kr);
        }
    }
    else
    {
        int mid = (kl+kr)/2;
        rep2(x,nl,nr)
        {
            rep2(y,ml,mr)
            {
                best = max(best,{ask(x,y,mid),{x,y,mid}});
            }
        }
        if(best.ss.z == mid)
        {
            best = max(best,{ask(best.ss.x,best.ss.y,mid-1),{best.ss.x,best.ss.y,mid-1}});
            best = max(best,{ask(best.ss.x,best.ss.y,mid+1),{best.ss.x,best.ss.y,mid+1}});
        }
        if(check(best.ss)) return best.ss;
        if(best.ss.z < mid)
        {
            return solve(nl,nr,ml,mr,kl,mid);
        }
        else
        {
            return solve(nl,nr,ml,mr,mid,kr);
        }
    }
}

int main()
{
    cin >> n >> m >> k >> q;
    point ans = solve(0,n-1,0,m-1,0,k-1);
    cout << "! " << ans.x+1 << " " << ans.y+1 << " " << ans.z+1 << "\n";
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 22
• Subtask 3: 12 / 12
• Subtask 4: 0 / 19
• Subtask 5: 14 / 14
• Subtask 6: 0 / 23