oj.uz

Submission #618872

# Submission time Handle Problem Language Result Execution time Memory
618872 2022-08-02T08:06:53 Z Genius3435 Carnival (CEOI14_carnival) C++17
100 / 100
 9 ms 300 KB 
#include <bits/stdc++.h>
using namespace std;

constexpr int N = 256;
int val[N];
vector<int> has;

int query(int l, int r, int i) {
    cout << r-l+2;
    for (int j = l; j <= r; ++j) {
        cout << ' ' << has[j-1];
    }
    cout << ' ' << i << '\n';
    int c; cin >> c; return c;
}

int main() {
    int n; cin >> n;
    
    val[1] = 1;
    has.push_back(1);

    for (int i = 2; i <= n; ++i) {
        int k = has.size();
        int l = 1, r = k;
        if (query(l,r,i) > r-l+1) {
            val[i] = k+1;
            has.push_back(i);
            continue;
        }
        while (l < r) {
            int m = l + (r-l)/2;
            if (query(l,m,i) == m-l+1) r = m;
            else l = m+1;
        }
        val[i] = l;
    }

    cout << '0';
    for (int i = 1; i <= n; ++i) {
        cout << ' ' << val[i];
    }
    cout << '\n';
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Output is correct
2 Correct 8 ms 220 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 5 ms 296 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 8 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
20.0 / 20.0

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