oj.uz

Submission #987208

# Submission time Handle Problem Language Result Execution time Memory
987208 2024-05-22T10:47:09 Z VMaksimoski008 Carnival (CEOI14_carnival) C++17
0 / 100
 7 ms 948 KB 
#include <bits/stdc++.h>
using namespace std;

int ask(vector<int> v) {
    cout << v.size() << " ";
    for(int &x : v) cout << x << " ";
    cout << endl;

    int x;
    cin >> x;
    return x;
}

int find(int n) {
    vector<int> ans(n+1);

    ans[1] = 1;
    int cnt = 1;

    vector<int> v = { 1 };
    for(int i=2; i<=n; i++) {
        v.push_back(i);
        int X = ask(v);

        if(X > cnt) {
            ans[i] = ++cnt;
            continue;
        }

        int l=1, r=i-1;
        while(l <= r) {
            int mid = (l + r) / 2;
            vector<int> v2;

            for(int j=1; j<=mid; j++) v2.push_back(j);

            v2.push_back(i);
            if(ask(v2) >= X) ans[i] = ans[mid], r = mid - 1;
            else l = mid + 1;
        }
    }

    for(int &x : ans) cout << x << " ";
    cout << endl;
    return 0;
}

int main() {
    int n;
    cin >> n;
    find(n);
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 696 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 444 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 944 KB Output is correct
2 Incorrect 5 ms 948 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 696 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 436 KB Incorrect
2 Halted 0 ms 0 KB -