Submission #657009

#	Time	Username	Problem	Language	Result	Execution time	Memory
657009		Lobo	Art Collections (BOI22_art)	C++17	100 / 100	1866 ms	776 KiB

art

#include "art.h"
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 1e5+10;
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
//     art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
//     g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//

int n;
vector<int32_t> base;
int baseqry = 0;

void solve(int32_t N) {
    // std::vector<int> order = {1, 2, 3};
    // publish(order);
    // order = {2, 3, 1};
    // publish(order);
    // order = {1, 3, 2};
    // answer(order);
    n = N;

    for(int i = 1; i <= n; i++) {
        base.pb(i);
    }
    baseqry = publish(base);

    vector<int> ans(n,0), id(n+1,0), pf(n+1,0), qt(n+1,0);
    // for(int i = 1; i < n; i++) {
    //     vector<int> vq1,vq2;
    //     vq1.pb(i);
    //     for(int j = 1; j <= n; j++) {
    //         if(j != i) vq1.pb(j);
    //         if(j != i) vq2.pb(j);
    //     }
    //     vq2.pb(i);
    //     int q1 = publish(vq1);
    //     int q2 = publish(vq2);
    //     id[i] = (q1-q2+n-1)/2;
    //     ans[id[i]] = i;

    //     int qts = pf[id[i]];
    //     int qtg = i-1-qts;
    //     assert(q1 == baseqry+qts-qtg);

    //     qt[id[i]]++;
    //     pf[0] = qt[0];
    //     for(int j = 1; j <= n; j++) {
    //         pf[j] = pf[j-1]+qt[j];
    //     }
    // }

    for(int i = 1; i < n; i++) {
        vector<int> vq1,vq2;
        vq1.pb(i);
        for(int j = 1; j <= n; j++) {
            if(j != i) vq1.pb(j);
            if(j != i) vq2.pb(j);
        }
        vq2.pb(i);
        int q2 = publish(vq2);
        for(int j = 0; j < n; j++) {
            id[i] = j;
            int qts = pf[id[i]];
            int qtg = i-1-qts;
            int q1 = baseqry+qts-qtg;
            if(id[i] == (q1-q2+n-1)/2 && qt[id[i]] == 0) {
                break;
            }
        }
        ans[id[i]] = i;

        qt[id[i]]++;
        pf[0] = qt[0];
        for(int j = 1; j <= n; j++) {
            pf[j] = pf[j-1]+qt[j];
        }
    }

    for(int i = 0; i < n; i++) {
        if(ans[i] == 0) ans[i] = n;
    }
    answer(ans);
}

Compilation message (stderr)

interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30