Submission #986175

#TimeUsernameProblemLanguageResultExecution timeMemory
986175ByeWorldWorm Worries (BOI18_worm)C++14
32 / 100
1 ms444 KiB
#include <bits/stdc++.h> #define ll long long #define int long long #define pb push_back #define fi first #define se second #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) #define ld long double using namespace std; typedef pair<int,int> pii; typedef pair<pii,int> ipii; vector <int> vx = {1, -1, 0, 0, 0, 0}; vector <int> vy = {0, 0, 1, -1, 0, 0}; vector <int> vz = {0, 0, 0, 0, 1, -1}; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int all, n, m, k, q; int ansx=-1, ansy, ansz; map <ipii, int> ma; int que(int a, int b, int c){ if(a<=0 || a>n || b<=0 || b>m || c<=0 || c>k) return 0; if(ma.count(ipii(pii(a, b), c)) != 0) return ma[ipii(pii(a, b), c)]; if(all == q) assert(false); cout << "? " << a << ' ' << b << ' ' << c << endl; all++; int x; cin >> x; ma[ipii(pii(a, b), c)] = x; return x; } signed main(){ cin >> n >> m >> k >> q; int len = n; int l=1, r=n, mid1=-1, mid2=-1; while(r-l+1 >= 4){ len = r-l+1; if(mid1==-1) mid1 = l+0.382*len; if(mid2==-1) mid2 = l+0.618*len; if(mid1 >= mid2){ mid1 = l+0.382*len; mid2 = l+0.618*len; if(mid1 >= mid2) break; } if(que(mid1, 1, 1) <= que(mid2, 1, 1)){ l = mid1+1; mid1 = mid2; mid2 = -1; } else { r = mid2-1; mid2 = mid1; mid1 = -1; } } int ans = l; for(int i=l; i<=r; i++){ if(que(i, 1, 1) >= max(que(i+1, 1, 1), que(i-1, 1, 1))){ ans = i; break; } } // assert(ans != -1); cout << "! " << ans << " 1 1" << endl; }
#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...