제출 #119251

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

carnival

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n; cin>>n;
    set<int> st;
    vector<int> cst(151,1), pre(151,1);
    for(int i=2;i<=n;i++)
    {
        cout<<i<<" ";
        for(int j=1;j<=i;j++) cout<<j<<" ";
        cout<<endl;
        cin>>pre[i];
        if(pre[i]>pre[i-1]) cst[i]=pre[i];
        else
        {
            int l=1, r=i-1;
            while(l<r)
            {
                int mid=(l+r)/2;
                st.clear();
                cout<<mid-l+1<<" ";
                for(int j=l;j<=mid;j++)
                {
                    cout<<j<<" ";
                    st.insert(cst[j]);
                }
                cout<<i<<" "<<endl;
                int get; cin>>get;
                if(get==int(st.size()))
                    r=mid;
                else
                    l=mid+1;
            }
            cst[i]=pre[l];
        }
    }
    cout<<0<<" ";
    for(int i=1;i<=n;i++) cout<<cst[i]<<" ";
    cout<<endl;
    return 0;
}

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