Submission #956323

#	Time	Username	Problem	Language	Result	Execution time	Memory
956323		steveonalex	Carnival (CEOI14_carnival)	C++17	100 / 100	5 ms	964 KiB

carnival

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int get(vector<int> S){
    cout << S.size() << " "; printArr(S);
    cout.flush();
    int verdict; cin >> verdict; 
    return verdict;
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n; cin >> n;

    vector<int> color(n+1);
    vector<int> S;
    int prev = 0;

    vector<int> distinct;
    for(int i = 1; i<=n; ++i){
        S.push_back(i);
        int cur = get(S);
        if (cur > prev){
            color[i] = cur;
            prev = cur;
            distinct.push_back(i);
        }
    }

    for(int i= 1; i<=n; ++i) if (color[i] == 0){
        int l = 0, r = distinct.size() - 1;
        while(l < r){
            int mid = (l + r) >> 1;
            vector<int> S;
            for(int i = 0; i <= mid; ++i) S.push_back(distinct[i]);
            S.push_back(i);
            if (get(S) < mid + 2) r = mid;
            else l = mid + 1;
        }
        color[i] = l + 1;
    }

    printArr(color);

    return 0;
}

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