Submission #603285

#	Time	Username	Problem	Language	Result	Execution time	Memory
603285		l_reho	Art Collections (BOI22_art)	C++17	20 / 100	94 ms	208 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;

void solve(int N) {
	// facciamo 20 punti
	
	vector<int> V;
	vector<int> pos(N+1, -1);
	vector<bool> vis(N+1, 0);
	
	
	for(int i = 0; i < N; i++) V.push_back(i+1);
	
	int ref = publish(V);
	
	
	while(!vis[V[0]]){
		vis[V[0]] = true;
		
		int s = V[0];
		int cnt_left = 0;
		
		for(int j = 1; j < N; j++){
			swap(V[j-1], V[j]);
			
			int nref = publish(V);
			cnt_left += nref == ref-1;
			
			ref = nref;
			
		}
		// cout<<"DEBUG->"<<s<<" "<<cnt_left<<endl;
		pos[s] = cnt_left;
	}
	
	vector<int> ans(N,0);
	
	for(int i = 0; i < N; i++){
		ans[pos[V[i]]] = V[i];
	}
	
	answer(ans);
	// facciamo 35 punti
	
}

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: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30