Submission #119252

#TimeUsernameProblemLanguageResultExecution timeMemory
119252medkCarnival (CEOI14_carnival)C++11
0 / 100
3 ms384 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin>>n; set<int> st; vector<int> cst(151,1), pre(151,1); for(int i=2;i<=n;i++) { cout<<i<<" "; for(int j=1;j<=i;j++) cout<<j<<" "; cout<<endl; cin>>pre[i]; if(pre[i]>pre[i-1]) cst[i]=pre[i]; else { int l=1, r=i-1; while(l<r) { int mid=(l+r)/2; st.clear(); cout<<mid-l+1<<" "; for(int j=l;j<=mid;j++) { cout<<j<<" "; st.insert(cst[j]); } cout<<i<<" "<<endl; int get; cin>>get; if(get==int(st.size())) r=mid; else l=mid+1; } cst[i]=pre[l]; } } cout<<0<<" "; for(int i=1;i<=n;i++) cout<<cst[i]<<" "; 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...