제출 #113281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113281		brcode	Carnival (CEOI14_carnival)	C++14	100 / 100	10 ms	412 KiB

carnival

#include <iostream>

using namespace std;
const int MAXN = 155;
int counter = 1;
int arr[MAXN];
int visited[MAXN];
int sz;
int n;
bool check(int l,int r,int i){
    cout<<r-l+2<<" ";
    cout<<i<<" ";
    for(int i=l;i<=r;i++){
        cout<<arr[i]<<" ";
    }
    cout<<endl;
    cout.flush();
    int x;
    cin>>x;
    if(x == r-l+2){
        return false;
    }
    return true;
}
int main(){
  
    cin>>n;
    sz = 2;
    visited[1] = 1;
    arr[1] = 1;
    for(int i=2;i<=n;i++){
        cout<<sz<<" ";
        for(int j=1;j<sz;j++){
            cout<<arr[j]<<" ";
        }
        cout<<i<<" ";
        cout.flush();
        cout<<endl;
        int x;
        cin>>x;
        if(x == sz){
            arr[sz] = i;
            visited[i] = sz;
            sz++;
        }
    }
    
    for(int i=1;i<=n;i++){
        if(visited[i]){
            continue;
        }
        int l=1;
        int r = sz-1;
        int ans = 1;
        while(l<=r){
            int mid = (l+r)/2;
            if(check(l,mid,i)){
                r = mid-1;
                ans = mid;
            }else{
                l=mid+1;
            }
        }
        visited[i] =ans;
    }
    cout<<0<<" ";
    for(int i=1;i<=n;i++){
        cout<<visited[i]<<" ";
    }
}

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