제출 #1335067

#제출 시각아이디문제언어결과실행 시간메모리
1335067trandaihao5555사육제 (CEOI14_carnival)C++20
100 / 100
5 ms436 KiB
#include<bits/stdc++.h>
using namespace std;

const int MaxN = 157;

int n,m = 0,arr[MaxN],res[MaxN],Rev[MaxN];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    for (int i=1;i<=n;i++) {
        int l = 1, r = m;
        int tmp = 0;
        while (l <= r) {
            int mid = (l+r) >> 1;
            cout << mid + 1 << ' ' << i << ' ';
            for (int j=1;j<=mid;j++) cout << arr[j] << ' '; cout << endl;
            int x; cin >> x;
            if (x == mid + 1) {
                tmp = mid;
                l = mid + 1;
            }
            else r = mid - 1;
        }
        if (tmp == m) res[i] = arr[++m] = i;
        else res[i] = arr[tmp + 1];
    }
    cout << 0 << ' ';
    for (int i=1;i<=m;i++) Rev[arr[i]] = i;
    for (int i=1;i<=n;i++) cout << Rev[res[i]] << ' '; cout << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...