Submission #1179015

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179015		woohyun_jng	Library (JOI18_library)	C++20	0 / 100	0 ms	420 KiB

library

#include "library.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX = 1001;

vector<int> ans;
bool chk[MAX];

int N;

int query(vector<int> &Q) {
    int cnt = accumulate(Q.begin(), Q.end(), 0);
    return cnt - Query(Q);
}

int get(int X, vector<int> arr) {
    int S = arr.size(), A, B;
    if (S == 1)
        return arr[0];

    vector<int> L, R, T(N, 0);
    for (int i = 0; i < S / 2; i++)
        L.push_back(arr[i]), T[arr[i]] = 1;
    for (int i = S / 2; i < S; i++)
        R.push_back(arr[i]);

    A = query(T);
    T[X] = 1, B = query(T);

    if (B - A >= 1)
        return get(X, L);
    else
        return get(X, R);
}

void Solve(int n) {
    N = n;
    vector<int> Q(N, 1);

    for (int i = 0; i < N; i++) {
        Q[i] = 0;
        if (query(Q) == N - 2) {
            ans.push_back(i), chk[i] = true;
            break;
        }
        Q[i] = 1;
    }

    cout << ans[0] << " ";
    for (int i = 1; i < N; i++) {
        Q.clear();
        for (int j = 0; j < N; j++) {
            if (chk[j] || j == i)
                continue;
            Q.push_back(j);
        }
        ans.push_back(get(ans[i - 1], Q)), chk[ans[i]] = true;
    }

    for (int i = 0; i < N; i++)
        ans[i]++;

    Answer(ans);
}

• Subtask 1: 0 / 19
• Subtask 2: 0 / 81