제출 #1190919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1190919		nagorn_ph	사육제 (CEOI14_carnival)	C++20	100 / 100	2 ms	408 KiB

carnival

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>

#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

const int mod = 1e9 + 7;
const int inf = 1e18;

int32_t main(){
    int n; cin >> n;
    vector <int> ans(n + 1); ans[1] = 1;
    int idx = 2;
    vector <int> cnt(n + 1); cnt[1] = 1;
    vector <int> curr; curr.emb(1);
    for (int i = 2; i <= n; i++) {
        cout << i << " "; for (int j = 1; j <= i; j++) cout << j << " "; cout << endl;
        cin >> cnt[i];
        if (cnt[i] > cnt[i - 1]) {
            curr.emb(i);
            ans[i] = idx++;
            continue;
        }
        cnt[i] = max(cnt[i], cnt[i - 1]);
        int l = 0, r = cnt[i];
        while (l < r) {
            int mid = (l + r) / 2;
            cout << mid - l + 1 + 1 << " "; for (int i = l; i <= mid; i++) cout << curr[i] << " "; cout << i << endl;
            int c; cin >> c;
            if (c == (mid - l + 1)) r = mid;
            else l = mid + 1;
        }
        ans[i] = ans[curr[l]];
    }
    cout << 0 << " "; for (int i = 1; i <= n; i++) cout << ans[i] << " "; cout << endl;
}

// 1 2 1 2 3 1 1

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 20 / 20