oj.uz

Submission #720317

# Submission time Handle Problem Language Result Execution time Memory
720317 2023-04-08T02:23:19 Z hoainiem Carnival (CEOI14_carnival) C++14
100 / 100
 9 ms 324 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define lc id<<1
#define rc id<<1^1

using namespace std;
typedef pair<int, int> pii;
int n, k, ans[308];
vector<int>cur{1}, ds;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    ans[1] = 1;
    for (int i = 2; i <= n; i++){
        cout << cur.size() + 1 << ' ';
        for (int tmp : cur)
            cout << tmp << ' ';
        cout << i << endl;
        cin >> k;
        if (k == (int)cur.size() + 1){
            cur.push_back(i);
            ans[i] = cur.size();
        }
        else
            ds.push_back(i);
    }
    for (int tmp : ds){
        int l = 0, mid, r = cur.size() - 1;
        random_shuffle(cur.begin(), cur.end());
        while (l < r){
            mid = (l + r) >> 1;
            cout << mid + 2 << ' ';
            for (int i = 0; i <= mid; i++)
                cout << cur[i] << ' ';
            cout << tmp << endl;
            cin >> k;
            if (k == mid + 1)
                r = mid;
            else
                l = mid + 1;
        }
        ans[tmp] = ans[cur[l]];
    }
    cout << 0 << ' ' ;
    for (int i = 1; i <= n; i++)
        cout << ans[i] << ' ';
    cout << endl;
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 320 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 8 ms 320 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 4 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 7 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 3 ms 312 KB Output is correct
5 Correct 6 ms 208 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
20.0 / 20.0

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