제출 #918189

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

carnival

#include <bits/stdc++.h>
#include <iostream>

using namespace std;

#define ll long long
#define pii pair<ll, ll>
#define oo 1e9

int n;

int main(){
    cin >> n;
    int ans[n + 1];
    vector<int> v;
    ans[1] = 1;
    cout << n << ' ';
    for(int i = 1; i <= n; i++){
        cout << i << ' ';
    }
    cout << endl;
    int C; cin >> C;
    int c = 1;
    for(int i = 2; i <= n; i++){
        int l = 1, r = i - 1;
        cout << i << ' ';
        for(int j = 1; j <= i; j++){
            cout << j << ' ';
        }
        cout << endl;
        int tmp; cin >> tmp;
        if(tmp != c){
            ans[i] = ++c;
            continue;
        }
        while(l < r){
            int mid = (l + r) / 2;
            cout << mid - l + 1 << ' ';
            for(int j = l; j <= mid; j++){
                cout << j << ' ';
            }
            cout << endl;
            int a; cin >> a;
            cout << mid - l + 2 << ' ';
            for(int j = l; j <= mid; j++){
                cout << j << ' ';
            }
            cout << i << ' ';
            cout << endl;
            int b; cin >> b;
            if(a == b){
                r = mid;
            }
            else{
                l = mid + 1;
            }
        }
        ans[i] = l;
    }
    cout << "0 ";
    for(int i = 1; i <= n; i++){
        cout << ans[i] << ' ';
    }
    return 0;
}

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