Submission #113237

#TimeUsernameProblemLanguageResultExecution timeMemory
113237brcodeCarnival (CEOI14_carnival)C++14
0 / 100
4 ms384 KiB
#include <iostream> using namespace std; const int MAXN = 155; int counter = 1; int arr[MAXN]; int maxsz; int n; void rec(int l,int r){ //cout<<l<<" "<<r<<endl; if(l == r){ arr[l] = counter; counter++; if(counter>maxsz){ counter--; } return; } cout<<(r-l+1)<<" "; for(int i=l;i<=r;i++){ cout<<i<<" "; } cout<<endl; cout.flush(); int sz; cin>>sz; if(l == 1 && r == n){ maxsz = sz; } if(sz == (r-l+1)){ for(int i=l;i<=r;i++){ arr[i] = counter; counter++; if(counter>maxsz){ counter--; } } return; } if(sz == 1){ for(int i=l;i<=r;i++){ arr[i] = counter; } counter++; if(counter>maxsz){ counter--; } return; } int mid = (l+r)/2; rec(l,mid); rec(mid+1,r); } int main(){ cin>>n; cout.flush(); rec(1,n); cout<<0<<" "; for(int i=1;i<=n;i++){ cout<<arr[i]<<" "; } }
#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...