Submission #237669

#TimeUsernameProblemLanguageResultExecution timeMemory
237669zaneyuCarnival (CEOI14_carnival)C++14
100 / 100
34 ms384 KiB
/*input 0 */ #include<bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #pragma GCC optimize("unroll-loops,no-stack-protector") //order_of_key #of elements less than x // find_by_order kth element #define ll long long #define ld long double #define pii pair<double,double> typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; #define f first #define s second #define pb push_back #define REP(i,n) for(int i=0;i<n;i++) #define REP1(i,n) for(int i=1;i<=n;i++) #define FILL(n,x) memset(n,x,sizeof(n)) #define ALL(_a) _a.begin(),_a.end() #define sz(x) (int)x.size() #define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end())))) #define MP make_pair const ll INF64=4e12; const int INF=0x3f3f3f3f; const ll MOD=1e9+7; const ld PI=acos(-1); const ld eps=1e-9; #define lowb(x) x&(-x) #define MNTO(x,y) x=min(x,(__typeof__(x))y) #define MXTO(x,y) x=max(x,(__typeof__(x))y) ll mult(ll a,ll b){ return ((a%MOD)*(b%MOD))%MOD; } ll mypow(ll a,ll b){ if(b<=0) return 1; ll res=1LL; while(b){ if(b&1){ res=(res*a)%MOD; } a=(a*a)%MOD; b>>=1; } return res; } const ll maxn=150+5; const ll maxlg=__lg(maxn)+2; int col[maxn]; int query(vector<int> q){ assert(sz(q)); if(sz(q)==1){ return 1; } cout<<sz(q)<<' '; for(int x:q) cout<<x<<' '; cout<<endl; int k; cin>>k; return k; } void rec(int cur,int l,int r){ if(l==r){ col[l]=col[cur]; return; } int mid=(l+r)/2; vector<int> v; v.pb(cur); for(int j=l;j<=mid;j++) v.pb(j); int x=query(v); v.erase(lower_bound(ALL(v),cur)); int z=query(v); if(x==z) rec(cur,l,mid); else rec(cur,mid+1,r); } int main(){ ios::sync_with_stdio(false),cin.tie(0); int n; cin>>n; int cur=1; REP1(i,n){ if(!col[i]) col[i]=(cur++); if(i==n) break; vector<int> v; for(int j=i;j<=n;j++){ v.pb(j); } int x=query(v); v.erase(lower_bound(ALL(v),i)); int z=query(v); if(x==z){ rec(i,i+1,n); } } cout<<"0 "; REP1(i,n) cout<<col[i]<<' '; cout<<endl; }
#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...