제출 #1220223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1220223		lizi14	Carnival (CEOI14_carnival)	C++20	100 / 100	7 ms	424 KiB

carnival

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int a[n+1];
    cout<<n<<" ";
    for(int i=1; i<=n; i++){
        a[i]=i;
        cout<<i<<" ";
    }
    cout<<endl;
    int yayay;
    cin>>yayay;
    if(yayay==1){
        cout<<0<<" ";
        for(int i=1; i<=n; i++){
            cout<<1<<" ";
        }
        cout<<endl;
        exit(0);
    }
    else if(yayay==n){
        cout<<0<<" ";
        for(int i=1; i<=n; i++){
            cout<<i<<" ";
        }
        cout<<endl;
        exit(0);
    }
    vector<int>v[yayay+3];
    int m=1,h=1,g=1;
    v[1].push_back(1);
    map<int,int>mp;
    mp[1]=1;
    set<int>s;
    s.insert(1);
    while(m<n){
        m++;
        cout<<m<<" ";
        for(int i=1; i<=m; i++){
            cout<<i<<" ";
        }
        cout<<endl;
        int k;
        cin>>k;
        if(k==h+1){
            s.insert(m);
            h++;
            g++;
            mp[m]=g;
            v[g].push_back(m);
        }
        else{
            for(auto i:s){
                cout<<2<<" ";
                cout<<i<<" "<<m<<endl;
                int y;
                cin>>y;
                if(y==1){
                    mp[m]=mp[i];
                    v[mp[m]].push_back(m);
                    break;
                }
            }
        }
    }
    cout<<0<<" ";
    for(int i=1; i<=m; i++){
        int ha=0;
        for(int j=1; j<=yayay+1; j++){
            auto it=find(v[j].begin(),v[j].end(),i);
            if(it!=v[j].end()){
                cout<<j<<" ";
                break;
            }
        }
    }
    cout<<endl;
}

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