제출 #97609

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

carnival

#include<bits/stdc++.h>
using namespace std;



int get(int l, int r){
    cout << r - l + 1 << " ";
    for(int i = l; i <= r; i++){
        cout << i << " ";
    }
    cout << endl;
    int x;
    cin >> x;
    return x;
}

int main(){
    int n;
    cin >> n;
    int a[n + 5], sz = 0;
    memset(a, 0, sizeof(a));
    for(int i = 1; i <= n; i++){
        if(!a[i]){
            a[i] = ++sz;
        }
        if(i == n){
            break;
        }
        int l = i + 1, r = n;
        while(r - l > 1){
            int mid = (r + l) >> 1;
            if(get(i + 1, mid) < get(i, mid)){
                l = mid;
            }
            else{
                r = mid;
            }
        }
        if(get(i + 1, l) == get(i, l)){
            a[l] = a[i];
        }
        else if(get(i + 1, r) == get(i, r)){
            a[r] = a[i];
        }
    }
    cout << "0 ";
    for(int i = 1; i <= n; i++){
        cout << a[i] << " ";
    }
    cout << endl;
}

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