Submission #116773

#TimeUsernameProblemLanguageResultExecution timeMemory
116773ioilolcomCarnival (CEOI14_carnival)C++14
0 / 100
14 ms404 KiB
#include <bits/stdc++.h> using namespace std; #define endl "\n" typedef long long int ll; const int N=125; int P[N],ans[N]; int cnt=0; int query(int e,int a){ if(a<=e) { cout<<e<<" "; for(int i=1; i<=e; i++) { cout<<i<<" "; } cout<<endl; fflush(stdout); } else{ cout<<e+1<<" "; for(int i=1; i<=e; i++) { cout<<i<<" "; } cout<<a<<endl; fflush(stdout); } int cur; cin>>cur; return cur; } int main() { int n; cin>>n; for(int i=1; i<=n; i++) { P[i]=query(i,0); } for(int i=1; i<=n; i++) { int l=1; int r=i; while(l<r) { int mid=(l+r)/2; if(P[mid]==query(mid,i)) { r=mid; } else{ l=mid+1; } } if(i==l) { ans[i]=++cnt; } else{ ans[i]=ans[l]; } } cout<<0<<" "; for(int i=1; i<=n; i++) { cout<<ans[i]<<" "; } cout<<endl; 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...