Submission #957469

#	Time	Username	Problem	Language	Result	Execution time	Memory
957469		emad234	Permutation (APIO22_perm)	C++17	91.33 / 100	2 ms	436 KiB

perm

#include "perm.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<int, int>
const int mod = 1e9 + 7;
const int mxN = 1e4 + 100;
using namespace std;

std::vector<int> construct_permutation(long long k)
{
	vector<int>ans;
	bool vis[64] = {};
	int n = -1;
	for(int i = 60;i >= 0;i--){
		if((k >> i) % 2){
			if(n == -1) n = i;
			else vis[i] = 1;
		}
	}
	vector<int>v;
	int id = 0;
	for(int i = 0;i < n;i++){
		if(vis[i]){
			v.push_back(id);
			id++;
		}
		ans.push_back(id);
		id++;
	}
	while(v.size()){
		ans.push_back(v.back());
		v.pop_back();
	}
	return ans;
}

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