제출 #238915

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

carnival

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

const int N = 151;

int n,lst,cur,ans[N];

int ask(int l,int r,int x)
{
    assert(r-l+2<=n);
    assert(r<=n);
    assert(x<=n);
    cout << r-l+2 << ' ';
    for(int i = l;i <= r;i++) cout << i << ' ';
    cout << x << endl;
    int ret;
    cin >> ret;
    return ret;
}

void solve(int l,int r,int x)
{
    if(l==r) return void(ans[x] = ans[l]);
    int m = (l+r)/2;
    if(ask(l,m-1,m)==ask(l,m,x)) solve(l,m,x);
    else solve(m+1,r,x);
}

int main()
{
    cin >> n;
    for(int i = 1;i <= n;i++) 
    {
        if(ask(1,i-1,i)!=lst) ans[i] = ++cur;
        else solve(1,i-1,i);
        lst = ans[i];
    }
    cout << "0 ";
    for(int i = 1;i <= n;i++) assert(ans[i]<=n);
    for(int i = 1;i <= n;i++) cout << ans[i] << ' ';
    cout << endl;
}

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