제출 #113239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113239		brcode	사육제 (CEOI14_carnival)	C++14	0 / 100	3 ms	384 KiB

carnival

#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++;
        
        return;
    }
    cout<<(r-l+1)<<" ";
    for(int i=l;i<=r;i++){
        cout<<i<<" ";
    }
    cout << endl;
    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++;
            
        }
        return;
    }
    if(sz == 1){
        for(int i=l;i<=r;i++){
            arr[i] = counter;
            
        }
        counter++;
       
        return;
    }
    int mid = (l+r)/2;
    rec(l,mid);
    rec(mid+1,r);
}
int main(){
  
    cin>>n;

    rec(1,n);
    cout<<0<<" ";
    for(int i=1;i<=n;i++){
        cout<<arr[i]<<" ";
    }
    cout << endl;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20