Submission #1334918

#TimeUsernameProblemLanguageResultExecution timeMemory
1334918trandaihao5555Carnival (CEOI14_carnival)C++20
0 / 100
2 ms344 KiB
#include<bits/stdc++.h>
using namespace std;

const int MaxN = 157;

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

int main() {
    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<=n;i++) cout << res[i] << ' '; cout << endl;
}
#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...