제출 #1034763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1034763		happy_node	Art Collections (BOI22_art)	C++17	100 / 100	1292 ms	1960 KiB

art

#include "art.h"

//
// --- 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
//

#include <bits/stdc++.h>

using namespace std;

int ask(deque<int> dq) {
        vector<int> v;
        for(auto x:dq) v.push_back(x);
        return publish(v);
}

void solve(int N) {
        vector<int> P(N);

        deque<int> dq;
        for(int i=1;i<=N;i++) dq.push_back(i);

        int x=ask(dq);
        
        while(dq.back()!=1) {
                int b=dq.back();
                dq.pop_back();
                dq.push_front(b);

                int y=ask(dq);

                int p=y-x;
                int q=N-1;

                int z=(p+q)/2;
                P[z]=b;
                x=y;
        }

        for(int i=0;i<N;i++)
                if(!P[i]) P[i]=1;

        answer(P);
}

컴파일 시 표준 에러 (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