Submission #1127304

#TimeUsernameProblemLanguageResultExecution timeMemory
1127304LudisseyWorm Worries (BOI18_worm)C++20
0 / 100
1 ms436 KiB
#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}}]; cout << "? " << x+1 << " " << y+1 << " " << z+1 << endl; if(x<0||x>=n||y<0||y>=m||z<0||z>=k) return -1e9; int ans; cin>>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)/2-1; r=(l+r)/2-2; left=true; }else{ last=midc; ans=(l+r)/2; r=(l+r)/2+1; left=false; } 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+1; }else{ r=mid-2; ans=mid-1; } last=midANS; } give_ans(ans,0,0); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...