제출 #623842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
623842		Iwanttobreakfree	Art Collections (BOI22_art)	C++17	0 / 100	0 ms	208 KiB

art

#include "art.h"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//
// --- 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 query(vector<int>& order,int a,int b){
    vector<int> q;
    for(int i=a;i<b;i++)q.push_back(i+1);
    return publish(q);
}
void solve(int N) {
    vector<int> order;
    for(int i=0;i<N;i++)order.push_back(i+1);
    for(int i=0;i<N;i++)order.push_back(i+1);
    vector<int> ans(N);
    vector<pair<int,int>> dif(N);
    for(int i=0;i<N;i++){
        ans[i]=query(order,i,N+i);
    }
    for(int i=0;i<N;i++){
        dif[i].second=i+1;
        dif[i].first=ans[i]-ans[(i+1)%N];
    }
    sort(dif.rbegin(),dif.rend());
    vector<int> sol(N);
    for(int i=0;i<N;i++)sol[i]=dif[i].second;
    answer(sol);
}

컴파일 시 표준 에러 (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: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30