제출 #919376

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919376		Elvin_Fritl	사육제 (CEOI14_carnival)	C++17	100 / 100	4 ms	596 KiB

carnival

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
 
const int N=2e5+5, mod=1e9+7;

int col[N] , per[N];  

int main() {
    int n;
    cin >> n;
    col[1] = 1;
    per[1] = 1;
    int cur = 1;
    for(int i = 2; i <= n; i++) {
        cout << cur + 1 << ' ';
        for (int j = 1; j <= cur; j++) {
          cout << per[j] << ' ';
        }
        cout << i << endl;
        int res;
        cin >> res;
        if(res == cur + 1) {
            col[i] = ++cur;
            per[cur] = i;
            continue;
        }
        int l = 1;
        int r = cur;
        while(l < r) {
            int mid = (l + r) >> 1;
            cout << mid + 1 << ' ';
            for (int j = 1; j <= mid; j++) {
                cout << per[j] << ' ';
            }
            cout << i << endl;
            int res;
            cin >> res;
            if(res == mid + 1) {
                l = mid + 1;
            }
            else {
                r = mid;
            }
        }
        per[l] = i;
        col[i] = l;
    }
    cout << 0 << ' ';
    for(int i = 1; i <= n; i++) {
        cout << col[i] << ' ';
    }
    cout << endl;
}

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