Submission #727305

#	Time	Username	Problem	Language	Result	Execution time	Memory
727305		Arturgo	Art Collections (BOI22_art)	C++17	100 / 100	1499 ms	868 KiB

art

#include "art.h"
#include <bits/stdc++.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) {
   	deque<int> ordre;
   	
   	for(int i = 0;i < N;i++) {
   		ordre.push_back(i + 1);
   	}
   	
   	vector<int> costs;
   	for(int i = 0;i < N;i++) {
   		vector<int> cyc_ordre(ordre.begin(), ordre.end());
   		costs.push_back(publish(cyc_ordre));
   		
   		ordre.pop_front();
   		ordre.push_back(1 + i);
   	}
   	
   	vector<int> classement(N, 0);
   	
   	for(int i = 0;i < N;i++) {
   		int first = costs[i];
   		int last = costs[(i + 1) % N];
   		int rk = -(last - first - (N - 1)) / 2;
   		
   		classement[rk] = i + 1;
   	}
   	
   	answer(classement);
}

Compilation message (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