Submission #1246438

#TimeUsernameProblemLanguageResultExecution timeMemory
1246438trideserArt Collections (BOI22_art)C++20
70 / 100
812 ms528 KiB
#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; 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;
	}
	/*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()
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...