oj.uz

Submission #140441

# Submission time Handle Problem Language Result Execution time Memory
140441 2019-08-03T01:05:42 Z silxikys Carnival (CEOI14_carnival) C++14
0 / 100
 14 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 155;
int N; 
int ans[maxn];
vector<int> labels[maxn]; //indices of labels

int ask(vector<int>& v) {
    cout << v.size() << ' ';
    for (int i: v) cout << i << ' ';
    cout << endl;
    int res; cin >> res;
    return res;
}

int distinct[maxn];

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N;
    ans[1] = 1;
    labels[1].push_back(1);
    int last = 1;
    for (int i = 1; i <= N; i++) {
        vector<int> v(i);
        iota(begin(v),end(v),1);
        distinct[i] = ask(v);
    }

    for (int i = 2; i <= N; i++) {
        int r1 = distinct[i-1];
        int r2 = distinct[i];
        if (r2 == r1+1) {
            ans[i] = ++last;
            labels[last].push_back(i);
        }
        else {
            //binary search for which one
            int lo = 1, hi = last;
            while (lo < hi) {
                int mid = (lo+hi)/2;
                vector<int> v;
                for (int j = 1; j <= mid; j++) {
                    for (int l: labels[j]) {
                        v.push_back(l);
                    }
                }
                v.push_back(i);
                int r = ask(v);
                if (r == mid) {
                    hi = mid;
                }
                else {
                    lo = mid+1;
                }
            }
            ans[i] = ans[lo];
            labels[ans[i]].push_back(i);
        }
    }
    cout << 0 << ' ';
    for (int i = 1; i <= N; i++) {
        cout << ans[i] << ' ';
    }
    cout << endl;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 252 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 248 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 296 KB Output is correct
2 Incorrect 11 ms 332 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 376 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 248 KB Output is correct
2 Incorrect 14 ms 248 KB Incorrect
3 Halted 0 ms 0 KB -