제출 #1019771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019771		overwatch9	Art Collections (BOI22_art)	C++17	0 / 100	1 ms	344 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 rng(int i) {
    return rand() % i;
}
void solve(int n) {
    vector <int> order(n);
    for (int i = 1; i <= n; i++)
        order[i-1] = i;
    random_shuffle(order.begin(), order.end(), rng);
    int mn = publish(order);
    for (int i = 0; i < n && mn > 0; i++) {
        for (int j = 0; j < n && mn > 0; j++) {
            if (i == j)
                continue;
            swap(order[i], order[j]);
            int res = publish(order);
            if (res < mn) {
                mn = res;
                break;
            } else
                swap(order[i], order[j]);
        }
    }
    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: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30