제출 #633671

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633671		dooompy	Art Collections (BOI22_art)	C++17	100 / 100	1594 ms	876 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 ans[4005];
int n;

int get(int idx) {
    vector<int> cur;
    for (int i = idx; i < n + idx; i++) {
        cur.push_back(i % n + 1);
    }
    return publish(cur);
}

void solve(int N) {
    n = N;
    for (int i = 0; i < N; i++) {
        ans[i] = get(i);
    }

    vector<pair<int, int>> stuff(n);

    for (int i = 0; i < n; i++) {
        stuff[i] = {i, ans[i] - ans[(i+1)%n]};
    }

    sort(stuff.begin(), stuff.end(), [](pair<int, int> a, pair<int, int> b) {
        return a.second < b.second;
    });

    vector<int> order;

    for (int i = 0; i < n; i++) {
        order.push_back(stuff[i].first + 1);
    }
    answer(order);
}

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