제출 #1127307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1127307		Ludissey	Worm Worries (BOI18_worm)	C++20	10 / 100	1 ms	436 KiB

worm

#include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
using namespace std;
vector<int> a;
map<pair<int,pair<int,int>>,int> req;
int n,m,k,q; 

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

void give_ans(int x, int y, int z){
    cout << "! " << x+1 << " " << y+1 << " " << z+1 << endl;
    return;
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> n >> m >> k >> q;
    int l=0; int r=n-1;
    int ans=0;
    int midc=ask((l+r+1)/2,0,0);
    int midl=ask((l+r+1)/2-1,0,0);
    int last=0;
    bool left=0;
    if(midc<midl){
        last=midl;
        ans=(l+r+1)/2-1;
        r=(l+r+1)/2-1;
    }else{
        last=midc;
        ans=(l+r+1)/2-1;
        l=(l+r+1)/2;
    }
    while(l<r){
        int mid=(l+r+1)/2;
        int midANS=ask(mid,0,0);
        int midANS2=ask(mid-1,0,0);
        if(midANS>=midANS2){
            ans=mid;
            l=mid;
        }else{
            r=mid-1;
            ans=mid-1;
        }
        last=midANS;
    }
    give_ans(ans,0,0);
    return 0;
}

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