제출 #995856

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995856		toan2602	사육제 (CEOI14_carnival)	C++14	0 / 100	4 ms	344 KiB

carnival

#include<bits/stdc++.h>

using namespace std;

int ask(vector<int> &v) {
    int x;
    cout << v.size() << ' ';
    for (int i: v) cout << i << ' ';
    cout << endl;
    cin >> x;
    return x;
}
int col[155], C[100000];
vector<int> v;
void solve() {
    int n;
    cin >> n;
    set<int> s;
    for (int i = 1; i <= n; i++) col[i] = i;
    for (int i = 1; i <= n; i++) {
        v.clear();
        int l = i, r = n, mid, pos = 1e9;
        while(l <= r) {
            v.clear();
            mid = (l + r) / 2;
            for (int j = i; j <= mid; j++) {
                v.push_back(j);
            }
            int ans = ask(v);
            if(ans < mid - i + 1) {
                if(ans == mid - i) pos = min(pos, mid);
                r = mid - 1;
            }
            else l = mid + 1;
        }
        if(pos != 1e9) col[pos] = col[i];
        //cout << "DM " << i << ' ' << pos << '\n';
    }
    cout << 0 << ' ';
    for (int i = 1; i <= n; i++) s.insert(col[i]);
    int cnt = 0;
    for (int i: s) C[i] = ++cnt;
    for (int i = 1; i <= n; i++) cout << C[col[i]] << ' ';
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
}

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