Submission #657010

#	Time	Username	Problem	Language	Result	Execution time	Memory
657010		Lobo	Art Collections (BOI22_art)	C++17	100 / 100	1658 ms	784 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;
int n;
vector<int32_t> base;
int baseqry = 0;

void solve(int32_t N) {
    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 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