Submission #1030467

#TimeUsernameProblemLanguageResultExecution timeMemory
103046712345678Colors (BOI20_colors)C++17
0 / 100
1 ms344 KiB
#include <bits/stdc++.h> using namespace std; const int nx=1005; int n, tmp, l, r, t, lst, x, ql[nx], qr[nx], used[nx], pv=-1; int query(int x) { cout<<"? "<<x<<endl; cin>>tmp; return tmp; } int main() { cin>>n; //cin>>C; if (n==1) return cout<<"= "<<1, 0; for (int i=1; i<n; i++) ql[i]=1+(n-i)/2, qr[i]=n-((n-i)-1)/2; //cout<<"debug "<<i<<' '<<ql[i]<<' '<<qr[i]<<'\n'; l=r=n; for (int i=60; ; i--) { l=max(1, r-i); if (l==r) return cout<<"= "<<l, 0; if (ql[l]==ql[l+1]) lst=ql[l], query(qr[l]), t=query(ql[l]), used[qr[l]]=used[ql[l]]=1; else lst=qr[l], query(ql[l]), t=query(qr[l]), used[qr[l]]=used[ql[l]]=1; if (t) { r=l; continue; } else { for (int j=l+1; j<r; j++) { if ((lst!=ql[j]&&used[ql[j]])||(lst!=qr[j]&&used[qr[j]])) { l=j; break; } if (lst==ql[j]) { lst=qr[j]; t=query(qr[j]); } else { lst=ql[j]; t=query(ql[j]); } if (t) return cout<<"= "<<j, 0; if (j==r-1) return cout<<"= "<<r, 0; } if (l==r) return cout<<"= "<<l, 0; for (int j=1; j+l<=n; j++) { if (!used[j]&&!used[j+l]) { query(j); t=query(j+l); if (t) return cout<<"= "<<l<<'\n', 0; else return cout<<"= "<<r<<'\n', 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...