Submission #1246444

#	Time	Username	Problem	Language	Result	Execution time	Memory
1246444		trideser	Art Collections (BOI22_art)	C++20	100 / 100	779 ms	528 KiB

art

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

using namespace std;

void solve(int N) {
	vector<int> parts(N);
	for(int i = 0; i < N; i++) {
		parts[i] = i + 1;
	}
	vector<pair<int, int>> delta(N);
	int first = publish(parts);
	int last = first;
	for(int i = 0; i < N - 1; i++) {
		vector<int> parts2;
		for(int i = 1; i < N; i++) {
			parts2.push_back(parts[i]);
		}
		parts2.push_back(parts[0]);
		int ans = publish(parts2);
		delta[i] = make_pair(ans - last, i + 1);
		last = ans;
		parts = parts2;
	}
	delta[N - 1] =make_pair(first - last, N);
	/*for(pair<int, int> a : delta)
		cout << a.first << " " << a.second << " | ";*/
	sort(delta.begin(), delta.end());
	vector<int> ret(N);
	for(int i = 0; i < N; i++) {
		ret[N - 1 - i] = delta[i].second;
	}
	answer(ret);
	//for()
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30