제출 #1220157

#제출 시각아이디문제언어결과실행 시간메모리
1220157LM1사육제 (CEOI14_carnival)C++20
100 / 100
3 ms432 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int,int> #define ff first #define ss second #define pb push_back #define vi vector<int> #define fr(i,ii,iii) for(int i=ii;i<iii;i++) const int N=153; int n,x=1,a,b; int c[N]; vi v; int main(){ ios_base::sync_with_stdio(NULL);cin.tie(NULL); cin>>n; fr(i,1,n+1){ cout<<i<<" ";fr(j,1,i+1)cout<<j<<" ";cout<<endl; cin>>b; if(a!=b){ c[i]=x; v.pb(i); x++; } a=b; } //fr(i,1,n+1)cout<<c[i]<<" "; //cout<<endl; int n1=v.size(); fr(i,1,n+1){ if(c[i]!=0)continue; int l=0,r=n1-1,m; while(l<r){ m=(l+r)/2; int sz=m-l+1; cout<<sz+1<<" ";fr(j,l,m+1)cout<<v[j]<<" ";cout<<i<<endl; cin>>a; if(a==sz){ r=m; } else{ l=m+1; } } c[i]=c[v[l]]; } cout<<"0 ";fr(i,1,n+1)cout<<c[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...