제출 #600878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
600878		CSQ31	Art Collections (BOI22_art)	C++17	100 / 100	1541 ms	708 KiB

art

#include <bits/stdc++.h>
#include "art.h"

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
//
void solve(int n){
	//find inversion sequence
	vector<int>q(n),qq(n);
	for(int i=0;i<n;i++)q[i] = i+1;
	int cur = publish(q);
	vector<int>inv(n);
	for(int i=1;i<n;i++){
		qq = q;
		for(int j=i;j>0;j--)qq[j] = qq[j-1];
		qq[0] = q[i];
		int ncur = publish(qq);
		//a = #bigger than p(i)
		//b = #smaller than p(i);
		//a+b = i
		//cur - ncur = a-b
		inv[i] = i + (cur-ncur);
		inv[i]/=2;
	}
	//for(int i=0;i<n;i++)cout<<inv[i]<<" ";
	//cout<<'\n';
	vector<bool>used(n+1,0);
	vector<int>ans(n),p(n);
	for(int i=n-1;i>=0;i--){
		for(int j=n;j>=1;j--){
			if(used[j])continue;
			if(!inv[i]){
				ans[i] = j;
				used[j] = 1;
				break;
			}
			inv[i]--;
		}
	}
	for(int i=0;i<n;i++)p[ans[i]-1] = 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