제출 #1309543

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309543		wetsponge	사육제 (CEOI14_carnival)	C++20	0 / 100	1 ms	332 KiB

carnival

#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
int n;
vector <int> curr;
int arr[300001];
int num=1;
int ask(vector <int> curr){
    cout<<curr.size()<<" ";
    for(int j:curr) cout<<j<<" ";
    int ans;
    cin>>ans;
    return ans;
}
int solve(vector <int> v,int i){
    int l=0,r=v.size()-1,idx=-1;
    while(l<=r){
        int mid=(l+r)/2;
        vector <int> query;
        for(int j=l;j<=mid;j++){
            query.push_back(v[j]);
        }
        query.push_back(i);
        if(ask(query)==(int)query.size()-1){
            idx=v[mid];
            r=mid-1;    
        }
        else l=mid+1;
        query.clear();
    }
    return idx;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        curr.push_back(i);
        if(ask(curr)==curr.size()){
            arr[i]=num++;
            continue;
        }
        curr.pop_back();
        arr[i]=arr[solve(curr,i)];
    }
    cout<<0<<" ";
    for(int i=1;i<=n;i++) cout<<arr[i]<<" ";
    return 0;
}
//g++ -std=c++17 template.cpp -o executable.exe

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