Submission #171340

#TimeUsernameProblemLanguageResultExecution timeMemory
171340MvCCarnival (CEOI14_carnival)C++11
100 / 100
13 ms424 KiB
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define rc(x) return cout<<x<<endl,0 #define pb push_back #define mkp make_pair #define in insert #define er erase #define fd find #define fr first #define sc second typedef long long ll; typedef long double ld; const ll INF=0x3f3f3f3f3f3f3f3f; const ll llinf=(1LL<<62); const int inf=(1<<30); const int nmax=1e5+50; const int mod=1e9+7; using namespace std; int n,i,j,t,l,r,mid,p[155],a[155],c[155],col,rs,x; int main() { //freopen("sol.in","r",stdin); //freopen("sol.out","w",stdout); //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); cin>>n; for(i=1;i<=n;i++)p[i]=i; a[++j]=1; for(i=2;i<=n;i++) { cout<<j+1<<" "<<i; for(t=1;t<=j;t++)cout<<" "<<a[t]; cout<<endl; cin>>x; if(x==j+1)a[++j]=i; else { l=1,r=j,rs=1; while(l<=r) { if(l==r) { rs=l; break; } mid=(l+r)/2; cout<<mid-l+2<<" "<<i; for(t=l;t<=mid;t++)cout<<" "<<a[t]; cout<<endl; cin>>x; if(x==mid-l+2)l=mid+1; else rs=mid,r=mid; } p[i]=a[rs]; } } cout<<0; for(i=1;i<=n;i++) { if(!c[p[i]])c[p[i]]=++col; cout<<" "<<c[p[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...