Submission #1140924

#TimeUsernameProblemLanguageResultExecution timeMemory
1140924vladiliusCarnival (CEOI14_carnival)C++20
20 / 100
48 ms448 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    auto ask = [&](vector<int> x){
        cout<<x.size()<<"\n";
        for (int i: x){
            cout<<i<<" ";
        }
        cout<<"\n";
        cout.flush();
        int f; cin>>f;
        return f;
    };
    
    auto get = [&](int l, int r){
        vector<int> x;
        for (int i = l; i <= r; i++){
            x.pb(i);
        }
        return ask(x);
    };
    
    int n; cin>>n;
    vector<int> a(n + 1);
    int cc = 0;
    for (int i = 1; i <= n; i++){
        int v = 0;
        set<int> st;
        for (int j = i - 1; j > 0; j--){
            st.insert(a[j]);
            if (get(j, i) == (int) st.size()){
                v = j;
                break;
            }
        }
        if (!v) a[i] = ++cc;
        else a[i] = a[v];
    }
    
    for (int i = 0; i <= n; i++){
        cout<<a[i]<<" ";
    }
    cout<<"\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...