Submission #706862

#	Time	Username	Problem	Language	Result	Execution time	Memory
706862		grossly_overconfident	Permutation (APIO22_perm)	C++17	10 / 100	1 ms	340 KiB

perm

#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
set<long long> p;
#define int long long

vector<signed> construct_permutation(long long k)
{
	int q = 1;
	if (p.empty()){
		while (true){
			p.insert(pow(2, q));
			if (q == 62){
				break;
			}
			q++;
			
		}
	}
	long long remaining = k - (k % 2);
	vector<signed> out, found;
	int os = 0;
	if (k % 2 != 0){
		out.push_back(INT_MAX);
		os++;
	}
	int fs = 0;
	while (remaining > 0){
		
		long long t = *(--p.upper_bound(remaining));
		fs++;
		remaining -= t;
		found.push_back(t);
	}
	for (int i = 0; i < log2(found[0]); ++i){
		out.push_back(i * 2);
		os++;
	}
	for (int i = 1; i < fs; ++i){
		out.push_back((log2(found[i]) - 1) * 2 + 1);
		os++;
	}

	vector<signed> outsorted = out;
	sort(outsorted.begin(), outsorted.end());

	for (int i = 0; i < os; ++i){
		for (int j = 0; j < os; ++j){
			if (outsorted[i] == out[j]){
				out[j] = i;
				break;
			}
		}
	}
	
	return out;
}

int no(){
	cout << LONG_LONG_MAX << endl << endl;
	int n;
	cin >> n;
	auto g = construct_permutation(n);
	for (auto h : g){
		cout << h << endl;
	}
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 90