Submission #1180688

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180688		vincentbucourt1	Carnival (CEOI14_carnival)	C++20	100 / 100	7 ms	408 KiB

carnival

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 152;
int N;
int color[MAXN];

int query (int i, int l, int r) {
    cout << (r-l+1+(i != l)) << " ";
    if (i != l) {
        cout << i+1 << " ";
    }
    for (int i = l; i <= r; i++) {
        cout << i+1 << " ";
    }
    cout << endl;
    int val;
    cin >> val;
    return val;
}


signed main() {
    cin >> N;
    fill(color, color+N, -1);
    int bigColor = 1;
    for (int i = 0; i < N-1; i++) {
        if (color[i] == -1) {
            color[i] = bigColor;
            bigColor++;
        }
        if (query(i+1, i+1, N-1) == query(i, i, N-1)) {
            int lo = i, hi = N-1;
            while (hi - lo > 1) {
                int mid = max(i+1, lo + (hi - lo) / 2);
                if (query(max(i+1, lo), max(i+1, lo), mid) == query(i, max(i+1, lo), mid)) {
                    hi = mid;
                }
                else {
                    lo = mid;
                }
            }
            cerr << hi << endl;
            color[hi] = color[i];
        }
    }
    if (color[N-1] == -1) {
        color[N-1] = bigColor;
        bigColor++;
    }
    cout << "0 ";
    for (int i = 0; i < N; i++) {
        cout << color[i] << " ";
    }
    cout << endl;
}

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