oj.uz

Submission #994156

# Submission time Handle Problem Language Result Execution time Memory
994156 2024-06-07T07:51:53 Z Sharky Carnival (CEOI14_carnival) C++17
100 / 100
 5 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

#define sz(x) (int)x.size()

int query(vector<int>& v) {
    cout << sz(v) << ' ';
    for (auto& i : v) cout << i << ' ';
    cout << endl;
    int x;
    cin >> x;
    return x;
}

int main() {
    int n, id = 1;
    cin >> n;
    vector<int> st = {1}, mp(n+1, 0);
    mp[1] = 1;
    for (int i = 2; i <= n; i++) {
        st.push_back(i);
        if (query(st) == sz(st)) mp[i] = ++id;
        else {
            st.pop_back();
            vector<int> v = st;
            while (sz(v) > 1) {
                int k = sz(v);
                vector<int> l;
                for (int j = 0; j < k / 2; j++) l.push_back(v[j]);
                l.push_back(i);
                if (query(l) == sz(l)) {
                    vector<int> tmp;
                    for (int j = k / 2; j < k; j++) tmp.push_back(v[j]);
                    v = tmp;
                } else {
                    v = l;
                    v.pop_back();
                }
            }
            mp[i] = mp[v[0]];
        }
    }
    cout << "0 ";
    for (int i = 1; i <= n; i++) cout << mp[i] << ' ';
    cout << endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 4 ms 432 KB Output is correct
7 Correct 4 ms 368 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 440 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct