Submission #595399

#	Time	Username	Problem	Language	Result	Execution time	Memory
595399		Deepesson	Art Collections (BOI22_art)	C++17	70 / 100	1629 ms	652 KiB

art

#include <bits/stdc++.h>
/**
 * returns how many complaints you will receive for this ordering of the art collections
 */
int publish(std::vector<int>);

/**
 * use this function when you have found the correct order of the art collections
 * You must call answer exactly once; your program will be automatically
 * terminated afterwards.
 */
void answer(std::vector<int>);

/**
 * implement this function
 */
void solve(int N);

int _N;
int publish(std::deque<int> x){
    std::vector<int> u;
    for(auto&z:x)u.push_back(z);
    return publish(u);
}

int descobrir_posicao(int x){
    std::deque<int> vec;
    for(int i=0;i!=_N;++i){
        if(i+1==x)continue;
        vec.push_back(i+1);
    }
    std::deque<int> back,front;
    back=vec;
    front=vec;
    back.push_back(x);
    front.push_front(x);
    int alpha = publish(back),beta=publish(front);

    int custo_base = (alpha+beta-(_N-1))/2;

    ///Quantos caras na frente tem?

    int posicao = beta-custo_base;
    return posicao;
}

void solve(int N) {
    _N=N;
    int array[N]={};
    for(int i=0;i!=N;++i){
        int p = descobrir_posicao(i+1);
        array[p]=i+1;
    }
    std::vector<int> res;
    for(int i=0;i!=N;++i)res.push_back(array[i]);
    answer(res);
}

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: 0 / 30